/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.07.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 15:27:08,267 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 15:27:08,268 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 15:27:08,313 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 15:27:08,314 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 15:27:08,314 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 15:27:08,315 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 15:27:08,317 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 15:27:08,318 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 15:27:08,319 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 15:27:08,319 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 15:27:08,321 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 15:27:08,321 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 15:27:08,335 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 15:27:08,336 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 15:27:08,337 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 15:27:08,337 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 15:27:08,338 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 15:27:08,339 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 15:27:08,340 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 15:27:08,341 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 15:27:08,341 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 15:27:08,342 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 15:27:08,342 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 15:27:08,343 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 15:27:08,344 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 15:27:08,344 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 15:27:08,344 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 15:27:08,345 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 15:27:08,345 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 15:27:08,346 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 15:27:08,346 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 15:27:08,346 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 15:27:08,347 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 15:27:08,347 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 15:27:08,348 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 15:27:08,348 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 15:27:08,348 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 15:27:08,348 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 15:27:08,349 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 15:27:08,349 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 15:27:08,352 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 15:27:08,352 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 15:27:08,375 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 15:27:08,376 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 15:27:08,376 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 15:27:08,376 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 15:27:08,377 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 15:27:08,377 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 15:27:08,377 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 15:27:08,377 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 15:27:08,377 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 15:27:08,377 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 15:27:08,377 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 15:27:08,378 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 15:27:08,378 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 15:27:08,378 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 15:27:08,378 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 15:27:08,378 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 15:27:08,378 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 15:27:08,378 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 15:27:08,378 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 15:27:08,378 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 15:27:08,378 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 15:27:08,379 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 15:27:08,379 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 15:27:08,379 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 15:27:08,379 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:27:08,379 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 15:27:08,379 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 15:27:08,379 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 15:27:08,379 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 15:27:08,379 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 15:27:08,379 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 15:27:08,379 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 15:27:08,380 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 15:27:08,380 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 15:27:08,543 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 15:27:08,561 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 15:27:08,563 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 15:27:08,563 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 15:27:08,571 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 15:27:08,572 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_srvr.blast.07.i.cil-2.c [2022-04-27 15:27:08,628 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/240b574e0/19e9254f1ec74cc58b29454748a4f955/FLAG4922bb4f5 [2022-04-27 15:27:09,094 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 15:27:09,095 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.07.i.cil-2.c [2022-04-27 15:27:09,116 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/240b574e0/19e9254f1ec74cc58b29454748a4f955/FLAG4922bb4f5 [2022-04-27 15:27:09,614 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/240b574e0/19e9254f1ec74cc58b29454748a4f955 [2022-04-27 15:27:09,616 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 15:27:09,617 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 15:27:09,619 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 15:27:09,619 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 15:27:09,621 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 15:27:09,625 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:27:09" (1/1) ... [2022-04-27 15:27:09,625 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4be84e5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:27:09, skipping insertion in model container [2022-04-27 15:27:09,625 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:27:09" (1/1) ... [2022-04-27 15:27:09,634 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 15:27:09,675 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 15:27:09,983 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.07.i.cil-2.c[74369,74382] [2022-04-27 15:27:10,001 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:27:10,016 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 15:27:10,138 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.07.i.cil-2.c[74369,74382] [2022-04-27 15:27:10,140 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:27:10,150 INFO L208 MainTranslator]: Completed translation [2022-04-27 15:27:10,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:27:10 WrapperNode [2022-04-27 15:27:10,153 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 15:27:10,155 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 15:27:10,155 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 15:27:10,155 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 15:27:10,162 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:27:10" (1/1) ... [2022-04-27 15:27:10,162 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:27:10" (1/1) ... [2022-04-27 15:27:10,187 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:27:10" (1/1) ... [2022-04-27 15:27:10,188 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:27:10" (1/1) ... [2022-04-27 15:27:10,250 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:27:10" (1/1) ... [2022-04-27 15:27:10,255 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:27:10" (1/1) ... [2022-04-27 15:27:10,257 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:27:10" (1/1) ... [2022-04-27 15:27:10,260 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 15:27:10,261 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 15:27:10,261 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 15:27:10,261 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 15:27:10,262 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:27:10" (1/1) ... [2022-04-27 15:27:10,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:27:10,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 15:27:10,325 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 15:27:10,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 15:27:10,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 15:27:10,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 15:27:10,373 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 15:27:10,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2022-04-27 15:27:10,375 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2022-04-27 15:27:10,375 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 15:27:10,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-04-27 15:27:10,375 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-27 15:27:10,375 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-27 15:27:10,375 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-27 15:27:10,375 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 15:27:10,376 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 15:27:10,376 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 15:27:10,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 15:27:10,376 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-27 15:27:10,376 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-27 15:27:10,376 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 15:27:10,376 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-27 15:27:10,376 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-27 15:27:10,376 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-27 15:27:10,376 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2022-04-27 15:27:10,376 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-27 15:27:10,376 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-04-27 15:27:10,376 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2022-04-27 15:27:10,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-27 15:27:10,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-27 15:27:10,377 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 15:27:10,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-27 15:27:10,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 15:27:10,377 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-27 15:27:10,377 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 15:27:10,377 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-27 15:27:10,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-27 15:27:10,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 15:27:10,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 15:27:10,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 15:27:10,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-27 15:27:10,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-27 15:27:10,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-27 15:27:10,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-27 15:27:10,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 15:27:10,516 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 15:27:10,517 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 15:27:11,213 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-27 15:27:11,637 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2022-04-27 15:27:11,637 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2022-04-27 15:27:11,645 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 15:27:11,651 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 15:27:11,651 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 15:27:11,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:27:11 BoogieIcfgContainer [2022-04-27 15:27:11,652 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 15:27:11,653 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 15:27:11,653 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 15:27:11,656 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 15:27:11,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 03:27:09" (1/3) ... [2022-04-27 15:27:11,656 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fb98483 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:27:11, skipping insertion in model container [2022-04-27 15:27:11,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:27:10" (2/3) ... [2022-04-27 15:27:11,656 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fb98483 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:27:11, skipping insertion in model container [2022-04-27 15:27:11,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:27:11" (3/3) ... [2022-04-27 15:27:11,657 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.07.i.cil-2.c [2022-04-27 15:27:11,666 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 15:27:11,666 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 15:27:11,696 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 15:27:11,700 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4abfa7dd, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6bd3afc5 [2022-04-27 15:27:11,701 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 15:27:11,707 INFO L276 IsEmpty]: Start isEmpty. Operand has 158 states, 150 states have (on average 1.7066666666666668) internal successors, (256), 151 states have internal predecessors, (256), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 15:27:11,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-27 15:27:11,713 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:27:11,714 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:27:11,714 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:27:11,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:27:11,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1538020646, now seen corresponding path program 1 times [2022-04-27 15:27:11,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:27:11,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367562512] [2022-04-27 15:27:11,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:27:11,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:27:11,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:27:12,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:27:12,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:27:12,052 INFO L290 TraceCheckUtils]: 0: Hoare triple {168#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {161#true} is VALID [2022-04-27 15:27:12,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {161#true} assume true; {161#true} is VALID [2022-04-27 15:27:12,053 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {161#true} {161#true} #689#return; {161#true} is VALID [2022-04-27 15:27:12,054 INFO L272 TraceCheckUtils]: 0: Hoare triple {161#true} call ULTIMATE.init(); {168#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:27:12,054 INFO L290 TraceCheckUtils]: 1: Hoare triple {168#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {161#true} is VALID [2022-04-27 15:27:12,055 INFO L290 TraceCheckUtils]: 2: Hoare triple {161#true} assume true; {161#true} is VALID [2022-04-27 15:27:12,055 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {161#true} {161#true} #689#return; {161#true} is VALID [2022-04-27 15:27:12,055 INFO L272 TraceCheckUtils]: 4: Hoare triple {161#true} call #t~ret161 := main(); {161#true} is VALID [2022-04-27 15:27:12,055 INFO L290 TraceCheckUtils]: 5: Hoare triple {161#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {161#true} is VALID [2022-04-27 15:27:12,055 INFO L290 TraceCheckUtils]: 6: Hoare triple {161#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {161#true} is VALID [2022-04-27 15:27:12,055 INFO L272 TraceCheckUtils]: 7: Hoare triple {161#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {161#true} is VALID [2022-04-27 15:27:12,057 INFO L290 TraceCheckUtils]: 8: Hoare triple {161#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:12,058 INFO L290 TraceCheckUtils]: 9: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:12,059 INFO L290 TraceCheckUtils]: 10: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:12,059 INFO L290 TraceCheckUtils]: 11: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:12,060 INFO L290 TraceCheckUtils]: 12: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:12,060 INFO L290 TraceCheckUtils]: 13: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:12,061 INFO L290 TraceCheckUtils]: 14: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:12,061 INFO L290 TraceCheckUtils]: 15: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:12,062 INFO L290 TraceCheckUtils]: 16: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:12,062 INFO L290 TraceCheckUtils]: 17: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:12,063 INFO L290 TraceCheckUtils]: 18: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:12,063 INFO L290 TraceCheckUtils]: 19: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:12,063 INFO L290 TraceCheckUtils]: 20: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:12,064 INFO L290 TraceCheckUtils]: 21: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:12,064 INFO L290 TraceCheckUtils]: 22: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:12,065 INFO L290 TraceCheckUtils]: 23: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:12,065 INFO L290 TraceCheckUtils]: 24: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:12,066 INFO L290 TraceCheckUtils]: 25: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:12,066 INFO L290 TraceCheckUtils]: 26: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:12,067 INFO L290 TraceCheckUtils]: 27: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:12,067 INFO L290 TraceCheckUtils]: 28: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:12,068 INFO L290 TraceCheckUtils]: 29: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:12,068 INFO L290 TraceCheckUtils]: 30: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:12,069 INFO L290 TraceCheckUtils]: 31: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:12,069 INFO L290 TraceCheckUtils]: 32: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {167#(not (= |ssl3_accept_#t~mem64| 8544))} is VALID [2022-04-27 15:27:12,069 INFO L290 TraceCheckUtils]: 33: Hoare triple {167#(not (= |ssl3_accept_#t~mem64| 8544))} assume 8544 == #t~mem64;havoc #t~mem64; {162#false} is VALID [2022-04-27 15:27:12,070 INFO L290 TraceCheckUtils]: 34: Hoare triple {162#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {162#false} is VALID [2022-04-27 15:27:12,070 INFO L290 TraceCheckUtils]: 35: Hoare triple {162#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {162#false} is VALID [2022-04-27 15:27:12,070 INFO L290 TraceCheckUtils]: 36: Hoare triple {162#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {162#false} is VALID [2022-04-27 15:27:12,070 INFO L290 TraceCheckUtils]: 37: Hoare triple {162#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {162#false} is VALID [2022-04-27 15:27:12,070 INFO L290 TraceCheckUtils]: 38: Hoare triple {162#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {162#false} is VALID [2022-04-27 15:27:12,070 INFO L290 TraceCheckUtils]: 39: Hoare triple {162#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {162#false} is VALID [2022-04-27 15:27:12,070 INFO L290 TraceCheckUtils]: 40: Hoare triple {162#false} assume 8 == ~blastFlag~0; {162#false} is VALID [2022-04-27 15:27:12,071 INFO L290 TraceCheckUtils]: 41: Hoare triple {162#false} assume !false; {162#false} is VALID [2022-04-27 15:27:12,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:27:12,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:27:12,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367562512] [2022-04-27 15:27:12,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367562512] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:27:12,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:27:12,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:27:12,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028078585] [2022-04-27 15:27:12,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:27:12,077 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-27 15:27:12,078 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:27:12,080 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:12,117 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:27:12,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:27:12,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:27:12,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:27:12,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:27:12,134 INFO L87 Difference]: Start difference. First operand has 158 states, 150 states have (on average 1.7066666666666668) internal successors, (256), 151 states have internal predecessors, (256), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:15,991 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:27:18,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:18,096 INFO L93 Difference]: Finished difference Result 428 states and 723 transitions. [2022-04-27 15:27:18,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:27:18,097 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-27 15:27:18,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:27:18,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:18,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 723 transitions. [2022-04-27 15:27:18,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:18,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 723 transitions. [2022-04-27 15:27:18,160 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 723 transitions. [2022-04-27 15:27:18,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 723 edges. 723 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:27:18,749 INFO L225 Difference]: With dead ends: 428 [2022-04-27 15:27:18,749 INFO L226 Difference]: Without dead ends: 259 [2022-04-27 15:27:18,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:27:18,757 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 163 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 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, 2.5s IncrementalHoareTripleChecker+Time [2022-04-27 15:27:18,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 461 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-04-27 15:27:18,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-04-27 15:27:18,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 170. [2022-04-27 15:27:18,804 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:27:18,809 INFO L82 GeneralOperation]: Start isEquivalent. First operand 259 states. Second operand has 170 states, 165 states have (on average 1.5818181818181818) internal successors, (261), 165 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:18,811 INFO L74 IsIncluded]: Start isIncluded. First operand 259 states. Second operand has 170 states, 165 states have (on average 1.5818181818181818) internal successors, (261), 165 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:18,812 INFO L87 Difference]: Start difference. First operand 259 states. Second operand has 170 states, 165 states have (on average 1.5818181818181818) internal successors, (261), 165 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:18,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:18,822 INFO L93 Difference]: Finished difference Result 259 states and 396 transitions. [2022-04-27 15:27:18,823 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 396 transitions. [2022-04-27 15:27:18,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:27:18,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:27:18,830 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 259 states. [2022-04-27 15:27:18,830 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 259 states. [2022-04-27 15:27:18,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:18,841 INFO L93 Difference]: Finished difference Result 259 states and 396 transitions. [2022-04-27 15:27:18,841 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 396 transitions. [2022-04-27 15:27:18,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:27:18,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:27:18,843 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:27:18,843 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:27:18,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 165 states have (on average 1.5818181818181818) internal successors, (261), 165 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:18,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 265 transitions. [2022-04-27 15:27:18,848 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 265 transitions. Word has length 42 [2022-04-27 15:27:18,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:27:18,850 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 265 transitions. [2022-04-27 15:27:18,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:18,850 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 265 transitions. [2022-04-27 15:27:18,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-27 15:27:18,851 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:27:18,851 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:27:18,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 15:27:18,851 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:27:18,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:27:18,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1015183371, now seen corresponding path program 1 times [2022-04-27 15:27:18,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:27:18,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419194840] [2022-04-27 15:27:18,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:27:18,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:27:18,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:27:19,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:27:19,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:27:19,093 INFO L290 TraceCheckUtils]: 0: Hoare triple {1411#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {1404#true} is VALID [2022-04-27 15:27:19,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {1404#true} assume true; {1404#true} is VALID [2022-04-27 15:27:19,093 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1404#true} {1404#true} #689#return; {1404#true} is VALID [2022-04-27 15:27:19,094 INFO L272 TraceCheckUtils]: 0: Hoare triple {1404#true} call ULTIMATE.init(); {1411#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:27:19,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {1411#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {1404#true} is VALID [2022-04-27 15:27:19,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {1404#true} assume true; {1404#true} is VALID [2022-04-27 15:27:19,095 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1404#true} {1404#true} #689#return; {1404#true} is VALID [2022-04-27 15:27:19,095 INFO L272 TraceCheckUtils]: 4: Hoare triple {1404#true} call #t~ret161 := main(); {1404#true} is VALID [2022-04-27 15:27:19,095 INFO L290 TraceCheckUtils]: 5: Hoare triple {1404#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; {1404#true} is VALID [2022-04-27 15:27:19,095 INFO L290 TraceCheckUtils]: 6: Hoare triple {1404#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {1404#true} is VALID [2022-04-27 15:27:19,095 INFO L272 TraceCheckUtils]: 7: Hoare triple {1404#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {1404#true} is VALID [2022-04-27 15:27:19,100 INFO L290 TraceCheckUtils]: 8: Hoare triple {1404#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); {1409#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:19,100 INFO L290 TraceCheckUtils]: 9: Hoare triple {1409#(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; {1409#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:19,101 INFO L290 TraceCheckUtils]: 10: Hoare triple {1409#(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; {1409#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:19,101 INFO L290 TraceCheckUtils]: 11: Hoare triple {1409#(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)))); {1409#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:19,102 INFO L290 TraceCheckUtils]: 12: Hoare triple {1409#(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); {1409#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:19,103 INFO L290 TraceCheckUtils]: 13: Hoare triple {1409#(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; {1409#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:19,103 INFO L290 TraceCheckUtils]: 14: Hoare triple {1409#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {1409#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:19,104 INFO L290 TraceCheckUtils]: 15: Hoare triple {1409#(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); {1409#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:19,104 INFO L290 TraceCheckUtils]: 16: Hoare triple {1409#(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); {1409#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:19,105 INFO L290 TraceCheckUtils]: 17: Hoare triple {1409#(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); {1409#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:19,105 INFO L290 TraceCheckUtils]: 18: Hoare triple {1409#(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); {1409#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:19,124 INFO L290 TraceCheckUtils]: 19: Hoare triple {1409#(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); {1409#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:19,125 INFO L290 TraceCheckUtils]: 20: Hoare triple {1409#(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); {1409#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:19,126 INFO L290 TraceCheckUtils]: 21: Hoare triple {1409#(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); {1409#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:19,126 INFO L290 TraceCheckUtils]: 22: Hoare triple {1409#(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); {1409#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:19,127 INFO L290 TraceCheckUtils]: 23: Hoare triple {1409#(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); {1409#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:19,127 INFO L290 TraceCheckUtils]: 24: Hoare triple {1409#(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); {1409#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:19,128 INFO L290 TraceCheckUtils]: 25: Hoare triple {1409#(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); {1409#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:19,129 INFO L290 TraceCheckUtils]: 26: Hoare triple {1409#(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); {1409#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:19,129 INFO L290 TraceCheckUtils]: 27: Hoare triple {1409#(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); {1409#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:19,129 INFO L290 TraceCheckUtils]: 28: Hoare triple {1409#(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); {1409#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:19,130 INFO L290 TraceCheckUtils]: 29: Hoare triple {1409#(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); {1409#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:19,130 INFO L290 TraceCheckUtils]: 30: Hoare triple {1409#(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); {1409#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:19,131 INFO L290 TraceCheckUtils]: 31: Hoare triple {1409#(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); {1409#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:19,132 INFO L290 TraceCheckUtils]: 32: Hoare triple {1409#(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); {1409#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:19,132 INFO L290 TraceCheckUtils]: 33: Hoare triple {1409#(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); {1410#(not (= |ssl3_accept_#t~mem65| 8545))} is VALID [2022-04-27 15:27:19,133 INFO L290 TraceCheckUtils]: 34: Hoare triple {1410#(not (= |ssl3_accept_#t~mem65| 8545))} assume 8545 == #t~mem65;havoc #t~mem65; {1405#false} is VALID [2022-04-27 15:27:19,133 INFO L290 TraceCheckUtils]: 35: Hoare triple {1405#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {1405#false} is VALID [2022-04-27 15:27:19,134 INFO L290 TraceCheckUtils]: 36: Hoare triple {1405#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); {1405#false} is VALID [2022-04-27 15:27:19,134 INFO L290 TraceCheckUtils]: 37: Hoare triple {1405#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {1405#false} is VALID [2022-04-27 15:27:19,134 INFO L290 TraceCheckUtils]: 38: Hoare triple {1405#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); {1405#false} is VALID [2022-04-27 15:27:19,135 INFO L290 TraceCheckUtils]: 39: Hoare triple {1405#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; {1405#false} is VALID [2022-04-27 15:27:19,135 INFO L290 TraceCheckUtils]: 40: Hoare triple {1405#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; {1405#false} is VALID [2022-04-27 15:27:19,135 INFO L290 TraceCheckUtils]: 41: Hoare triple {1405#false} assume 8 == ~blastFlag~0; {1405#false} is VALID [2022-04-27 15:27:19,135 INFO L290 TraceCheckUtils]: 42: Hoare triple {1405#false} assume !false; {1405#false} is VALID [2022-04-27 15:27:19,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:27:19,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:27:19,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419194840] [2022-04-27 15:27:19,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419194840] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:27:19,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:27:19,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:27:19,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031145744] [2022-04-27 15:27:19,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:27:19,139 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-27 15:27:19,139 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:27:19,140 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:19,188 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:27:19,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:27:19,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:27:19,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:27:19,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:27:19,190 INFO L87 Difference]: Start difference. First operand 170 states and 265 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:24,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:24,531 INFO L93 Difference]: Finished difference Result 442 states and 693 transitions. [2022-04-27 15:27:24,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:27:24,531 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-27 15:27:24,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:27:24,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:24,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2022-04-27 15:27:24,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:24,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2022-04-27 15:27:24,541 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 593 transitions. [2022-04-27 15:27:24,965 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 593 edges. 593 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:27:24,987 INFO L225 Difference]: With dead ends: 442 [2022-04-27 15:27:24,987 INFO L226 Difference]: Without dead ends: 287 [2022-04-27 15:27:24,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:27:24,988 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 130 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:27:24,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 342 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-27 15:27:24,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-04-27 15:27:25,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 199. [2022-04-27 15:27:25,011 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:27:25,012 INFO L82 GeneralOperation]: Start isEquivalent. First operand 287 states. Second operand has 199 states, 194 states have (on average 1.6134020618556701) internal successors, (313), 194 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:25,016 INFO L74 IsIncluded]: Start isIncluded. First operand 287 states. Second operand has 199 states, 194 states have (on average 1.6134020618556701) internal successors, (313), 194 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:25,017 INFO L87 Difference]: Start difference. First operand 287 states. Second operand has 199 states, 194 states have (on average 1.6134020618556701) internal successors, (313), 194 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:25,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:25,024 INFO L93 Difference]: Finished difference Result 287 states and 446 transitions. [2022-04-27 15:27:25,024 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 446 transitions. [2022-04-27 15:27:25,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:27:25,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:27:25,025 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 287 states. [2022-04-27 15:27:25,025 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 287 states. [2022-04-27 15:27:25,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:25,033 INFO L93 Difference]: Finished difference Result 287 states and 446 transitions. [2022-04-27 15:27:25,033 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 446 transitions. [2022-04-27 15:27:25,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:27:25,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:27:25,033 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:27:25,033 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:27:25,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 194 states have (on average 1.6134020618556701) internal successors, (313), 194 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:25,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 317 transitions. [2022-04-27 15:27:25,038 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 317 transitions. Word has length 43 [2022-04-27 15:27:25,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:27:25,039 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 317 transitions. [2022-04-27 15:27:25,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:25,039 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 317 transitions. [2022-04-27 15:27:25,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-27 15:27:25,040 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:27:25,040 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:27:25,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 15:27:25,040 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:27:25,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:27:25,040 INFO L85 PathProgramCache]: Analyzing trace with hash 887448580, now seen corresponding path program 1 times [2022-04-27 15:27:25,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:27:25,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758531177] [2022-04-27 15:27:25,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:27:25,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:27:25,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:27:25,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:27:25,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:27:25,211 INFO L290 TraceCheckUtils]: 0: Hoare triple {2750#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {2743#true} is VALID [2022-04-27 15:27:25,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {2743#true} assume true; {2743#true} is VALID [2022-04-27 15:27:25,211 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2743#true} {2743#true} #689#return; {2743#true} is VALID [2022-04-27 15:27:25,212 INFO L272 TraceCheckUtils]: 0: Hoare triple {2743#true} call ULTIMATE.init(); {2750#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:27:25,212 INFO L290 TraceCheckUtils]: 1: Hoare triple {2750#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {2743#true} is VALID [2022-04-27 15:27:25,212 INFO L290 TraceCheckUtils]: 2: Hoare triple {2743#true} assume true; {2743#true} is VALID [2022-04-27 15:27:25,212 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2743#true} {2743#true} #689#return; {2743#true} is VALID [2022-04-27 15:27:25,213 INFO L272 TraceCheckUtils]: 4: Hoare triple {2743#true} call #t~ret161 := main(); {2743#true} is VALID [2022-04-27 15:27:25,213 INFO L290 TraceCheckUtils]: 5: Hoare triple {2743#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; {2743#true} is VALID [2022-04-27 15:27:25,214 INFO L290 TraceCheckUtils]: 6: Hoare triple {2743#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {2743#true} is VALID [2022-04-27 15:27:25,214 INFO L272 TraceCheckUtils]: 7: Hoare triple {2743#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {2743#true} is VALID [2022-04-27 15:27:25,215 INFO L290 TraceCheckUtils]: 8: Hoare triple {2743#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); {2748#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:25,218 INFO L290 TraceCheckUtils]: 9: Hoare triple {2748#(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; {2748#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:25,219 INFO L290 TraceCheckUtils]: 10: Hoare triple {2748#(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; {2748#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:25,219 INFO L290 TraceCheckUtils]: 11: Hoare triple {2748#(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)))); {2748#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:25,220 INFO L290 TraceCheckUtils]: 12: Hoare triple {2748#(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); {2748#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:25,220 INFO L290 TraceCheckUtils]: 13: Hoare triple {2748#(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; {2748#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:25,220 INFO L290 TraceCheckUtils]: 14: Hoare triple {2748#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {2748#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:25,221 INFO L290 TraceCheckUtils]: 15: Hoare triple {2748#(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); {2748#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:25,221 INFO L290 TraceCheckUtils]: 16: Hoare triple {2748#(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); {2748#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:25,222 INFO L290 TraceCheckUtils]: 17: Hoare triple {2748#(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); {2748#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:25,223 INFO L290 TraceCheckUtils]: 18: Hoare triple {2748#(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); {2748#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:25,224 INFO L290 TraceCheckUtils]: 19: Hoare triple {2748#(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); {2748#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:25,225 INFO L290 TraceCheckUtils]: 20: Hoare triple {2748#(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); {2748#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:25,226 INFO L290 TraceCheckUtils]: 21: Hoare triple {2748#(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); {2748#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:25,235 INFO L290 TraceCheckUtils]: 22: Hoare triple {2748#(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); {2748#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:25,236 INFO L290 TraceCheckUtils]: 23: Hoare triple {2748#(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); {2748#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:25,237 INFO L290 TraceCheckUtils]: 24: Hoare triple {2748#(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); {2748#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:25,239 INFO L290 TraceCheckUtils]: 25: Hoare triple {2748#(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); {2748#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:25,240 INFO L290 TraceCheckUtils]: 26: Hoare triple {2748#(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); {2748#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:25,240 INFO L290 TraceCheckUtils]: 27: Hoare triple {2748#(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); {2748#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:25,241 INFO L290 TraceCheckUtils]: 28: Hoare triple {2748#(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); {2748#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:25,241 INFO L290 TraceCheckUtils]: 29: Hoare triple {2748#(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); {2748#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:25,242 INFO L290 TraceCheckUtils]: 30: Hoare triple {2748#(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); {2748#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:25,243 INFO L290 TraceCheckUtils]: 31: Hoare triple {2748#(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); {2748#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:25,243 INFO L290 TraceCheckUtils]: 32: Hoare triple {2748#(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); {2748#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:25,243 INFO L290 TraceCheckUtils]: 33: Hoare triple {2748#(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); {2748#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:25,244 INFO L290 TraceCheckUtils]: 34: Hoare triple {2748#(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); {2748#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:25,244 INFO L290 TraceCheckUtils]: 35: Hoare triple {2748#(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); {2748#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:25,245 INFO L290 TraceCheckUtils]: 36: Hoare triple {2748#(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); {2748#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:25,245 INFO L290 TraceCheckUtils]: 37: Hoare triple {2748#(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); {2748#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:25,245 INFO L290 TraceCheckUtils]: 38: Hoare triple {2748#(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); {2748#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:25,246 INFO L290 TraceCheckUtils]: 39: Hoare triple {2748#(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); {2748#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:25,246 INFO L290 TraceCheckUtils]: 40: Hoare triple {2748#(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); {2748#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:25,246 INFO L290 TraceCheckUtils]: 41: Hoare triple {2748#(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); {2748#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:25,247 INFO L290 TraceCheckUtils]: 42: Hoare triple {2748#(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); {2748#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:25,247 INFO L290 TraceCheckUtils]: 43: Hoare triple {2748#(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); {2749#(not (= |ssl3_accept_#t~mem75| 8640))} is VALID [2022-04-27 15:27:25,247 INFO L290 TraceCheckUtils]: 44: Hoare triple {2749#(not (= |ssl3_accept_#t~mem75| 8640))} assume 8640 == #t~mem75;havoc #t~mem75; {2744#false} is VALID [2022-04-27 15:27:25,248 INFO L290 TraceCheckUtils]: 45: Hoare triple {2744#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {2744#false} is VALID [2022-04-27 15:27:25,248 INFO L290 TraceCheckUtils]: 46: Hoare triple {2744#false} assume 4 == ~blastFlag~0; {2744#false} is VALID [2022-04-27 15:27:25,248 INFO L290 TraceCheckUtils]: 47: Hoare triple {2744#false} assume !false; {2744#false} is VALID [2022-04-27 15:27:25,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:27:25,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:27:25,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758531177] [2022-04-27 15:27:25,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758531177] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:27:25,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:27:25,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:27:25,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360559326] [2022-04-27 15:27:25,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:27:25,249 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-27 15:27:25,249 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:27:25,250 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-27 15:27:25,293 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-27 15:27:25,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:27:25,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:27:25,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:27:25,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:27:25,296 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-27 15:27:32,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:32,880 INFO L93 Difference]: Finished difference Result 501 states and 796 transitions. [2022-04-27 15:27:32,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:27:32,881 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-27 15:27:32,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:27:32,881 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-27 15:27:32,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2022-04-27 15:27:32,885 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-27 15:27:32,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2022-04-27 15:27:32,890 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 593 transitions. [2022-04-27 15:27:33,359 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 593 edges. 593 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:27:33,370 INFO L225 Difference]: With dead ends: 501 [2022-04-27 15:27:33,370 INFO L226 Difference]: Without dead ends: 317 [2022-04-27 15:27:33,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:27:33,371 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 119 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-27 15:27:33,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 342 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-04-27 15:27:33,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2022-04-27 15:27:33,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 239. [2022-04-27 15:27:33,378 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:27:33,378 INFO L82 GeneralOperation]: Start isEquivalent. First operand 317 states. Second operand has 239 states, 234 states have (on average 1.641025641025641) internal successors, (384), 234 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:33,379 INFO L74 IsIncluded]: Start isIncluded. First operand 317 states. Second operand has 239 states, 234 states have (on average 1.641025641025641) internal successors, (384), 234 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:33,403 INFO L87 Difference]: Start difference. First operand 317 states. Second operand has 239 states, 234 states have (on average 1.641025641025641) internal successors, (384), 234 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:33,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:33,410 INFO L93 Difference]: Finished difference Result 317 states and 497 transitions. [2022-04-27 15:27:33,410 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 497 transitions. [2022-04-27 15:27:33,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:27:33,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:27:33,411 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 317 states. [2022-04-27 15:27:33,412 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 317 states. [2022-04-27 15:27:33,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:33,432 INFO L93 Difference]: Finished difference Result 317 states and 497 transitions. [2022-04-27 15:27:33,432 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 497 transitions. [2022-04-27 15:27:33,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:27:33,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:27:33,433 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:27:33,433 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:27:33,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 234 states have (on average 1.641025641025641) internal successors, (384), 234 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:33,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 388 transitions. [2022-04-27 15:27:33,438 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 388 transitions. Word has length 48 [2022-04-27 15:27:33,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:27:33,438 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 388 transitions. [2022-04-27 15:27:33,438 INFO L496 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-27 15:27:33,438 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 388 transitions. [2022-04-27 15:27:33,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-27 15:27:33,439 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:27:33,439 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:27:33,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 15:27:33,439 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:27:33,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:27:33,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1734094884, now seen corresponding path program 1 times [2022-04-27 15:27:33,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:27:33,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005317085] [2022-04-27 15:27:33,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:27:33,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:27:33,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:27:33,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:27:33,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:27:33,605 INFO L290 TraceCheckUtils]: 0: Hoare triple {4254#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {4247#true} is VALID [2022-04-27 15:27:33,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {4247#true} assume true; {4247#true} is VALID [2022-04-27 15:27:33,605 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4247#true} {4247#true} #689#return; {4247#true} is VALID [2022-04-27 15:27:33,605 INFO L272 TraceCheckUtils]: 0: Hoare triple {4247#true} call ULTIMATE.init(); {4254#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:27:33,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {4254#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {4247#true} is VALID [2022-04-27 15:27:33,606 INFO L290 TraceCheckUtils]: 2: Hoare triple {4247#true} assume true; {4247#true} is VALID [2022-04-27 15:27:33,606 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4247#true} {4247#true} #689#return; {4247#true} is VALID [2022-04-27 15:27:33,606 INFO L272 TraceCheckUtils]: 4: Hoare triple {4247#true} call #t~ret161 := main(); {4247#true} is VALID [2022-04-27 15:27:33,606 INFO L290 TraceCheckUtils]: 5: Hoare triple {4247#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; {4247#true} is VALID [2022-04-27 15:27:33,606 INFO L290 TraceCheckUtils]: 6: Hoare triple {4247#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {4247#true} is VALID [2022-04-27 15:27:33,606 INFO L272 TraceCheckUtils]: 7: Hoare triple {4247#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {4247#true} is VALID [2022-04-27 15:27:33,608 INFO L290 TraceCheckUtils]: 8: Hoare triple {4247#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); {4252#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:33,608 INFO L290 TraceCheckUtils]: 9: Hoare triple {4252#(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; {4252#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:33,609 INFO L290 TraceCheckUtils]: 10: Hoare triple {4252#(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; {4252#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:33,609 INFO L290 TraceCheckUtils]: 11: Hoare triple {4252#(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)))); {4252#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:33,610 INFO L290 TraceCheckUtils]: 12: Hoare triple {4252#(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); {4252#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:33,610 INFO L290 TraceCheckUtils]: 13: Hoare triple {4252#(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; {4252#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:33,610 INFO L290 TraceCheckUtils]: 14: Hoare triple {4252#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {4252#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:33,611 INFO L290 TraceCheckUtils]: 15: Hoare triple {4252#(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); {4252#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:33,611 INFO L290 TraceCheckUtils]: 16: Hoare triple {4252#(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); {4252#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:33,611 INFO L290 TraceCheckUtils]: 17: Hoare triple {4252#(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); {4252#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:33,612 INFO L290 TraceCheckUtils]: 18: Hoare triple {4252#(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); {4252#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:33,612 INFO L290 TraceCheckUtils]: 19: Hoare triple {4252#(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); {4252#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:33,613 INFO L290 TraceCheckUtils]: 20: Hoare triple {4252#(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); {4252#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:33,613 INFO L290 TraceCheckUtils]: 21: Hoare triple {4252#(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); {4252#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:33,613 INFO L290 TraceCheckUtils]: 22: Hoare triple {4252#(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); {4252#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:33,614 INFO L290 TraceCheckUtils]: 23: Hoare triple {4252#(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); {4252#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:33,614 INFO L290 TraceCheckUtils]: 24: Hoare triple {4252#(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); {4252#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:33,614 INFO L290 TraceCheckUtils]: 25: Hoare triple {4252#(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); {4252#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:33,615 INFO L290 TraceCheckUtils]: 26: Hoare triple {4252#(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); {4252#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:33,615 INFO L290 TraceCheckUtils]: 27: Hoare triple {4252#(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); {4252#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:33,616 INFO L290 TraceCheckUtils]: 28: Hoare triple {4252#(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); {4252#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:33,616 INFO L290 TraceCheckUtils]: 29: Hoare triple {4252#(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); {4252#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:33,616 INFO L290 TraceCheckUtils]: 30: Hoare triple {4252#(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); {4252#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:33,617 INFO L290 TraceCheckUtils]: 31: Hoare triple {4252#(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); {4252#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:33,617 INFO L290 TraceCheckUtils]: 32: Hoare triple {4252#(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); {4252#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:33,617 INFO L290 TraceCheckUtils]: 33: Hoare triple {4252#(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); {4252#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:33,618 INFO L290 TraceCheckUtils]: 34: Hoare triple {4252#(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); {4252#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:33,618 INFO L290 TraceCheckUtils]: 35: Hoare triple {4252#(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); {4252#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:33,618 INFO L290 TraceCheckUtils]: 36: Hoare triple {4252#(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); {4252#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:33,619 INFO L290 TraceCheckUtils]: 37: Hoare triple {4252#(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); {4252#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:33,620 INFO L290 TraceCheckUtils]: 38: Hoare triple {4252#(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); {4252#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:33,620 INFO L290 TraceCheckUtils]: 39: Hoare triple {4252#(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); {4252#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:33,621 INFO L290 TraceCheckUtils]: 40: Hoare triple {4252#(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); {4252#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:33,621 INFO L290 TraceCheckUtils]: 41: Hoare triple {4252#(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); {4252#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:33,621 INFO L290 TraceCheckUtils]: 42: Hoare triple {4252#(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); {4252#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:33,622 INFO L290 TraceCheckUtils]: 43: Hoare triple {4252#(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); {4252#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:33,622 INFO L290 TraceCheckUtils]: 44: Hoare triple {4252#(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); {4253#(not (= |ssl3_accept_#t~mem76| 8641))} is VALID [2022-04-27 15:27:33,622 INFO L290 TraceCheckUtils]: 45: Hoare triple {4253#(not (= |ssl3_accept_#t~mem76| 8641))} assume 8641 == #t~mem76;havoc #t~mem76; {4248#false} is VALID [2022-04-27 15:27:33,623 INFO L290 TraceCheckUtils]: 46: Hoare triple {4248#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {4248#false} is VALID [2022-04-27 15:27:33,623 INFO L290 TraceCheckUtils]: 47: Hoare triple {4248#false} assume 4 == ~blastFlag~0; {4248#false} is VALID [2022-04-27 15:27:33,623 INFO L290 TraceCheckUtils]: 48: Hoare triple {4248#false} assume !false; {4248#false} is VALID [2022-04-27 15:27:33,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:27:33,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:27:33,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005317085] [2022-04-27 15:27:33,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005317085] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:27:33,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:27:33,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:27:33,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536258981] [2022-04-27 15:27:33,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:27:33,627 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-27 15:27:33,628 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:27:33,629 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:33,675 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:27:33,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:27:33,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:27:33,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:27:33,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:27:33,676 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-27 15:27:39,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:39,404 INFO L93 Difference]: Finished difference Result 551 states and 886 transitions. [2022-04-27 15:27:39,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:27:39,404 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-27 15:27:39,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:27:39,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:39,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 592 transitions. [2022-04-27 15:27:39,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:39,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 592 transitions. [2022-04-27 15:27:39,409 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 592 transitions. [2022-04-27 15:27:39,860 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 592 edges. 592 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:27:39,864 INFO L225 Difference]: With dead ends: 551 [2022-04-27 15:27:39,865 INFO L226 Difference]: Without dead ends: 327 [2022-04-27 15:27:39,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:27:39,866 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 118 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 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, 2.2s IncrementalHoareTripleChecker+Time [2022-04-27 15:27:39,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 356 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-27 15:27:39,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2022-04-27 15:27:39,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 250. [2022-04-27 15:27:39,871 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:27:39,872 INFO L82 GeneralOperation]: Start isEquivalent. First operand 327 states. Second operand has 250 states, 245 states have (on average 1.653061224489796) internal successors, (405), 245 states have internal predecessors, (405), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:39,872 INFO L74 IsIncluded]: Start isIncluded. First operand 327 states. Second operand has 250 states, 245 states have (on average 1.653061224489796) internal successors, (405), 245 states have internal predecessors, (405), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:39,873 INFO L87 Difference]: Start difference. First operand 327 states. Second operand has 250 states, 245 states have (on average 1.653061224489796) internal successors, (405), 245 states have internal predecessors, (405), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:39,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:39,883 INFO L93 Difference]: Finished difference Result 327 states and 516 transitions. [2022-04-27 15:27:39,883 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 516 transitions. [2022-04-27 15:27:39,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:27:39,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:27:39,884 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 327 states. [2022-04-27 15:27:39,885 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 327 states. [2022-04-27 15:27:39,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:39,890 INFO L93 Difference]: Finished difference Result 327 states and 516 transitions. [2022-04-27 15:27:39,890 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 516 transitions. [2022-04-27 15:27:39,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:27:39,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:27:39,891 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:27:39,891 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:27:39,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.653061224489796) internal successors, (405), 245 states have internal predecessors, (405), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:39,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 409 transitions. [2022-04-27 15:27:39,895 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 409 transitions. Word has length 49 [2022-04-27 15:27:39,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:27:39,895 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 409 transitions. [2022-04-27 15:27:39,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:39,896 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 409 transitions. [2022-04-27 15:27:39,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-04-27 15:27:39,896 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:27:39,897 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:27:39,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 15:27:39,897 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:27:39,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:27:39,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1073389890, now seen corresponding path program 1 times [2022-04-27 15:27:39,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:27:39,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302739461] [2022-04-27 15:27:39,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:27:39,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:27:39,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:27:40,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:27:40,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:27:40,022 INFO L290 TraceCheckUtils]: 0: Hoare triple {5841#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {5834#true} is VALID [2022-04-27 15:27:40,023 INFO L290 TraceCheckUtils]: 1: Hoare triple {5834#true} assume true; {5834#true} is VALID [2022-04-27 15:27:40,023 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5834#true} {5834#true} #689#return; {5834#true} is VALID [2022-04-27 15:27:40,024 INFO L272 TraceCheckUtils]: 0: Hoare triple {5834#true} call ULTIMATE.init(); {5841#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:27:40,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {5841#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {5834#true} is VALID [2022-04-27 15:27:40,024 INFO L290 TraceCheckUtils]: 2: Hoare triple {5834#true} assume true; {5834#true} is VALID [2022-04-27 15:27:40,024 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5834#true} {5834#true} #689#return; {5834#true} is VALID [2022-04-27 15:27:40,027 INFO L272 TraceCheckUtils]: 4: Hoare triple {5834#true} call #t~ret161 := main(); {5834#true} is VALID [2022-04-27 15:27:40,027 INFO L290 TraceCheckUtils]: 5: Hoare triple {5834#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; {5834#true} is VALID [2022-04-27 15:27:40,027 INFO L290 TraceCheckUtils]: 6: Hoare triple {5834#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {5834#true} is VALID [2022-04-27 15:27:40,027 INFO L272 TraceCheckUtils]: 7: Hoare triple {5834#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {5834#true} is VALID [2022-04-27 15:27:40,029 INFO L290 TraceCheckUtils]: 8: Hoare triple {5834#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); {5839#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:40,029 INFO L290 TraceCheckUtils]: 9: Hoare triple {5839#(= 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; {5839#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:40,030 INFO L290 TraceCheckUtils]: 10: Hoare triple {5839#(= 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; {5839#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:40,030 INFO L290 TraceCheckUtils]: 11: Hoare triple {5839#(= 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)))); {5839#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:40,031 INFO L290 TraceCheckUtils]: 12: Hoare triple {5839#(= 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); {5839#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:40,031 INFO L290 TraceCheckUtils]: 13: Hoare triple {5839#(= 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; {5839#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:40,031 INFO L290 TraceCheckUtils]: 14: Hoare triple {5839#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {5839#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:40,032 INFO L290 TraceCheckUtils]: 15: Hoare triple {5839#(= 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); {5839#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:40,032 INFO L290 TraceCheckUtils]: 16: Hoare triple {5839#(= 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); {5839#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:40,032 INFO L290 TraceCheckUtils]: 17: Hoare triple {5839#(= 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); {5839#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:40,033 INFO L290 TraceCheckUtils]: 18: Hoare triple {5839#(= 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); {5839#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:40,033 INFO L290 TraceCheckUtils]: 19: Hoare triple {5839#(= 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); {5839#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:40,034 INFO L290 TraceCheckUtils]: 20: Hoare triple {5839#(= 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); {5839#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:40,034 INFO L290 TraceCheckUtils]: 21: Hoare triple {5839#(= 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); {5839#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:40,034 INFO L290 TraceCheckUtils]: 22: Hoare triple {5839#(= 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); {5839#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:40,035 INFO L290 TraceCheckUtils]: 23: Hoare triple {5839#(= 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); {5840#(= 8464 |ssl3_accept_#t~mem55|)} is VALID [2022-04-27 15:27:40,035 INFO L290 TraceCheckUtils]: 24: Hoare triple {5840#(= 8464 |ssl3_accept_#t~mem55|)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {5835#false} is VALID [2022-04-27 15:27:40,035 INFO L290 TraceCheckUtils]: 25: Hoare triple {5835#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {5835#false} is VALID [2022-04-27 15:27:40,035 INFO L290 TraceCheckUtils]: 26: Hoare triple {5835#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {5835#false} is VALID [2022-04-27 15:27:40,035 INFO L290 TraceCheckUtils]: 27: Hoare triple {5835#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {5835#false} is VALID [2022-04-27 15:27:40,035 INFO L290 TraceCheckUtils]: 28: Hoare triple {5835#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {5835#false} is VALID [2022-04-27 15:27:40,035 INFO L290 TraceCheckUtils]: 29: Hoare triple {5835#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {5835#false} is VALID [2022-04-27 15:27:40,035 INFO L290 TraceCheckUtils]: 30: Hoare triple {5835#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {5835#false} is VALID [2022-04-27 15:27:40,036 INFO L290 TraceCheckUtils]: 31: Hoare triple {5835#false} assume 8528 == #t~mem62;havoc #t~mem62; {5835#false} is VALID [2022-04-27 15:27:40,036 INFO L290 TraceCheckUtils]: 32: Hoare triple {5835#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); {5835#false} is VALID [2022-04-27 15:27:40,036 INFO L290 TraceCheckUtils]: 33: Hoare triple {5835#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; {5835#false} is VALID [2022-04-27 15:27:40,036 INFO L290 TraceCheckUtils]: 34: Hoare triple {5835#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); {5835#false} is VALID [2022-04-27 15:27:40,036 INFO L290 TraceCheckUtils]: 35: Hoare triple {5835#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {5835#false} is VALID [2022-04-27 15:27:40,036 INFO L290 TraceCheckUtils]: 36: Hoare triple {5835#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {5835#false} is VALID [2022-04-27 15:27:40,037 INFO L290 TraceCheckUtils]: 37: Hoare triple {5835#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {5835#false} is VALID [2022-04-27 15:27:40,037 INFO L290 TraceCheckUtils]: 38: Hoare triple {5835#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {5835#false} is VALID [2022-04-27 15:27:40,037 INFO L290 TraceCheckUtils]: 39: Hoare triple {5835#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); {5835#false} is VALID [2022-04-27 15:27:40,037 INFO L290 TraceCheckUtils]: 40: Hoare triple {5835#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {5835#false} is VALID [2022-04-27 15:27:40,037 INFO L290 TraceCheckUtils]: 41: Hoare triple {5835#false} ~skip~0 := 0; {5835#false} is VALID [2022-04-27 15:27:40,037 INFO L290 TraceCheckUtils]: 42: Hoare triple {5835#false} assume !false; {5835#false} is VALID [2022-04-27 15:27:40,042 INFO L290 TraceCheckUtils]: 43: Hoare triple {5835#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); {5835#false} is VALID [2022-04-27 15:27:40,042 INFO L290 TraceCheckUtils]: 44: Hoare triple {5835#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {5835#false} is VALID [2022-04-27 15:27:40,043 INFO L290 TraceCheckUtils]: 45: Hoare triple {5835#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {5835#false} is VALID [2022-04-27 15:27:40,045 INFO L290 TraceCheckUtils]: 46: Hoare triple {5835#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {5835#false} is VALID [2022-04-27 15:27:40,045 INFO L290 TraceCheckUtils]: 47: Hoare triple {5835#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {5835#false} is VALID [2022-04-27 15:27:40,045 INFO L290 TraceCheckUtils]: 48: Hoare triple {5835#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {5835#false} is VALID [2022-04-27 15:27:40,046 INFO L290 TraceCheckUtils]: 49: Hoare triple {5835#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {5835#false} is VALID [2022-04-27 15:27:40,046 INFO L290 TraceCheckUtils]: 50: Hoare triple {5835#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {5835#false} is VALID [2022-04-27 15:27:40,046 INFO L290 TraceCheckUtils]: 51: Hoare triple {5835#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {5835#false} is VALID [2022-04-27 15:27:40,046 INFO L290 TraceCheckUtils]: 52: Hoare triple {5835#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {5835#false} is VALID [2022-04-27 15:27:40,046 INFO L290 TraceCheckUtils]: 53: Hoare triple {5835#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {5835#false} is VALID [2022-04-27 15:27:40,046 INFO L290 TraceCheckUtils]: 54: Hoare triple {5835#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {5835#false} is VALID [2022-04-27 15:27:40,046 INFO L290 TraceCheckUtils]: 55: Hoare triple {5835#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {5835#false} is VALID [2022-04-27 15:27:40,046 INFO L290 TraceCheckUtils]: 56: Hoare triple {5835#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {5835#false} is VALID [2022-04-27 15:27:40,046 INFO L290 TraceCheckUtils]: 57: Hoare triple {5835#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {5835#false} is VALID [2022-04-27 15:27:40,046 INFO L290 TraceCheckUtils]: 58: Hoare triple {5835#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {5835#false} is VALID [2022-04-27 15:27:40,046 INFO L290 TraceCheckUtils]: 59: Hoare triple {5835#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {5835#false} is VALID [2022-04-27 15:27:40,046 INFO L290 TraceCheckUtils]: 60: Hoare triple {5835#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {5835#false} is VALID [2022-04-27 15:27:40,046 INFO L290 TraceCheckUtils]: 61: Hoare triple {5835#false} assume 8544 == #t~mem64;havoc #t~mem64; {5835#false} is VALID [2022-04-27 15:27:40,047 INFO L290 TraceCheckUtils]: 62: Hoare triple {5835#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {5835#false} is VALID [2022-04-27 15:27:40,047 INFO L290 TraceCheckUtils]: 63: Hoare triple {5835#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); {5835#false} is VALID [2022-04-27 15:27:40,047 INFO L290 TraceCheckUtils]: 64: Hoare triple {5835#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {5835#false} is VALID [2022-04-27 15:27:40,047 INFO L290 TraceCheckUtils]: 65: Hoare triple {5835#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); {5835#false} is VALID [2022-04-27 15:27:40,047 INFO L290 TraceCheckUtils]: 66: Hoare triple {5835#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; {5835#false} is VALID [2022-04-27 15:27:40,047 INFO L290 TraceCheckUtils]: 67: Hoare triple {5835#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; {5835#false} is VALID [2022-04-27 15:27:40,047 INFO L290 TraceCheckUtils]: 68: Hoare triple {5835#false} assume 8 == ~blastFlag~0; {5835#false} is VALID [2022-04-27 15:27:40,047 INFO L290 TraceCheckUtils]: 69: Hoare triple {5835#false} assume !false; {5835#false} is VALID [2022-04-27 15:27:40,048 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-27 15:27:40,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:27:40,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302739461] [2022-04-27 15:27:40,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302739461] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:27:40,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:27:40,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:27:40,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522184741] [2022-04-27 15:27:40,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:27:40,048 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2022-04-27 15:27:40,049 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:27:40,049 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:40,091 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:27:40,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:27:40,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:27:40,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:27:40,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:27:40,092 INFO L87 Difference]: Start difference. First operand 250 states and 409 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:44,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:44,814 INFO L93 Difference]: Finished difference Result 513 states and 840 transitions. [2022-04-27 15:27:44,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:27:44,814 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2022-04-27 15:27:44,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:27:44,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:44,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 452 transitions. [2022-04-27 15:27:44,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:44,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 452 transitions. [2022-04-27 15:27:44,818 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 452 transitions. [2022-04-27 15:27:45,108 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 452 edges. 452 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:27:45,111 INFO L225 Difference]: With dead ends: 513 [2022-04-27 15:27:45,111 INFO L226 Difference]: Without dead ends: 278 [2022-04-27 15:27:45,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:27:45,112 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 22 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s 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.9s IncrementalHoareTripleChecker+Time [2022-04-27 15:27:45,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 481 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-27 15:27:45,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-04-27 15:27:45,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 261. [2022-04-27 15:27:45,119 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:27:45,120 INFO L82 GeneralOperation]: Start isEquivalent. First operand 278 states. Second operand has 261 states, 256 states have (on average 1.65625) internal successors, (424), 256 states have internal predecessors, (424), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:45,120 INFO L74 IsIncluded]: Start isIncluded. First operand 278 states. Second operand has 261 states, 256 states have (on average 1.65625) internal successors, (424), 256 states have internal predecessors, (424), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:45,120 INFO L87 Difference]: Start difference. First operand 278 states. Second operand has 261 states, 256 states have (on average 1.65625) internal successors, (424), 256 states have internal predecessors, (424), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:45,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:45,140 INFO L93 Difference]: Finished difference Result 278 states and 449 transitions. [2022-04-27 15:27:45,140 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 449 transitions. [2022-04-27 15:27:45,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:27:45,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:27:45,141 INFO L74 IsIncluded]: Start isIncluded. First operand has 261 states, 256 states have (on average 1.65625) internal successors, (424), 256 states have internal predecessors, (424), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 278 states. [2022-04-27 15:27:45,142 INFO L87 Difference]: Start difference. First operand has 261 states, 256 states have (on average 1.65625) internal successors, (424), 256 states have internal predecessors, (424), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 278 states. [2022-04-27 15:27:45,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:45,146 INFO L93 Difference]: Finished difference Result 278 states and 449 transitions. [2022-04-27 15:27:45,146 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 449 transitions. [2022-04-27 15:27:45,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:27:45,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:27:45,147 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:27:45,147 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:27:45,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 256 states have (on average 1.65625) internal successors, (424), 256 states have internal predecessors, (424), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:45,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 428 transitions. [2022-04-27 15:27:45,166 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 428 transitions. Word has length 70 [2022-04-27 15:27:45,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:27:45,167 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 428 transitions. [2022-04-27 15:27:45,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:45,167 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 428 transitions. [2022-04-27 15:27:45,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-27 15:27:45,168 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:27:45,168 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:27:45,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-27 15:27:45,169 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:27:45,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:27:45,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1770564040, now seen corresponding path program 1 times [2022-04-27 15:27:45,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:27:45,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718029551] [2022-04-27 15:27:45,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:27:45,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:27:45,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:27:45,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:27:45,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:27:45,311 INFO L290 TraceCheckUtils]: 0: Hoare triple {7289#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {7282#true} is VALID [2022-04-27 15:27:45,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {7282#true} assume true; {7282#true} is VALID [2022-04-27 15:27:45,311 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7282#true} {7282#true} #689#return; {7282#true} is VALID [2022-04-27 15:27:45,312 INFO L272 TraceCheckUtils]: 0: Hoare triple {7282#true} call ULTIMATE.init(); {7289#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:27:45,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {7289#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {7282#true} is VALID [2022-04-27 15:27:45,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {7282#true} assume true; {7282#true} is VALID [2022-04-27 15:27:45,312 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7282#true} {7282#true} #689#return; {7282#true} is VALID [2022-04-27 15:27:45,312 INFO L272 TraceCheckUtils]: 4: Hoare triple {7282#true} call #t~ret161 := main(); {7282#true} is VALID [2022-04-27 15:27:45,312 INFO L290 TraceCheckUtils]: 5: Hoare triple {7282#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; {7282#true} is VALID [2022-04-27 15:27:45,312 INFO L290 TraceCheckUtils]: 6: Hoare triple {7282#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {7282#true} is VALID [2022-04-27 15:27:45,313 INFO L272 TraceCheckUtils]: 7: Hoare triple {7282#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {7282#true} is VALID [2022-04-27 15:27:45,315 INFO L290 TraceCheckUtils]: 8: Hoare triple {7282#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); {7287#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:45,315 INFO L290 TraceCheckUtils]: 9: Hoare triple {7287#(= 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; {7287#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:45,316 INFO L290 TraceCheckUtils]: 10: Hoare triple {7287#(= 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; {7287#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:45,316 INFO L290 TraceCheckUtils]: 11: Hoare triple {7287#(= 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)))); {7287#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:45,317 INFO L290 TraceCheckUtils]: 12: Hoare triple {7287#(= 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); {7287#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:45,317 INFO L290 TraceCheckUtils]: 13: Hoare triple {7287#(= 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; {7287#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:45,318 INFO L290 TraceCheckUtils]: 14: Hoare triple {7287#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {7287#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:45,318 INFO L290 TraceCheckUtils]: 15: Hoare triple {7287#(= 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); {7287#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:45,318 INFO L290 TraceCheckUtils]: 16: Hoare triple {7287#(= 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); {7287#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:45,319 INFO L290 TraceCheckUtils]: 17: Hoare triple {7287#(= 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); {7287#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:45,319 INFO L290 TraceCheckUtils]: 18: Hoare triple {7287#(= 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); {7287#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:45,319 INFO L290 TraceCheckUtils]: 19: Hoare triple {7287#(= 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); {7287#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:45,320 INFO L290 TraceCheckUtils]: 20: Hoare triple {7287#(= 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); {7288#(= 8464 |ssl3_accept_#t~mem52|)} is VALID [2022-04-27 15:27:45,320 INFO L290 TraceCheckUtils]: 21: Hoare triple {7288#(= 8464 |ssl3_accept_#t~mem52|)} assume 8480 == #t~mem52;havoc #t~mem52; {7283#false} is VALID [2022-04-27 15:27:45,320 INFO L290 TraceCheckUtils]: 22: Hoare triple {7283#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; {7283#false} is VALID [2022-04-27 15:27:45,320 INFO L290 TraceCheckUtils]: 23: Hoare triple {7283#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); {7283#false} is VALID [2022-04-27 15:27:45,320 INFO L290 TraceCheckUtils]: 24: Hoare triple {7283#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); {7283#false} is VALID [2022-04-27 15:27:45,320 INFO L290 TraceCheckUtils]: 25: Hoare triple {7283#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {7283#false} is VALID [2022-04-27 15:27:45,320 INFO L290 TraceCheckUtils]: 26: Hoare triple {7283#false} ~skip~0 := 0; {7283#false} is VALID [2022-04-27 15:27:45,320 INFO L290 TraceCheckUtils]: 27: Hoare triple {7283#false} assume !false; {7283#false} is VALID [2022-04-27 15:27:45,321 INFO L290 TraceCheckUtils]: 28: Hoare triple {7283#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); {7283#false} is VALID [2022-04-27 15:27:45,321 INFO L290 TraceCheckUtils]: 29: Hoare triple {7283#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {7283#false} is VALID [2022-04-27 15:27:45,321 INFO L290 TraceCheckUtils]: 30: Hoare triple {7283#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {7283#false} is VALID [2022-04-27 15:27:45,321 INFO L290 TraceCheckUtils]: 31: Hoare triple {7283#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7283#false} is VALID [2022-04-27 15:27:45,321 INFO L290 TraceCheckUtils]: 32: Hoare triple {7283#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {7283#false} is VALID [2022-04-27 15:27:45,321 INFO L290 TraceCheckUtils]: 33: Hoare triple {7283#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {7283#false} is VALID [2022-04-27 15:27:45,321 INFO L290 TraceCheckUtils]: 34: Hoare triple {7283#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {7283#false} is VALID [2022-04-27 15:27:45,321 INFO L290 TraceCheckUtils]: 35: Hoare triple {7283#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {7283#false} is VALID [2022-04-27 15:27:45,321 INFO L290 TraceCheckUtils]: 36: Hoare triple {7283#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {7283#false} is VALID [2022-04-27 15:27:45,321 INFO L290 TraceCheckUtils]: 37: Hoare triple {7283#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {7283#false} is VALID [2022-04-27 15:27:45,321 INFO L290 TraceCheckUtils]: 38: Hoare triple {7283#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {7283#false} is VALID [2022-04-27 15:27:45,321 INFO L290 TraceCheckUtils]: 39: Hoare triple {7283#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {7283#false} is VALID [2022-04-27 15:27:45,321 INFO L290 TraceCheckUtils]: 40: Hoare triple {7283#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {7283#false} is VALID [2022-04-27 15:27:45,322 INFO L290 TraceCheckUtils]: 41: Hoare triple {7283#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {7283#false} is VALID [2022-04-27 15:27:45,322 INFO L290 TraceCheckUtils]: 42: Hoare triple {7283#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {7283#false} is VALID [2022-04-27 15:27:45,322 INFO L290 TraceCheckUtils]: 43: Hoare triple {7283#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {7283#false} is VALID [2022-04-27 15:27:45,322 INFO L290 TraceCheckUtils]: 44: Hoare triple {7283#false} assume 8528 == #t~mem62;havoc #t~mem62; {7283#false} is VALID [2022-04-27 15:27:45,323 INFO L290 TraceCheckUtils]: 45: Hoare triple {7283#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); {7283#false} is VALID [2022-04-27 15:27:45,323 INFO L290 TraceCheckUtils]: 46: Hoare triple {7283#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; {7283#false} is VALID [2022-04-27 15:27:45,323 INFO L290 TraceCheckUtils]: 47: Hoare triple {7283#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); {7283#false} is VALID [2022-04-27 15:27:45,323 INFO L290 TraceCheckUtils]: 48: Hoare triple {7283#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {7283#false} is VALID [2022-04-27 15:27:45,323 INFO L290 TraceCheckUtils]: 49: Hoare triple {7283#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {7283#false} is VALID [2022-04-27 15:27:45,323 INFO L290 TraceCheckUtils]: 50: Hoare triple {7283#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {7283#false} is VALID [2022-04-27 15:27:45,323 INFO L290 TraceCheckUtils]: 51: Hoare triple {7283#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {7283#false} is VALID [2022-04-27 15:27:45,323 INFO L290 TraceCheckUtils]: 52: Hoare triple {7283#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); {7283#false} is VALID [2022-04-27 15:27:45,323 INFO L290 TraceCheckUtils]: 53: Hoare triple {7283#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {7283#false} is VALID [2022-04-27 15:27:45,323 INFO L290 TraceCheckUtils]: 54: Hoare triple {7283#false} ~skip~0 := 0; {7283#false} is VALID [2022-04-27 15:27:45,323 INFO L290 TraceCheckUtils]: 55: Hoare triple {7283#false} assume !false; {7283#false} is VALID [2022-04-27 15:27:45,323 INFO L290 TraceCheckUtils]: 56: Hoare triple {7283#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); {7283#false} is VALID [2022-04-27 15:27:45,323 INFO L290 TraceCheckUtils]: 57: Hoare triple {7283#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {7283#false} is VALID [2022-04-27 15:27:45,323 INFO L290 TraceCheckUtils]: 58: Hoare triple {7283#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {7283#false} is VALID [2022-04-27 15:27:45,324 INFO L290 TraceCheckUtils]: 59: Hoare triple {7283#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7283#false} is VALID [2022-04-27 15:27:45,324 INFO L290 TraceCheckUtils]: 60: Hoare triple {7283#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {7283#false} is VALID [2022-04-27 15:27:45,324 INFO L290 TraceCheckUtils]: 61: Hoare triple {7283#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {7283#false} is VALID [2022-04-27 15:27:45,324 INFO L290 TraceCheckUtils]: 62: Hoare triple {7283#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {7283#false} is VALID [2022-04-27 15:27:45,324 INFO L290 TraceCheckUtils]: 63: Hoare triple {7283#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {7283#false} is VALID [2022-04-27 15:27:45,324 INFO L290 TraceCheckUtils]: 64: Hoare triple {7283#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {7283#false} is VALID [2022-04-27 15:27:45,324 INFO L290 TraceCheckUtils]: 65: Hoare triple {7283#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {7283#false} is VALID [2022-04-27 15:27:45,325 INFO L290 TraceCheckUtils]: 66: Hoare triple {7283#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {7283#false} is VALID [2022-04-27 15:27:45,325 INFO L290 TraceCheckUtils]: 67: Hoare triple {7283#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {7283#false} is VALID [2022-04-27 15:27:45,325 INFO L290 TraceCheckUtils]: 68: Hoare triple {7283#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {7283#false} is VALID [2022-04-27 15:27:45,325 INFO L290 TraceCheckUtils]: 69: Hoare triple {7283#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {7283#false} is VALID [2022-04-27 15:27:45,325 INFO L290 TraceCheckUtils]: 70: Hoare triple {7283#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {7283#false} is VALID [2022-04-27 15:27:45,326 INFO L290 TraceCheckUtils]: 71: Hoare triple {7283#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {7283#false} is VALID [2022-04-27 15:27:45,326 INFO L290 TraceCheckUtils]: 72: Hoare triple {7283#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {7283#false} is VALID [2022-04-27 15:27:45,326 INFO L290 TraceCheckUtils]: 73: Hoare triple {7283#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {7283#false} is VALID [2022-04-27 15:27:45,326 INFO L290 TraceCheckUtils]: 74: Hoare triple {7283#false} assume 8544 == #t~mem64;havoc #t~mem64; {7283#false} is VALID [2022-04-27 15:27:45,326 INFO L290 TraceCheckUtils]: 75: Hoare triple {7283#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {7283#false} is VALID [2022-04-27 15:27:45,326 INFO L290 TraceCheckUtils]: 76: Hoare triple {7283#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); {7283#false} is VALID [2022-04-27 15:27:45,326 INFO L290 TraceCheckUtils]: 77: Hoare triple {7283#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {7283#false} is VALID [2022-04-27 15:27:45,326 INFO L290 TraceCheckUtils]: 78: Hoare triple {7283#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); {7283#false} is VALID [2022-04-27 15:27:45,326 INFO L290 TraceCheckUtils]: 79: Hoare triple {7283#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; {7283#false} is VALID [2022-04-27 15:27:45,326 INFO L290 TraceCheckUtils]: 80: Hoare triple {7283#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; {7283#false} is VALID [2022-04-27 15:27:45,326 INFO L290 TraceCheckUtils]: 81: Hoare triple {7283#false} assume 8 == ~blastFlag~0; {7283#false} is VALID [2022-04-27 15:27:45,326 INFO L290 TraceCheckUtils]: 82: Hoare triple {7283#false} assume !false; {7283#false} is VALID [2022-04-27 15:27:45,327 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-27 15:27:45,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:27:45,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718029551] [2022-04-27 15:27:45,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718029551] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:27:45,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:27:45,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:27:45,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750884702] [2022-04-27 15:27:45,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:27:45,328 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 83 [2022-04-27 15:27:45,328 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:27:45,329 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:45,375 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:27:45,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:27:45,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:27:45,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:27:45,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:27:45,376 INFO L87 Difference]: Start difference. First operand 261 states and 428 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:52,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:52,236 INFO L93 Difference]: Finished difference Result 513 states and 839 transitions. [2022-04-27 15:27:52,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:27:52,236 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 83 [2022-04-27 15:27:52,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:27:52,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:52,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 451 transitions. [2022-04-27 15:27:52,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:52,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 451 transitions. [2022-04-27 15:27:52,240 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 451 transitions. [2022-04-27 15:27:52,521 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 451 edges. 451 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:27:52,525 INFO L225 Difference]: With dead ends: 513 [2022-04-27 15:27:52,525 INFO L226 Difference]: Without dead ends: 278 [2022-04-27 15:27:52,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:27:52,526 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 24 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-27 15:27:52,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 483 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-27 15:27:52,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-04-27 15:27:52,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 261. [2022-04-27 15:27:52,530 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:27:52,531 INFO L82 GeneralOperation]: Start isEquivalent. First operand 278 states. Second operand has 261 states, 256 states have (on average 1.65234375) internal successors, (423), 256 states have internal predecessors, (423), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:52,531 INFO L74 IsIncluded]: Start isIncluded. First operand 278 states. Second operand has 261 states, 256 states have (on average 1.65234375) internal successors, (423), 256 states have internal predecessors, (423), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:52,532 INFO L87 Difference]: Start difference. First operand 278 states. Second operand has 261 states, 256 states have (on average 1.65234375) internal successors, (423), 256 states have internal predecessors, (423), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:52,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:52,536 INFO L93 Difference]: Finished difference Result 278 states and 448 transitions. [2022-04-27 15:27:52,536 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 448 transitions. [2022-04-27 15:27:52,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:27:52,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:27:52,537 INFO L74 IsIncluded]: Start isIncluded. First operand has 261 states, 256 states have (on average 1.65234375) internal successors, (423), 256 states have internal predecessors, (423), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 278 states. [2022-04-27 15:27:52,537 INFO L87 Difference]: Start difference. First operand has 261 states, 256 states have (on average 1.65234375) internal successors, (423), 256 states have internal predecessors, (423), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 278 states. [2022-04-27 15:27:52,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:52,541 INFO L93 Difference]: Finished difference Result 278 states and 448 transitions. [2022-04-27 15:27:52,541 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 448 transitions. [2022-04-27 15:27:52,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:27:52,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:27:52,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:27:52,542 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:27:52,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 256 states have (on average 1.65234375) internal successors, (423), 256 states have internal predecessors, (423), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:52,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 427 transitions. [2022-04-27 15:27:52,546 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 427 transitions. Word has length 83 [2022-04-27 15:27:52,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:27:52,546 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 427 transitions. [2022-04-27 15:27:52,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:52,546 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 427 transitions. [2022-04-27 15:27:52,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-27 15:27:52,547 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:27:52,547 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:27:52,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-27 15:27:52,547 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:27:52,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:27:52,547 INFO L85 PathProgramCache]: Analyzing trace with hash 22704056, now seen corresponding path program 1 times [2022-04-27 15:27:52,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:27:52,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914994719] [2022-04-27 15:27:52,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:27:52,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:27:52,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:27:52,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:27:52,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:27:52,658 INFO L290 TraceCheckUtils]: 0: Hoare triple {8737#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {8730#true} is VALID [2022-04-27 15:27:52,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {8730#true} assume true; {8730#true} is VALID [2022-04-27 15:27:52,658 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8730#true} {8730#true} #689#return; {8730#true} is VALID [2022-04-27 15:27:52,659 INFO L272 TraceCheckUtils]: 0: Hoare triple {8730#true} call ULTIMATE.init(); {8737#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:27:52,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {8737#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {8730#true} is VALID [2022-04-27 15:27:52,659 INFO L290 TraceCheckUtils]: 2: Hoare triple {8730#true} assume true; {8730#true} is VALID [2022-04-27 15:27:52,659 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8730#true} {8730#true} #689#return; {8730#true} is VALID [2022-04-27 15:27:52,659 INFO L272 TraceCheckUtils]: 4: Hoare triple {8730#true} call #t~ret161 := main(); {8730#true} is VALID [2022-04-27 15:27:52,659 INFO L290 TraceCheckUtils]: 5: Hoare triple {8730#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; {8730#true} is VALID [2022-04-27 15:27:52,659 INFO L290 TraceCheckUtils]: 6: Hoare triple {8730#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {8730#true} is VALID [2022-04-27 15:27:52,659 INFO L272 TraceCheckUtils]: 7: Hoare triple {8730#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {8730#true} is VALID [2022-04-27 15:27:52,661 INFO L290 TraceCheckUtils]: 8: Hoare triple {8730#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); {8735#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:52,661 INFO L290 TraceCheckUtils]: 9: Hoare triple {8735#(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; {8735#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:52,662 INFO L290 TraceCheckUtils]: 10: Hoare triple {8735#(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; {8735#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:52,663 INFO L290 TraceCheckUtils]: 11: Hoare triple {8735#(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)))); {8735#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:52,664 INFO L290 TraceCheckUtils]: 12: Hoare triple {8735#(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); {8735#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:52,665 INFO L290 TraceCheckUtils]: 13: Hoare triple {8735#(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; {8735#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:52,666 INFO L290 TraceCheckUtils]: 14: Hoare triple {8735#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {8735#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:52,667 INFO L290 TraceCheckUtils]: 15: Hoare triple {8735#(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); {8736#(not (= 12292 |ssl3_accept_#t~mem47|))} is VALID [2022-04-27 15:27:52,668 INFO L290 TraceCheckUtils]: 16: Hoare triple {8736#(not (= 12292 |ssl3_accept_#t~mem47|))} assume 12292 == #t~mem47;havoc #t~mem47; {8731#false} is VALID [2022-04-27 15:27:52,668 INFO L290 TraceCheckUtils]: 17: Hoare triple {8731#false} call write~int(1, ~s.base, 40 + ~s.offset, 4); {8731#false} is VALID [2022-04-27 15:27:52,668 INFO L290 TraceCheckUtils]: 18: Hoare triple {8731#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {8731#false} is VALID [2022-04-27 15:27:52,668 INFO L290 TraceCheckUtils]: 19: Hoare triple {8731#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {8731#false} is VALID [2022-04-27 15:27:52,668 INFO L290 TraceCheckUtils]: 20: Hoare triple {8731#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {8731#false} is VALID [2022-04-27 15:27:52,668 INFO L290 TraceCheckUtils]: 21: Hoare triple {8731#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); {8731#false} is VALID [2022-04-27 15:27:52,668 INFO L290 TraceCheckUtils]: 22: Hoare triple {8731#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {8731#false} is VALID [2022-04-27 15:27:52,669 INFO L290 TraceCheckUtils]: 23: Hoare triple {8731#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); {8731#false} is VALID [2022-04-27 15:27:52,669 INFO L290 TraceCheckUtils]: 24: Hoare triple {8731#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); {8731#false} is VALID [2022-04-27 15:27:52,669 INFO L290 TraceCheckUtils]: 25: Hoare triple {8731#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); {8731#false} is VALID [2022-04-27 15:27:52,669 INFO L290 TraceCheckUtils]: 26: Hoare triple {8731#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {8731#false} is VALID [2022-04-27 15:27:52,671 INFO L290 TraceCheckUtils]: 27: Hoare triple {8731#false} ~skip~0 := 0; {8731#false} is VALID [2022-04-27 15:27:52,672 INFO L290 TraceCheckUtils]: 28: Hoare triple {8731#false} assume !false; {8731#false} is VALID [2022-04-27 15:27:52,672 INFO L290 TraceCheckUtils]: 29: Hoare triple {8731#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); {8731#false} is VALID [2022-04-27 15:27:52,672 INFO L290 TraceCheckUtils]: 30: Hoare triple {8731#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {8731#false} is VALID [2022-04-27 15:27:52,672 INFO L290 TraceCheckUtils]: 31: Hoare triple {8731#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {8731#false} is VALID [2022-04-27 15:27:52,672 INFO L290 TraceCheckUtils]: 32: Hoare triple {8731#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {8731#false} is VALID [2022-04-27 15:27:52,672 INFO L290 TraceCheckUtils]: 33: Hoare triple {8731#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {8731#false} is VALID [2022-04-27 15:27:52,672 INFO L290 TraceCheckUtils]: 34: Hoare triple {8731#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {8731#false} is VALID [2022-04-27 15:27:52,672 INFO L290 TraceCheckUtils]: 35: Hoare triple {8731#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {8731#false} is VALID [2022-04-27 15:27:52,672 INFO L290 TraceCheckUtils]: 36: Hoare triple {8731#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {8731#false} is VALID [2022-04-27 15:27:52,672 INFO L290 TraceCheckUtils]: 37: Hoare triple {8731#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {8731#false} is VALID [2022-04-27 15:27:52,672 INFO L290 TraceCheckUtils]: 38: Hoare triple {8731#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {8731#false} is VALID [2022-04-27 15:27:52,672 INFO L290 TraceCheckUtils]: 39: Hoare triple {8731#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {8731#false} is VALID [2022-04-27 15:27:52,672 INFO L290 TraceCheckUtils]: 40: Hoare triple {8731#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {8731#false} is VALID [2022-04-27 15:27:52,672 INFO L290 TraceCheckUtils]: 41: Hoare triple {8731#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {8731#false} is VALID [2022-04-27 15:27:52,672 INFO L290 TraceCheckUtils]: 42: Hoare triple {8731#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {8731#false} is VALID [2022-04-27 15:27:52,673 INFO L290 TraceCheckUtils]: 43: Hoare triple {8731#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {8731#false} is VALID [2022-04-27 15:27:52,673 INFO L290 TraceCheckUtils]: 44: Hoare triple {8731#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {8731#false} is VALID [2022-04-27 15:27:52,673 INFO L290 TraceCheckUtils]: 45: Hoare triple {8731#false} assume 8528 == #t~mem62;havoc #t~mem62; {8731#false} is VALID [2022-04-27 15:27:52,673 INFO L290 TraceCheckUtils]: 46: Hoare triple {8731#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); {8731#false} is VALID [2022-04-27 15:27:52,673 INFO L290 TraceCheckUtils]: 47: Hoare triple {8731#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; {8731#false} is VALID [2022-04-27 15:27:52,673 INFO L290 TraceCheckUtils]: 48: Hoare triple {8731#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); {8731#false} is VALID [2022-04-27 15:27:52,673 INFO L290 TraceCheckUtils]: 49: Hoare triple {8731#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {8731#false} is VALID [2022-04-27 15:27:52,673 INFO L290 TraceCheckUtils]: 50: Hoare triple {8731#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {8731#false} is VALID [2022-04-27 15:27:52,673 INFO L290 TraceCheckUtils]: 51: Hoare triple {8731#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {8731#false} is VALID [2022-04-27 15:27:52,673 INFO L290 TraceCheckUtils]: 52: Hoare triple {8731#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {8731#false} is VALID [2022-04-27 15:27:52,673 INFO L290 TraceCheckUtils]: 53: Hoare triple {8731#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); {8731#false} is VALID [2022-04-27 15:27:52,673 INFO L290 TraceCheckUtils]: 54: Hoare triple {8731#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {8731#false} is VALID [2022-04-27 15:27:52,673 INFO L290 TraceCheckUtils]: 55: Hoare triple {8731#false} ~skip~0 := 0; {8731#false} is VALID [2022-04-27 15:27:52,673 INFO L290 TraceCheckUtils]: 56: Hoare triple {8731#false} assume !false; {8731#false} is VALID [2022-04-27 15:27:52,673 INFO L290 TraceCheckUtils]: 57: Hoare triple {8731#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); {8731#false} is VALID [2022-04-27 15:27:52,673 INFO L290 TraceCheckUtils]: 58: Hoare triple {8731#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {8731#false} is VALID [2022-04-27 15:27:52,674 INFO L290 TraceCheckUtils]: 59: Hoare triple {8731#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {8731#false} is VALID [2022-04-27 15:27:52,674 INFO L290 TraceCheckUtils]: 60: Hoare triple {8731#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {8731#false} is VALID [2022-04-27 15:27:52,674 INFO L290 TraceCheckUtils]: 61: Hoare triple {8731#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {8731#false} is VALID [2022-04-27 15:27:52,674 INFO L290 TraceCheckUtils]: 62: Hoare triple {8731#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {8731#false} is VALID [2022-04-27 15:27:52,674 INFO L290 TraceCheckUtils]: 63: Hoare triple {8731#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {8731#false} is VALID [2022-04-27 15:27:52,674 INFO L290 TraceCheckUtils]: 64: Hoare triple {8731#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {8731#false} is VALID [2022-04-27 15:27:52,675 INFO L290 TraceCheckUtils]: 65: Hoare triple {8731#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {8731#false} is VALID [2022-04-27 15:27:52,675 INFO L290 TraceCheckUtils]: 66: Hoare triple {8731#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {8731#false} is VALID [2022-04-27 15:27:52,675 INFO L290 TraceCheckUtils]: 67: Hoare triple {8731#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {8731#false} is VALID [2022-04-27 15:27:52,675 INFO L290 TraceCheckUtils]: 68: Hoare triple {8731#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {8731#false} is VALID [2022-04-27 15:27:52,675 INFO L290 TraceCheckUtils]: 69: Hoare triple {8731#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {8731#false} is VALID [2022-04-27 15:27:52,675 INFO L290 TraceCheckUtils]: 70: Hoare triple {8731#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {8731#false} is VALID [2022-04-27 15:27:52,675 INFO L290 TraceCheckUtils]: 71: Hoare triple {8731#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {8731#false} is VALID [2022-04-27 15:27:52,675 INFO L290 TraceCheckUtils]: 72: Hoare triple {8731#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {8731#false} is VALID [2022-04-27 15:27:52,675 INFO L290 TraceCheckUtils]: 73: Hoare triple {8731#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {8731#false} is VALID [2022-04-27 15:27:52,675 INFO L290 TraceCheckUtils]: 74: Hoare triple {8731#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {8731#false} is VALID [2022-04-27 15:27:52,675 INFO L290 TraceCheckUtils]: 75: Hoare triple {8731#false} assume 8544 == #t~mem64;havoc #t~mem64; {8731#false} is VALID [2022-04-27 15:27:52,675 INFO L290 TraceCheckUtils]: 76: Hoare triple {8731#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {8731#false} is VALID [2022-04-27 15:27:52,675 INFO L290 TraceCheckUtils]: 77: Hoare triple {8731#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); {8731#false} is VALID [2022-04-27 15:27:52,675 INFO L290 TraceCheckUtils]: 78: Hoare triple {8731#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {8731#false} is VALID [2022-04-27 15:27:52,675 INFO L290 TraceCheckUtils]: 79: Hoare triple {8731#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); {8731#false} is VALID [2022-04-27 15:27:52,675 INFO L290 TraceCheckUtils]: 80: Hoare triple {8731#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; {8731#false} is VALID [2022-04-27 15:27:52,676 INFO L290 TraceCheckUtils]: 81: Hoare triple {8731#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; {8731#false} is VALID [2022-04-27 15:27:52,676 INFO L290 TraceCheckUtils]: 82: Hoare triple {8731#false} assume 8 == ~blastFlag~0; {8731#false} is VALID [2022-04-27 15:27:52,676 INFO L290 TraceCheckUtils]: 83: Hoare triple {8731#false} assume !false; {8731#false} is VALID [2022-04-27 15:27:52,676 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-27 15:27:52,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:27:52,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914994719] [2022-04-27 15:27:52,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914994719] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:27:52,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:27:52,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:27:52,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826073795] [2022-04-27 15:27:52,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:27:52,678 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2022-04-27 15:27:52,678 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:27:52,678 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:52,723 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:27:52,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:27:52,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:27:52,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:27:52,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:27:52,724 INFO L87 Difference]: Start difference. First operand 261 states and 427 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:59,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:59,539 INFO L93 Difference]: Finished difference Result 572 states and 923 transitions. [2022-04-27 15:27:59,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:27:59,540 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2022-04-27 15:27:59,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:27:59,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:59,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2022-04-27 15:27:59,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:59,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2022-04-27 15:27:59,545 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 590 transitions. [2022-04-27 15:27:59,944 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 590 edges. 590 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:27:59,949 INFO L225 Difference]: With dead ends: 572 [2022-04-27 15:27:59,949 INFO L226 Difference]: Without dead ends: 337 [2022-04-27 15:27:59,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:27:59,950 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 146 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 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.7s IncrementalHoareTripleChecker+Time [2022-04-27 15:27:59,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 358 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-04-27 15:27:59,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-04-27 15:27:59,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 261. [2022-04-27 15:27:59,954 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:27:59,954 INFO L82 GeneralOperation]: Start isEquivalent. First operand 337 states. Second operand has 261 states, 256 states have (on average 1.63671875) internal successors, (419), 256 states have internal predecessors, (419), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:59,955 INFO L74 IsIncluded]: Start isIncluded. First operand 337 states. Second operand has 261 states, 256 states have (on average 1.63671875) internal successors, (419), 256 states have internal predecessors, (419), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:59,955 INFO L87 Difference]: Start difference. First operand 337 states. Second operand has 261 states, 256 states have (on average 1.63671875) internal successors, (419), 256 states have internal predecessors, (419), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:59,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:59,967 INFO L93 Difference]: Finished difference Result 337 states and 529 transitions. [2022-04-27 15:27:59,967 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 529 transitions. [2022-04-27 15:27:59,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:27:59,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:27:59,968 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 337 states. [2022-04-27 15:27:59,968 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 337 states. [2022-04-27 15:27:59,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:59,973 INFO L93 Difference]: Finished difference Result 337 states and 529 transitions. [2022-04-27 15:27:59,973 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 529 transitions. [2022-04-27 15:27:59,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:27:59,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:27:59,974 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:27:59,974 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:27:59,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 256 states have (on average 1.63671875) internal successors, (419), 256 states have internal predecessors, (419), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:59,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 423 transitions. [2022-04-27 15:27:59,978 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 423 transitions. Word has length 84 [2022-04-27 15:27:59,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:27:59,978 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 423 transitions. [2022-04-27 15:27:59,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:59,979 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 423 transitions. [2022-04-27 15:27:59,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-27 15:27:59,981 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:27:59,981 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:27:59,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-27 15:27:59,981 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:27:59,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:27:59,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1270495820, now seen corresponding path program 1 times [2022-04-27 15:27:59,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:27:59,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076274223] [2022-04-27 15:27:59,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:27:59,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:28:00,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:28:00,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:28:00,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:28:00,093 INFO L290 TraceCheckUtils]: 0: Hoare triple {10377#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {10370#true} is VALID [2022-04-27 15:28:00,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {10370#true} assume true; {10370#true} is VALID [2022-04-27 15:28:00,093 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10370#true} {10370#true} #689#return; {10370#true} is VALID [2022-04-27 15:28:00,094 INFO L272 TraceCheckUtils]: 0: Hoare triple {10370#true} call ULTIMATE.init(); {10377#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:28:00,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {10377#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {10370#true} is VALID [2022-04-27 15:28:00,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {10370#true} assume true; {10370#true} is VALID [2022-04-27 15:28:00,094 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10370#true} {10370#true} #689#return; {10370#true} is VALID [2022-04-27 15:28:00,094 INFO L272 TraceCheckUtils]: 4: Hoare triple {10370#true} call #t~ret161 := main(); {10370#true} is VALID [2022-04-27 15:28:00,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {10370#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; {10370#true} is VALID [2022-04-27 15:28:00,094 INFO L290 TraceCheckUtils]: 6: Hoare triple {10370#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {10370#true} is VALID [2022-04-27 15:28:00,094 INFO L272 TraceCheckUtils]: 7: Hoare triple {10370#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {10370#true} is VALID [2022-04-27 15:28:00,096 INFO L290 TraceCheckUtils]: 8: Hoare triple {10370#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); {10375#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:28:00,096 INFO L290 TraceCheckUtils]: 9: Hoare triple {10375#(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; {10375#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:28:00,097 INFO L290 TraceCheckUtils]: 10: Hoare triple {10375#(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; {10375#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:28:00,097 INFO L290 TraceCheckUtils]: 11: Hoare triple {10375#(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)))); {10375#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:28:00,098 INFO L290 TraceCheckUtils]: 12: Hoare triple {10375#(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); {10375#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:28:00,098 INFO L290 TraceCheckUtils]: 13: Hoare triple {10375#(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; {10375#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:28:00,098 INFO L290 TraceCheckUtils]: 14: Hoare triple {10375#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {10375#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:28:00,098 INFO L290 TraceCheckUtils]: 15: Hoare triple {10375#(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); {10375#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:28:00,099 INFO L290 TraceCheckUtils]: 16: Hoare triple {10375#(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); {10376#(not (= |ssl3_accept_#t~mem48| 16384))} is VALID [2022-04-27 15:28:00,099 INFO L290 TraceCheckUtils]: 17: Hoare triple {10376#(not (= |ssl3_accept_#t~mem48| 16384))} assume 16384 == #t~mem48;havoc #t~mem48; {10371#false} is VALID [2022-04-27 15:28:00,099 INFO L290 TraceCheckUtils]: 18: Hoare triple {10371#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {10371#false} is VALID [2022-04-27 15:28:00,099 INFO L290 TraceCheckUtils]: 19: Hoare triple {10371#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {10371#false} is VALID [2022-04-27 15:28:00,099 INFO L290 TraceCheckUtils]: 20: Hoare triple {10371#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {10371#false} is VALID [2022-04-27 15:28:00,099 INFO L290 TraceCheckUtils]: 21: Hoare triple {10371#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); {10371#false} is VALID [2022-04-27 15:28:00,099 INFO L290 TraceCheckUtils]: 22: Hoare triple {10371#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {10371#false} is VALID [2022-04-27 15:28:00,099 INFO L290 TraceCheckUtils]: 23: Hoare triple {10371#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); {10371#false} is VALID [2022-04-27 15:28:00,099 INFO L290 TraceCheckUtils]: 24: Hoare triple {10371#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); {10371#false} is VALID [2022-04-27 15:28:00,100 INFO L290 TraceCheckUtils]: 25: Hoare triple {10371#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); {10371#false} is VALID [2022-04-27 15:28:00,100 INFO L290 TraceCheckUtils]: 26: Hoare triple {10371#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {10371#false} is VALID [2022-04-27 15:28:00,100 INFO L290 TraceCheckUtils]: 27: Hoare triple {10371#false} ~skip~0 := 0; {10371#false} is VALID [2022-04-27 15:28:00,100 INFO L290 TraceCheckUtils]: 28: Hoare triple {10371#false} assume !false; {10371#false} is VALID [2022-04-27 15:28:00,100 INFO L290 TraceCheckUtils]: 29: Hoare triple {10371#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); {10371#false} is VALID [2022-04-27 15:28:00,100 INFO L290 TraceCheckUtils]: 30: Hoare triple {10371#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {10371#false} is VALID [2022-04-27 15:28:00,100 INFO L290 TraceCheckUtils]: 31: Hoare triple {10371#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {10371#false} is VALID [2022-04-27 15:28:00,100 INFO L290 TraceCheckUtils]: 32: Hoare triple {10371#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {10371#false} is VALID [2022-04-27 15:28:00,100 INFO L290 TraceCheckUtils]: 33: Hoare triple {10371#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {10371#false} is VALID [2022-04-27 15:28:00,100 INFO L290 TraceCheckUtils]: 34: Hoare triple {10371#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {10371#false} is VALID [2022-04-27 15:28:00,100 INFO L290 TraceCheckUtils]: 35: Hoare triple {10371#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {10371#false} is VALID [2022-04-27 15:28:00,100 INFO L290 TraceCheckUtils]: 36: Hoare triple {10371#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {10371#false} is VALID [2022-04-27 15:28:00,100 INFO L290 TraceCheckUtils]: 37: Hoare triple {10371#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {10371#false} is VALID [2022-04-27 15:28:00,100 INFO L290 TraceCheckUtils]: 38: Hoare triple {10371#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {10371#false} is VALID [2022-04-27 15:28:00,100 INFO L290 TraceCheckUtils]: 39: Hoare triple {10371#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {10371#false} is VALID [2022-04-27 15:28:00,100 INFO L290 TraceCheckUtils]: 40: Hoare triple {10371#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {10371#false} is VALID [2022-04-27 15:28:00,101 INFO L290 TraceCheckUtils]: 41: Hoare triple {10371#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {10371#false} is VALID [2022-04-27 15:28:00,101 INFO L290 TraceCheckUtils]: 42: Hoare triple {10371#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {10371#false} is VALID [2022-04-27 15:28:00,101 INFO L290 TraceCheckUtils]: 43: Hoare triple {10371#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {10371#false} is VALID [2022-04-27 15:28:00,101 INFO L290 TraceCheckUtils]: 44: Hoare triple {10371#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {10371#false} is VALID [2022-04-27 15:28:00,101 INFO L290 TraceCheckUtils]: 45: Hoare triple {10371#false} assume 8528 == #t~mem62;havoc #t~mem62; {10371#false} is VALID [2022-04-27 15:28:00,101 INFO L290 TraceCheckUtils]: 46: Hoare triple {10371#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); {10371#false} is VALID [2022-04-27 15:28:00,101 INFO L290 TraceCheckUtils]: 47: Hoare triple {10371#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; {10371#false} is VALID [2022-04-27 15:28:00,101 INFO L290 TraceCheckUtils]: 48: Hoare triple {10371#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); {10371#false} is VALID [2022-04-27 15:28:00,101 INFO L290 TraceCheckUtils]: 49: Hoare triple {10371#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {10371#false} is VALID [2022-04-27 15:28:00,101 INFO L290 TraceCheckUtils]: 50: Hoare triple {10371#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {10371#false} is VALID [2022-04-27 15:28:00,101 INFO L290 TraceCheckUtils]: 51: Hoare triple {10371#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {10371#false} is VALID [2022-04-27 15:28:00,101 INFO L290 TraceCheckUtils]: 52: Hoare triple {10371#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {10371#false} is VALID [2022-04-27 15:28:00,101 INFO L290 TraceCheckUtils]: 53: Hoare triple {10371#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); {10371#false} is VALID [2022-04-27 15:28:00,101 INFO L290 TraceCheckUtils]: 54: Hoare triple {10371#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {10371#false} is VALID [2022-04-27 15:28:00,101 INFO L290 TraceCheckUtils]: 55: Hoare triple {10371#false} ~skip~0 := 0; {10371#false} is VALID [2022-04-27 15:28:00,101 INFO L290 TraceCheckUtils]: 56: Hoare triple {10371#false} assume !false; {10371#false} is VALID [2022-04-27 15:28:00,102 INFO L290 TraceCheckUtils]: 57: Hoare triple {10371#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); {10371#false} is VALID [2022-04-27 15:28:00,102 INFO L290 TraceCheckUtils]: 58: Hoare triple {10371#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {10371#false} is VALID [2022-04-27 15:28:00,102 INFO L290 TraceCheckUtils]: 59: Hoare triple {10371#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {10371#false} is VALID [2022-04-27 15:28:00,102 INFO L290 TraceCheckUtils]: 60: Hoare triple {10371#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {10371#false} is VALID [2022-04-27 15:28:00,102 INFO L290 TraceCheckUtils]: 61: Hoare triple {10371#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {10371#false} is VALID [2022-04-27 15:28:00,102 INFO L290 TraceCheckUtils]: 62: Hoare triple {10371#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {10371#false} is VALID [2022-04-27 15:28:00,102 INFO L290 TraceCheckUtils]: 63: Hoare triple {10371#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {10371#false} is VALID [2022-04-27 15:28:00,102 INFO L290 TraceCheckUtils]: 64: Hoare triple {10371#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {10371#false} is VALID [2022-04-27 15:28:00,102 INFO L290 TraceCheckUtils]: 65: Hoare triple {10371#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {10371#false} is VALID [2022-04-27 15:28:00,102 INFO L290 TraceCheckUtils]: 66: Hoare triple {10371#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {10371#false} is VALID [2022-04-27 15:28:00,102 INFO L290 TraceCheckUtils]: 67: Hoare triple {10371#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {10371#false} is VALID [2022-04-27 15:28:00,102 INFO L290 TraceCheckUtils]: 68: Hoare triple {10371#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {10371#false} is VALID [2022-04-27 15:28:00,102 INFO L290 TraceCheckUtils]: 69: Hoare triple {10371#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {10371#false} is VALID [2022-04-27 15:28:00,102 INFO L290 TraceCheckUtils]: 70: Hoare triple {10371#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {10371#false} is VALID [2022-04-27 15:28:00,102 INFO L290 TraceCheckUtils]: 71: Hoare triple {10371#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {10371#false} is VALID [2022-04-27 15:28:00,102 INFO L290 TraceCheckUtils]: 72: Hoare triple {10371#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {10371#false} is VALID [2022-04-27 15:28:00,103 INFO L290 TraceCheckUtils]: 73: Hoare triple {10371#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {10371#false} is VALID [2022-04-27 15:28:00,103 INFO L290 TraceCheckUtils]: 74: Hoare triple {10371#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {10371#false} is VALID [2022-04-27 15:28:00,103 INFO L290 TraceCheckUtils]: 75: Hoare triple {10371#false} assume 8544 == #t~mem64;havoc #t~mem64; {10371#false} is VALID [2022-04-27 15:28:00,103 INFO L290 TraceCheckUtils]: 76: Hoare triple {10371#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {10371#false} is VALID [2022-04-27 15:28:00,103 INFO L290 TraceCheckUtils]: 77: Hoare triple {10371#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); {10371#false} is VALID [2022-04-27 15:28:00,103 INFO L290 TraceCheckUtils]: 78: Hoare triple {10371#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {10371#false} is VALID [2022-04-27 15:28:00,103 INFO L290 TraceCheckUtils]: 79: Hoare triple {10371#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); {10371#false} is VALID [2022-04-27 15:28:00,103 INFO L290 TraceCheckUtils]: 80: Hoare triple {10371#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; {10371#false} is VALID [2022-04-27 15:28:00,103 INFO L290 TraceCheckUtils]: 81: Hoare triple {10371#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; {10371#false} is VALID [2022-04-27 15:28:00,103 INFO L290 TraceCheckUtils]: 82: Hoare triple {10371#false} assume 8 == ~blastFlag~0; {10371#false} is VALID [2022-04-27 15:28:00,103 INFO L290 TraceCheckUtils]: 83: Hoare triple {10371#false} assume !false; {10371#false} is VALID [2022-04-27 15:28:00,103 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-27 15:28:00,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:28:00,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076274223] [2022-04-27 15:28:00,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076274223] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:28:00,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:28:00,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:28:00,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866634387] [2022-04-27 15:28:00,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:28:00,104 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2022-04-27 15:28:00,104 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:28:00,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:00,152 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:28:00,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:28:00,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:28:00,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:28:00,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:28:00,153 INFO L87 Difference]: Start difference. First operand 261 states and 423 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:04,367 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:28:05,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:28:05,677 INFO L93 Difference]: Finished difference Result 572 states and 916 transitions. [2022-04-27 15:28:05,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:28:05,678 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2022-04-27 15:28:05,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:28:05,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:05,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 589 transitions. [2022-04-27 15:28:05,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:05,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 589 transitions. [2022-04-27 15:28:05,686 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 589 transitions. [2022-04-27 15:28:06,219 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 589 edges. 589 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:28:06,224 INFO L225 Difference]: With dead ends: 572 [2022-04-27 15:28:06,224 INFO L226 Difference]: Without dead ends: 337 [2022-04-27 15:28:06,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:28:06,225 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 144 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 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, 3.3s IncrementalHoareTripleChecker+Time [2022-04-27 15:28:06,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 358 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-04-27 15:28:06,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-04-27 15:28:06,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 261. [2022-04-27 15:28:06,231 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:28:06,232 INFO L82 GeneralOperation]: Start isEquivalent. First operand 337 states. Second operand has 261 states, 256 states have (on average 1.62109375) internal successors, (415), 256 states have internal predecessors, (415), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:06,236 INFO L74 IsIncluded]: Start isIncluded. First operand 337 states. Second operand has 261 states, 256 states have (on average 1.62109375) internal successors, (415), 256 states have internal predecessors, (415), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:06,238 INFO L87 Difference]: Start difference. First operand 337 states. Second operand has 261 states, 256 states have (on average 1.62109375) internal successors, (415), 256 states have internal predecessors, (415), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:06,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:28:06,243 INFO L93 Difference]: Finished difference Result 337 states and 525 transitions. [2022-04-27 15:28:06,243 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 525 transitions. [2022-04-27 15:28:06,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:28:06,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:28:06,244 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 337 states. [2022-04-27 15:28:06,245 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 337 states. [2022-04-27 15:28:06,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:28:06,250 INFO L93 Difference]: Finished difference Result 337 states and 525 transitions. [2022-04-27 15:28:06,250 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 525 transitions. [2022-04-27 15:28:06,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:28:06,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:28:06,251 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:28:06,251 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:28:06,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 256 states have (on average 1.62109375) internal successors, (415), 256 states have internal predecessors, (415), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:06,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 419 transitions. [2022-04-27 15:28:06,255 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 419 transitions. Word has length 84 [2022-04-27 15:28:06,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:28:06,255 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 419 transitions. [2022-04-27 15:28:06,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:06,256 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 419 transitions. [2022-04-27 15:28:06,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-27 15:28:06,258 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:28:06,258 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:28:06,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-27 15:28:06,258 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:28:06,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:28:06,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1693483075, now seen corresponding path program 1 times [2022-04-27 15:28:06,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:28:06,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801694372] [2022-04-27 15:28:06,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:28:06,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:28:06,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:28:06,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:28:06,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:28:06,365 INFO L290 TraceCheckUtils]: 0: Hoare triple {12017#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {12010#true} is VALID [2022-04-27 15:28:06,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {12010#true} assume true; {12010#true} is VALID [2022-04-27 15:28:06,365 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12010#true} {12010#true} #689#return; {12010#true} is VALID [2022-04-27 15:28:06,366 INFO L272 TraceCheckUtils]: 0: Hoare triple {12010#true} call ULTIMATE.init(); {12017#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:28:06,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {12017#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {12010#true} is VALID [2022-04-27 15:28:06,366 INFO L290 TraceCheckUtils]: 2: Hoare triple {12010#true} assume true; {12010#true} is VALID [2022-04-27 15:28:06,366 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12010#true} {12010#true} #689#return; {12010#true} is VALID [2022-04-27 15:28:06,366 INFO L272 TraceCheckUtils]: 4: Hoare triple {12010#true} call #t~ret161 := main(); {12010#true} is VALID [2022-04-27 15:28:06,366 INFO L290 TraceCheckUtils]: 5: Hoare triple {12010#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; {12010#true} is VALID [2022-04-27 15:28:06,366 INFO L290 TraceCheckUtils]: 6: Hoare triple {12010#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {12010#true} is VALID [2022-04-27 15:28:06,367 INFO L272 TraceCheckUtils]: 7: Hoare triple {12010#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {12010#true} is VALID [2022-04-27 15:28:06,368 INFO L290 TraceCheckUtils]: 8: Hoare triple {12010#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); {12015#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:28:06,369 INFO L290 TraceCheckUtils]: 9: Hoare triple {12015#(= 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; {12015#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:28:06,369 INFO L290 TraceCheckUtils]: 10: Hoare triple {12015#(= 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; {12015#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:28:06,370 INFO L290 TraceCheckUtils]: 11: Hoare triple {12015#(= 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)))); {12015#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:28:06,370 INFO L290 TraceCheckUtils]: 12: Hoare triple {12015#(= 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); {12015#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:28:06,370 INFO L290 TraceCheckUtils]: 13: Hoare triple {12015#(= 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; {12015#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:28:06,371 INFO L290 TraceCheckUtils]: 14: Hoare triple {12015#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {12015#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:28:06,371 INFO L290 TraceCheckUtils]: 15: Hoare triple {12015#(= 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); {12015#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:28:06,371 INFO L290 TraceCheckUtils]: 16: Hoare triple {12015#(= 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); {12015#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:28:06,372 INFO L290 TraceCheckUtils]: 17: Hoare triple {12015#(= 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); {12015#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:28:06,372 INFO L290 TraceCheckUtils]: 18: Hoare triple {12015#(= 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); {12015#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:28:06,372 INFO L290 TraceCheckUtils]: 19: Hoare triple {12015#(= 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); {12015#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:28:06,373 INFO L290 TraceCheckUtils]: 20: Hoare triple {12015#(= 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); {12015#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:28:06,373 INFO L290 TraceCheckUtils]: 21: Hoare triple {12015#(= 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); {12016#(= 8464 |ssl3_accept_#t~mem53|)} is VALID [2022-04-27 15:28:06,373 INFO L290 TraceCheckUtils]: 22: Hoare triple {12016#(= 8464 |ssl3_accept_#t~mem53|)} assume 8481 == #t~mem53;havoc #t~mem53; {12011#false} is VALID [2022-04-27 15:28:06,373 INFO L290 TraceCheckUtils]: 23: Hoare triple {12011#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; {12011#false} is VALID [2022-04-27 15:28:06,373 INFO L290 TraceCheckUtils]: 24: Hoare triple {12011#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); {12011#false} is VALID [2022-04-27 15:28:06,374 INFO L290 TraceCheckUtils]: 25: Hoare triple {12011#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); {12011#false} is VALID [2022-04-27 15:28:06,374 INFO L290 TraceCheckUtils]: 26: Hoare triple {12011#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {12011#false} is VALID [2022-04-27 15:28:06,374 INFO L290 TraceCheckUtils]: 27: Hoare triple {12011#false} ~skip~0 := 0; {12011#false} is VALID [2022-04-27 15:28:06,374 INFO L290 TraceCheckUtils]: 28: Hoare triple {12011#false} assume !false; {12011#false} is VALID [2022-04-27 15:28:06,374 INFO L290 TraceCheckUtils]: 29: Hoare triple {12011#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); {12011#false} is VALID [2022-04-27 15:28:06,374 INFO L290 TraceCheckUtils]: 30: Hoare triple {12011#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {12011#false} is VALID [2022-04-27 15:28:06,374 INFO L290 TraceCheckUtils]: 31: Hoare triple {12011#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {12011#false} is VALID [2022-04-27 15:28:06,374 INFO L290 TraceCheckUtils]: 32: Hoare triple {12011#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {12011#false} is VALID [2022-04-27 15:28:06,374 INFO L290 TraceCheckUtils]: 33: Hoare triple {12011#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {12011#false} is VALID [2022-04-27 15:28:06,374 INFO L290 TraceCheckUtils]: 34: Hoare triple {12011#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {12011#false} is VALID [2022-04-27 15:28:06,374 INFO L290 TraceCheckUtils]: 35: Hoare triple {12011#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {12011#false} is VALID [2022-04-27 15:28:06,374 INFO L290 TraceCheckUtils]: 36: Hoare triple {12011#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {12011#false} is VALID [2022-04-27 15:28:06,374 INFO L290 TraceCheckUtils]: 37: Hoare triple {12011#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {12011#false} is VALID [2022-04-27 15:28:06,374 INFO L290 TraceCheckUtils]: 38: Hoare triple {12011#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {12011#false} is VALID [2022-04-27 15:28:06,374 INFO L290 TraceCheckUtils]: 39: Hoare triple {12011#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {12011#false} is VALID [2022-04-27 15:28:06,374 INFO L290 TraceCheckUtils]: 40: Hoare triple {12011#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {12011#false} is VALID [2022-04-27 15:28:06,375 INFO L290 TraceCheckUtils]: 41: Hoare triple {12011#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {12011#false} is VALID [2022-04-27 15:28:06,375 INFO L290 TraceCheckUtils]: 42: Hoare triple {12011#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {12011#false} is VALID [2022-04-27 15:28:06,375 INFO L290 TraceCheckUtils]: 43: Hoare triple {12011#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {12011#false} is VALID [2022-04-27 15:28:06,375 INFO L290 TraceCheckUtils]: 44: Hoare triple {12011#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {12011#false} is VALID [2022-04-27 15:28:06,375 INFO L290 TraceCheckUtils]: 45: Hoare triple {12011#false} assume 8528 == #t~mem62;havoc #t~mem62; {12011#false} is VALID [2022-04-27 15:28:06,375 INFO L290 TraceCheckUtils]: 46: Hoare triple {12011#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); {12011#false} is VALID [2022-04-27 15:28:06,375 INFO L290 TraceCheckUtils]: 47: Hoare triple {12011#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; {12011#false} is VALID [2022-04-27 15:28:06,375 INFO L290 TraceCheckUtils]: 48: Hoare triple {12011#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); {12011#false} is VALID [2022-04-27 15:28:06,375 INFO L290 TraceCheckUtils]: 49: Hoare triple {12011#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {12011#false} is VALID [2022-04-27 15:28:06,375 INFO L290 TraceCheckUtils]: 50: Hoare triple {12011#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {12011#false} is VALID [2022-04-27 15:28:06,375 INFO L290 TraceCheckUtils]: 51: Hoare triple {12011#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {12011#false} is VALID [2022-04-27 15:28:06,375 INFO L290 TraceCheckUtils]: 52: Hoare triple {12011#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {12011#false} is VALID [2022-04-27 15:28:06,375 INFO L290 TraceCheckUtils]: 53: Hoare triple {12011#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); {12011#false} is VALID [2022-04-27 15:28:06,375 INFO L290 TraceCheckUtils]: 54: Hoare triple {12011#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {12011#false} is VALID [2022-04-27 15:28:06,375 INFO L290 TraceCheckUtils]: 55: Hoare triple {12011#false} ~skip~0 := 0; {12011#false} is VALID [2022-04-27 15:28:06,375 INFO L290 TraceCheckUtils]: 56: Hoare triple {12011#false} assume !false; {12011#false} is VALID [2022-04-27 15:28:06,376 INFO L290 TraceCheckUtils]: 57: Hoare triple {12011#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); {12011#false} is VALID [2022-04-27 15:28:06,376 INFO L290 TraceCheckUtils]: 58: Hoare triple {12011#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {12011#false} is VALID [2022-04-27 15:28:06,376 INFO L290 TraceCheckUtils]: 59: Hoare triple {12011#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {12011#false} is VALID [2022-04-27 15:28:06,376 INFO L290 TraceCheckUtils]: 60: Hoare triple {12011#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {12011#false} is VALID [2022-04-27 15:28:06,376 INFO L290 TraceCheckUtils]: 61: Hoare triple {12011#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {12011#false} is VALID [2022-04-27 15:28:06,376 INFO L290 TraceCheckUtils]: 62: Hoare triple {12011#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {12011#false} is VALID [2022-04-27 15:28:06,376 INFO L290 TraceCheckUtils]: 63: Hoare triple {12011#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {12011#false} is VALID [2022-04-27 15:28:06,376 INFO L290 TraceCheckUtils]: 64: Hoare triple {12011#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {12011#false} is VALID [2022-04-27 15:28:06,376 INFO L290 TraceCheckUtils]: 65: Hoare triple {12011#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {12011#false} is VALID [2022-04-27 15:28:06,376 INFO L290 TraceCheckUtils]: 66: Hoare triple {12011#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {12011#false} is VALID [2022-04-27 15:28:06,376 INFO L290 TraceCheckUtils]: 67: Hoare triple {12011#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {12011#false} is VALID [2022-04-27 15:28:06,376 INFO L290 TraceCheckUtils]: 68: Hoare triple {12011#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {12011#false} is VALID [2022-04-27 15:28:06,376 INFO L290 TraceCheckUtils]: 69: Hoare triple {12011#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {12011#false} is VALID [2022-04-27 15:28:06,376 INFO L290 TraceCheckUtils]: 70: Hoare triple {12011#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {12011#false} is VALID [2022-04-27 15:28:06,376 INFO L290 TraceCheckUtils]: 71: Hoare triple {12011#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {12011#false} is VALID [2022-04-27 15:28:06,376 INFO L290 TraceCheckUtils]: 72: Hoare triple {12011#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {12011#false} is VALID [2022-04-27 15:28:06,377 INFO L290 TraceCheckUtils]: 73: Hoare triple {12011#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {12011#false} is VALID [2022-04-27 15:28:06,377 INFO L290 TraceCheckUtils]: 74: Hoare triple {12011#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {12011#false} is VALID [2022-04-27 15:28:06,377 INFO L290 TraceCheckUtils]: 75: Hoare triple {12011#false} assume 8544 == #t~mem64;havoc #t~mem64; {12011#false} is VALID [2022-04-27 15:28:06,377 INFO L290 TraceCheckUtils]: 76: Hoare triple {12011#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {12011#false} is VALID [2022-04-27 15:28:06,377 INFO L290 TraceCheckUtils]: 77: Hoare triple {12011#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); {12011#false} is VALID [2022-04-27 15:28:06,377 INFO L290 TraceCheckUtils]: 78: Hoare triple {12011#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {12011#false} is VALID [2022-04-27 15:28:06,377 INFO L290 TraceCheckUtils]: 79: Hoare triple {12011#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); {12011#false} is VALID [2022-04-27 15:28:06,377 INFO L290 TraceCheckUtils]: 80: Hoare triple {12011#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; {12011#false} is VALID [2022-04-27 15:28:06,377 INFO L290 TraceCheckUtils]: 81: Hoare triple {12011#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; {12011#false} is VALID [2022-04-27 15:28:06,377 INFO L290 TraceCheckUtils]: 82: Hoare triple {12011#false} assume 8 == ~blastFlag~0; {12011#false} is VALID [2022-04-27 15:28:06,377 INFO L290 TraceCheckUtils]: 83: Hoare triple {12011#false} assume !false; {12011#false} is VALID [2022-04-27 15:28:06,377 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-27 15:28:06,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:28:06,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801694372] [2022-04-27 15:28:06,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801694372] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:28:06,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:28:06,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:28:06,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397486696] [2022-04-27 15:28:06,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:28:06,379 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2022-04-27 15:28:06,379 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:28:06,379 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:06,425 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:28:06,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:28:06,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:28:06,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:28:06,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:28:06,426 INFO L87 Difference]: Start difference. First operand 261 states and 419 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:11,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:28:11,589 INFO L93 Difference]: Finished difference Result 510 states and 821 transitions. [2022-04-27 15:28:11,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:28:11,589 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2022-04-27 15:28:11,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:28:11,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:11,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 445 transitions. [2022-04-27 15:28:11,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:11,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 445 transitions. [2022-04-27 15:28:11,593 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 445 transitions. [2022-04-27 15:28:11,876 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 445 edges. 445 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:28:11,880 INFO L225 Difference]: With dead ends: 510 [2022-04-27 15:28:11,880 INFO L226 Difference]: Without dead ends: 275 [2022-04-27 15:28:11,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:28:11,881 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 20 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s 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.8s IncrementalHoareTripleChecker+Time [2022-04-27 15:28:11,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 489 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-04-27 15:28:11,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-04-27 15:28:11,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 261. [2022-04-27 15:28:11,885 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:28:11,885 INFO L82 GeneralOperation]: Start isEquivalent. First operand 275 states. Second operand has 261 states, 256 states have (on average 1.6171875) internal successors, (414), 256 states have internal predecessors, (414), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:11,885 INFO L74 IsIncluded]: Start isIncluded. First operand 275 states. Second operand has 261 states, 256 states have (on average 1.6171875) internal successors, (414), 256 states have internal predecessors, (414), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:11,886 INFO L87 Difference]: Start difference. First operand 275 states. Second operand has 261 states, 256 states have (on average 1.6171875) internal successors, (414), 256 states have internal predecessors, (414), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:11,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:28:11,896 INFO L93 Difference]: Finished difference Result 275 states and 436 transitions. [2022-04-27 15:28:11,896 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 436 transitions. [2022-04-27 15:28:11,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:28:11,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:28:11,897 INFO L74 IsIncluded]: Start isIncluded. First operand has 261 states, 256 states have (on average 1.6171875) internal successors, (414), 256 states have internal predecessors, (414), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 275 states. [2022-04-27 15:28:11,897 INFO L87 Difference]: Start difference. First operand has 261 states, 256 states have (on average 1.6171875) internal successors, (414), 256 states have internal predecessors, (414), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 275 states. [2022-04-27 15:28:11,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:28:11,901 INFO L93 Difference]: Finished difference Result 275 states and 436 transitions. [2022-04-27 15:28:11,901 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 436 transitions. [2022-04-27 15:28:11,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:28:11,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:28:11,901 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:28:11,901 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:28:11,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 256 states have (on average 1.6171875) internal successors, (414), 256 states have internal predecessors, (414), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:11,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 418 transitions. [2022-04-27 15:28:11,905 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 418 transitions. Word has length 84 [2022-04-27 15:28:11,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:28:11,905 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 418 transitions. [2022-04-27 15:28:11,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:11,905 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 418 transitions. [2022-04-27 15:28:11,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-27 15:28:11,918 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:28:11,918 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:28:11,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-27 15:28:11,918 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:28:11,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:28:11,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1703458820, now seen corresponding path program 1 times [2022-04-27 15:28:11,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:28:11,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204571682] [2022-04-27 15:28:11,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:28:11,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:28:11,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:28:12,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:28:12,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:28:12,046 INFO L290 TraceCheckUtils]: 0: Hoare triple {13454#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {13447#true} is VALID [2022-04-27 15:28:12,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {13447#true} assume true; {13447#true} is VALID [2022-04-27 15:28:12,046 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13447#true} {13447#true} #689#return; {13447#true} is VALID [2022-04-27 15:28:12,046 INFO L272 TraceCheckUtils]: 0: Hoare triple {13447#true} call ULTIMATE.init(); {13454#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:28:12,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {13454#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {13447#true} is VALID [2022-04-27 15:28:12,048 INFO L290 TraceCheckUtils]: 2: Hoare triple {13447#true} assume true; {13447#true} is VALID [2022-04-27 15:28:12,048 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13447#true} {13447#true} #689#return; {13447#true} is VALID [2022-04-27 15:28:12,048 INFO L272 TraceCheckUtils]: 4: Hoare triple {13447#true} call #t~ret161 := main(); {13447#true} is VALID [2022-04-27 15:28:12,048 INFO L290 TraceCheckUtils]: 5: Hoare triple {13447#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; {13447#true} is VALID [2022-04-27 15:28:12,048 INFO L290 TraceCheckUtils]: 6: Hoare triple {13447#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {13447#true} is VALID [2022-04-27 15:28:12,048 INFO L272 TraceCheckUtils]: 7: Hoare triple {13447#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {13447#true} is VALID [2022-04-27 15:28:12,050 INFO L290 TraceCheckUtils]: 8: Hoare triple {13447#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); {13452#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:28:12,050 INFO L290 TraceCheckUtils]: 9: Hoare triple {13452#(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; {13452#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:28:12,051 INFO L290 TraceCheckUtils]: 10: Hoare triple {13452#(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; {13452#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:28:12,051 INFO L290 TraceCheckUtils]: 11: Hoare triple {13452#(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)))); {13452#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:28:12,051 INFO L290 TraceCheckUtils]: 12: Hoare triple {13452#(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); {13452#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:28:12,052 INFO L290 TraceCheckUtils]: 13: Hoare triple {13452#(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; {13452#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:28:12,052 INFO L290 TraceCheckUtils]: 14: Hoare triple {13452#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {13452#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:28:12,052 INFO L290 TraceCheckUtils]: 15: Hoare triple {13452#(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); {13452#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:28:12,053 INFO L290 TraceCheckUtils]: 16: Hoare triple {13452#(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); {13452#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:28:12,053 INFO L290 TraceCheckUtils]: 17: Hoare triple {13452#(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); {13452#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:28:12,053 INFO L290 TraceCheckUtils]: 18: Hoare triple {13452#(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); {13452#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:28:12,054 INFO L290 TraceCheckUtils]: 19: Hoare triple {13452#(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); {13452#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:28:12,054 INFO L290 TraceCheckUtils]: 20: Hoare triple {13452#(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); {13452#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:28:12,054 INFO L290 TraceCheckUtils]: 21: Hoare triple {13452#(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); {13452#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:28:12,055 INFO L290 TraceCheckUtils]: 22: Hoare triple {13452#(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); {13453#(not (= |ssl3_accept_#t~mem54| 8482))} is VALID [2022-04-27 15:28:12,055 INFO L290 TraceCheckUtils]: 23: Hoare triple {13453#(not (= |ssl3_accept_#t~mem54| 8482))} assume 8482 == #t~mem54;havoc #t~mem54; {13448#false} is VALID [2022-04-27 15:28:12,055 INFO L290 TraceCheckUtils]: 24: Hoare triple {13448#false} call write~int(3, ~s.base, 52 + ~s.offset, 4); {13448#false} is VALID [2022-04-27 15:28:12,055 INFO L290 TraceCheckUtils]: 25: Hoare triple {13448#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); {13448#false} is VALID [2022-04-27 15:28:12,055 INFO L290 TraceCheckUtils]: 26: Hoare triple {13448#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {13448#false} is VALID [2022-04-27 15:28:12,055 INFO L290 TraceCheckUtils]: 27: Hoare triple {13448#false} ~skip~0 := 0; {13448#false} is VALID [2022-04-27 15:28:12,055 INFO L290 TraceCheckUtils]: 28: Hoare triple {13448#false} assume !false; {13448#false} is VALID [2022-04-27 15:28:12,055 INFO L290 TraceCheckUtils]: 29: Hoare triple {13448#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); {13448#false} is VALID [2022-04-27 15:28:12,055 INFO L290 TraceCheckUtils]: 30: Hoare triple {13448#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {13448#false} is VALID [2022-04-27 15:28:12,055 INFO L290 TraceCheckUtils]: 31: Hoare triple {13448#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {13448#false} is VALID [2022-04-27 15:28:12,055 INFO L290 TraceCheckUtils]: 32: Hoare triple {13448#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {13448#false} is VALID [2022-04-27 15:28:12,055 INFO L290 TraceCheckUtils]: 33: Hoare triple {13448#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {13448#false} is VALID [2022-04-27 15:28:12,056 INFO L290 TraceCheckUtils]: 34: Hoare triple {13448#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {13448#false} is VALID [2022-04-27 15:28:12,056 INFO L290 TraceCheckUtils]: 35: Hoare triple {13448#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {13448#false} is VALID [2022-04-27 15:28:12,056 INFO L290 TraceCheckUtils]: 36: Hoare triple {13448#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {13448#false} is VALID [2022-04-27 15:28:12,056 INFO L290 TraceCheckUtils]: 37: Hoare triple {13448#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {13448#false} is VALID [2022-04-27 15:28:12,056 INFO L290 TraceCheckUtils]: 38: Hoare triple {13448#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {13448#false} is VALID [2022-04-27 15:28:12,056 INFO L290 TraceCheckUtils]: 39: Hoare triple {13448#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {13448#false} is VALID [2022-04-27 15:28:12,056 INFO L290 TraceCheckUtils]: 40: Hoare triple {13448#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {13448#false} is VALID [2022-04-27 15:28:12,056 INFO L290 TraceCheckUtils]: 41: Hoare triple {13448#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {13448#false} is VALID [2022-04-27 15:28:12,056 INFO L290 TraceCheckUtils]: 42: Hoare triple {13448#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {13448#false} is VALID [2022-04-27 15:28:12,056 INFO L290 TraceCheckUtils]: 43: Hoare triple {13448#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {13448#false} is VALID [2022-04-27 15:28:12,056 INFO L290 TraceCheckUtils]: 44: Hoare triple {13448#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {13448#false} is VALID [2022-04-27 15:28:12,056 INFO L290 TraceCheckUtils]: 45: Hoare triple {13448#false} assume 8528 == #t~mem62;havoc #t~mem62; {13448#false} is VALID [2022-04-27 15:28:12,056 INFO L290 TraceCheckUtils]: 46: Hoare triple {13448#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); {13448#false} is VALID [2022-04-27 15:28:12,056 INFO L290 TraceCheckUtils]: 47: Hoare triple {13448#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; {13448#false} is VALID [2022-04-27 15:28:12,056 INFO L290 TraceCheckUtils]: 48: Hoare triple {13448#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); {13448#false} is VALID [2022-04-27 15:28:12,056 INFO L290 TraceCheckUtils]: 49: Hoare triple {13448#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {13448#false} is VALID [2022-04-27 15:28:12,057 INFO L290 TraceCheckUtils]: 50: Hoare triple {13448#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {13448#false} is VALID [2022-04-27 15:28:12,057 INFO L290 TraceCheckUtils]: 51: Hoare triple {13448#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {13448#false} is VALID [2022-04-27 15:28:12,057 INFO L290 TraceCheckUtils]: 52: Hoare triple {13448#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {13448#false} is VALID [2022-04-27 15:28:12,057 INFO L290 TraceCheckUtils]: 53: Hoare triple {13448#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); {13448#false} is VALID [2022-04-27 15:28:12,057 INFO L290 TraceCheckUtils]: 54: Hoare triple {13448#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {13448#false} is VALID [2022-04-27 15:28:12,057 INFO L290 TraceCheckUtils]: 55: Hoare triple {13448#false} ~skip~0 := 0; {13448#false} is VALID [2022-04-27 15:28:12,057 INFO L290 TraceCheckUtils]: 56: Hoare triple {13448#false} assume !false; {13448#false} is VALID [2022-04-27 15:28:12,057 INFO L290 TraceCheckUtils]: 57: Hoare triple {13448#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); {13448#false} is VALID [2022-04-27 15:28:12,057 INFO L290 TraceCheckUtils]: 58: Hoare triple {13448#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {13448#false} is VALID [2022-04-27 15:28:12,057 INFO L290 TraceCheckUtils]: 59: Hoare triple {13448#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {13448#false} is VALID [2022-04-27 15:28:12,057 INFO L290 TraceCheckUtils]: 60: Hoare triple {13448#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {13448#false} is VALID [2022-04-27 15:28:12,057 INFO L290 TraceCheckUtils]: 61: Hoare triple {13448#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {13448#false} is VALID [2022-04-27 15:28:12,057 INFO L290 TraceCheckUtils]: 62: Hoare triple {13448#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {13448#false} is VALID [2022-04-27 15:28:12,057 INFO L290 TraceCheckUtils]: 63: Hoare triple {13448#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {13448#false} is VALID [2022-04-27 15:28:12,057 INFO L290 TraceCheckUtils]: 64: Hoare triple {13448#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {13448#false} is VALID [2022-04-27 15:28:12,057 INFO L290 TraceCheckUtils]: 65: Hoare triple {13448#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {13448#false} is VALID [2022-04-27 15:28:12,058 INFO L290 TraceCheckUtils]: 66: Hoare triple {13448#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {13448#false} is VALID [2022-04-27 15:28:12,058 INFO L290 TraceCheckUtils]: 67: Hoare triple {13448#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {13448#false} is VALID [2022-04-27 15:28:12,058 INFO L290 TraceCheckUtils]: 68: Hoare triple {13448#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {13448#false} is VALID [2022-04-27 15:28:12,058 INFO L290 TraceCheckUtils]: 69: Hoare triple {13448#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {13448#false} is VALID [2022-04-27 15:28:12,058 INFO L290 TraceCheckUtils]: 70: Hoare triple {13448#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {13448#false} is VALID [2022-04-27 15:28:12,058 INFO L290 TraceCheckUtils]: 71: Hoare triple {13448#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {13448#false} is VALID [2022-04-27 15:28:12,058 INFO L290 TraceCheckUtils]: 72: Hoare triple {13448#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {13448#false} is VALID [2022-04-27 15:28:12,058 INFO L290 TraceCheckUtils]: 73: Hoare triple {13448#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {13448#false} is VALID [2022-04-27 15:28:12,058 INFO L290 TraceCheckUtils]: 74: Hoare triple {13448#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {13448#false} is VALID [2022-04-27 15:28:12,058 INFO L290 TraceCheckUtils]: 75: Hoare triple {13448#false} assume 8544 == #t~mem64;havoc #t~mem64; {13448#false} is VALID [2022-04-27 15:28:12,058 INFO L290 TraceCheckUtils]: 76: Hoare triple {13448#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {13448#false} is VALID [2022-04-27 15:28:12,058 INFO L290 TraceCheckUtils]: 77: Hoare triple {13448#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); {13448#false} is VALID [2022-04-27 15:28:12,058 INFO L290 TraceCheckUtils]: 78: Hoare triple {13448#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {13448#false} is VALID [2022-04-27 15:28:12,058 INFO L290 TraceCheckUtils]: 79: Hoare triple {13448#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); {13448#false} is VALID [2022-04-27 15:28:12,058 INFO L290 TraceCheckUtils]: 80: Hoare triple {13448#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; {13448#false} is VALID [2022-04-27 15:28:12,058 INFO L290 TraceCheckUtils]: 81: Hoare triple {13448#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; {13448#false} is VALID [2022-04-27 15:28:12,059 INFO L290 TraceCheckUtils]: 82: Hoare triple {13448#false} assume 8 == ~blastFlag~0; {13448#false} is VALID [2022-04-27 15:28:12,059 INFO L290 TraceCheckUtils]: 83: Hoare triple {13448#false} assume !false; {13448#false} is VALID [2022-04-27 15:28:12,059 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-27 15:28:12,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:28:12,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204571682] [2022-04-27 15:28:12,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204571682] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:28:12,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:28:12,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:28:12,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143565062] [2022-04-27 15:28:12,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:28:12,060 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2022-04-27 15:28:12,060 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:28:12,060 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:12,106 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:28:12,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:28:12,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:28:12,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:28:12,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:28:12,107 INFO L87 Difference]: Start difference. First operand 261 states and 418 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:17,676 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:28:18,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:28:18,744 INFO L93 Difference]: Finished difference Result 571 states and 907 transitions. [2022-04-27 15:28:18,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:28:18,744 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2022-04-27 15:28:18,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:28:18,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:18,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 587 transitions. [2022-04-27 15:28:18,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:18,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 587 transitions. [2022-04-27 15:28:18,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 587 transitions. [2022-04-27 15:28:19,107 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 587 edges. 587 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:28:19,112 INFO L225 Difference]: With dead ends: 571 [2022-04-27 15:28:19,112 INFO L226 Difference]: Without dead ends: 336 [2022-04-27 15:28:19,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:28:19,113 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 137 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 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.8s IncrementalHoareTripleChecker+Time [2022-04-27 15:28:19,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 360 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-04-27 15:28:19,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2022-04-27 15:28:19,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 261. [2022-04-27 15:28:19,120 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:28:19,120 INFO L82 GeneralOperation]: Start isEquivalent. First operand 336 states. Second operand has 261 states, 256 states have (on average 1.6015625) internal successors, (410), 256 states have internal predecessors, (410), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:19,120 INFO L74 IsIncluded]: Start isIncluded. First operand 336 states. Second operand has 261 states, 256 states have (on average 1.6015625) internal successors, (410), 256 states have internal predecessors, (410), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:19,121 INFO L87 Difference]: Start difference. First operand 336 states. Second operand has 261 states, 256 states have (on average 1.6015625) internal successors, (410), 256 states have internal predecessors, (410), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:19,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:28:19,125 INFO L93 Difference]: Finished difference Result 336 states and 519 transitions. [2022-04-27 15:28:19,125 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 519 transitions. [2022-04-27 15:28:19,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:28:19,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:28:19,127 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 336 states. [2022-04-27 15:28:19,127 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 336 states. [2022-04-27 15:28:19,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:28:19,132 INFO L93 Difference]: Finished difference Result 336 states and 519 transitions. [2022-04-27 15:28:19,132 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 519 transitions. [2022-04-27 15:28:19,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:28:19,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:28:19,132 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:28:19,133 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:28:19,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 256 states have (on average 1.6015625) internal successors, (410), 256 states have internal predecessors, (410), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:19,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 414 transitions. [2022-04-27 15:28:19,136 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 414 transitions. Word has length 84 [2022-04-27 15:28:19,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:28:19,136 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 414 transitions. [2022-04-27 15:28:19,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:19,136 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 414 transitions. [2022-04-27 15:28:19,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-27 15:28:19,137 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:28:19,137 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:28:19,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-27 15:28:19,137 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:28:19,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:28:19,138 INFO L85 PathProgramCache]: Analyzing trace with hash -336623119, now seen corresponding path program 1 times [2022-04-27 15:28:19,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:28:19,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068376749] [2022-04-27 15:28:19,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:28:19,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:28:19,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:28:19,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:28:19,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:28:19,263 INFO L290 TraceCheckUtils]: 0: Hoare triple {15090#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {15083#true} is VALID [2022-04-27 15:28:19,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {15083#true} assume true; {15083#true} is VALID [2022-04-27 15:28:19,263 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15083#true} {15083#true} #689#return; {15083#true} is VALID [2022-04-27 15:28:19,264 INFO L272 TraceCheckUtils]: 0: Hoare triple {15083#true} call ULTIMATE.init(); {15090#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:28:19,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {15090#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {15083#true} is VALID [2022-04-27 15:28:19,264 INFO L290 TraceCheckUtils]: 2: Hoare triple {15083#true} assume true; {15083#true} is VALID [2022-04-27 15:28:19,264 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15083#true} {15083#true} #689#return; {15083#true} is VALID [2022-04-27 15:28:19,264 INFO L272 TraceCheckUtils]: 4: Hoare triple {15083#true} call #t~ret161 := main(); {15083#true} is VALID [2022-04-27 15:28:19,264 INFO L290 TraceCheckUtils]: 5: Hoare triple {15083#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; {15083#true} is VALID [2022-04-27 15:28:19,264 INFO L290 TraceCheckUtils]: 6: Hoare triple {15083#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {15083#true} is VALID [2022-04-27 15:28:19,264 INFO L272 TraceCheckUtils]: 7: Hoare triple {15083#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {15083#true} is VALID [2022-04-27 15:28:19,266 INFO L290 TraceCheckUtils]: 8: Hoare triple {15083#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); {15088#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:28:19,266 INFO L290 TraceCheckUtils]: 9: Hoare triple {15088#(= 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; {15088#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:28:19,267 INFO L290 TraceCheckUtils]: 10: Hoare triple {15088#(= 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; {15088#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:28:19,267 INFO L290 TraceCheckUtils]: 11: Hoare triple {15088#(= 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)))); {15088#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:28:19,268 INFO L290 TraceCheckUtils]: 12: Hoare triple {15088#(= 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); {15088#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:28:19,268 INFO L290 TraceCheckUtils]: 13: Hoare triple {15088#(= 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; {15088#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:28:19,268 INFO L290 TraceCheckUtils]: 14: Hoare triple {15088#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {15088#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:28:19,269 INFO L290 TraceCheckUtils]: 15: Hoare triple {15088#(= 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); {15088#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:28:19,269 INFO L290 TraceCheckUtils]: 16: Hoare triple {15088#(= 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); {15088#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:28:19,269 INFO L290 TraceCheckUtils]: 17: Hoare triple {15088#(= 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); {15089#(= 8464 |ssl3_accept_#t~mem49|)} is VALID [2022-04-27 15:28:19,270 INFO L290 TraceCheckUtils]: 18: Hoare triple {15089#(= 8464 |ssl3_accept_#t~mem49|)} assume 8192 == #t~mem49;havoc #t~mem49; {15084#false} is VALID [2022-04-27 15:28:19,270 INFO L290 TraceCheckUtils]: 19: Hoare triple {15084#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {15084#false} is VALID [2022-04-27 15:28:19,270 INFO L290 TraceCheckUtils]: 20: Hoare triple {15084#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {15084#false} is VALID [2022-04-27 15:28:19,270 INFO L290 TraceCheckUtils]: 21: Hoare triple {15084#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {15084#false} is VALID [2022-04-27 15:28:19,270 INFO L290 TraceCheckUtils]: 22: Hoare triple {15084#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); {15084#false} is VALID [2022-04-27 15:28:19,270 INFO L290 TraceCheckUtils]: 23: Hoare triple {15084#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {15084#false} is VALID [2022-04-27 15:28:19,270 INFO L290 TraceCheckUtils]: 24: Hoare triple {15084#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); {15084#false} is VALID [2022-04-27 15:28:19,270 INFO L290 TraceCheckUtils]: 25: Hoare triple {15084#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); {15084#false} is VALID [2022-04-27 15:28:19,270 INFO L290 TraceCheckUtils]: 26: Hoare triple {15084#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); {15084#false} is VALID [2022-04-27 15:28:19,270 INFO L290 TraceCheckUtils]: 27: Hoare triple {15084#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {15084#false} is VALID [2022-04-27 15:28:19,270 INFO L290 TraceCheckUtils]: 28: Hoare triple {15084#false} ~skip~0 := 0; {15084#false} is VALID [2022-04-27 15:28:19,270 INFO L290 TraceCheckUtils]: 29: Hoare triple {15084#false} assume !false; {15084#false} is VALID [2022-04-27 15:28:19,271 INFO L290 TraceCheckUtils]: 30: Hoare triple {15084#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); {15084#false} is VALID [2022-04-27 15:28:19,271 INFO L290 TraceCheckUtils]: 31: Hoare triple {15084#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {15084#false} is VALID [2022-04-27 15:28:19,271 INFO L290 TraceCheckUtils]: 32: Hoare triple {15084#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15084#false} is VALID [2022-04-27 15:28:19,271 INFO L290 TraceCheckUtils]: 33: Hoare triple {15084#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15084#false} is VALID [2022-04-27 15:28:19,271 INFO L290 TraceCheckUtils]: 34: Hoare triple {15084#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {15084#false} is VALID [2022-04-27 15:28:19,271 INFO L290 TraceCheckUtils]: 35: Hoare triple {15084#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {15084#false} is VALID [2022-04-27 15:28:19,271 INFO L290 TraceCheckUtils]: 36: Hoare triple {15084#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {15084#false} is VALID [2022-04-27 15:28:19,271 INFO L290 TraceCheckUtils]: 37: Hoare triple {15084#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {15084#false} is VALID [2022-04-27 15:28:19,271 INFO L290 TraceCheckUtils]: 38: Hoare triple {15084#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {15084#false} is VALID [2022-04-27 15:28:19,271 INFO L290 TraceCheckUtils]: 39: Hoare triple {15084#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {15084#false} is VALID [2022-04-27 15:28:19,271 INFO L290 TraceCheckUtils]: 40: Hoare triple {15084#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {15084#false} is VALID [2022-04-27 15:28:19,271 INFO L290 TraceCheckUtils]: 41: Hoare triple {15084#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {15084#false} is VALID [2022-04-27 15:28:19,271 INFO L290 TraceCheckUtils]: 42: Hoare triple {15084#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {15084#false} is VALID [2022-04-27 15:28:19,271 INFO L290 TraceCheckUtils]: 43: Hoare triple {15084#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {15084#false} is VALID [2022-04-27 15:28:19,271 INFO L290 TraceCheckUtils]: 44: Hoare triple {15084#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {15084#false} is VALID [2022-04-27 15:28:19,271 INFO L290 TraceCheckUtils]: 45: Hoare triple {15084#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {15084#false} is VALID [2022-04-27 15:28:19,272 INFO L290 TraceCheckUtils]: 46: Hoare triple {15084#false} assume 8528 == #t~mem62;havoc #t~mem62; {15084#false} is VALID [2022-04-27 15:28:19,272 INFO L290 TraceCheckUtils]: 47: Hoare triple {15084#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); {15084#false} is VALID [2022-04-27 15:28:19,272 INFO L290 TraceCheckUtils]: 48: Hoare triple {15084#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; {15084#false} is VALID [2022-04-27 15:28:19,272 INFO L290 TraceCheckUtils]: 49: Hoare triple {15084#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); {15084#false} is VALID [2022-04-27 15:28:19,272 INFO L290 TraceCheckUtils]: 50: Hoare triple {15084#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {15084#false} is VALID [2022-04-27 15:28:19,272 INFO L290 TraceCheckUtils]: 51: Hoare triple {15084#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {15084#false} is VALID [2022-04-27 15:28:19,272 INFO L290 TraceCheckUtils]: 52: Hoare triple {15084#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {15084#false} is VALID [2022-04-27 15:28:19,272 INFO L290 TraceCheckUtils]: 53: Hoare triple {15084#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {15084#false} is VALID [2022-04-27 15:28:19,272 INFO L290 TraceCheckUtils]: 54: Hoare triple {15084#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); {15084#false} is VALID [2022-04-27 15:28:19,272 INFO L290 TraceCheckUtils]: 55: Hoare triple {15084#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {15084#false} is VALID [2022-04-27 15:28:19,272 INFO L290 TraceCheckUtils]: 56: Hoare triple {15084#false} ~skip~0 := 0; {15084#false} is VALID [2022-04-27 15:28:19,272 INFO L290 TraceCheckUtils]: 57: Hoare triple {15084#false} assume !false; {15084#false} is VALID [2022-04-27 15:28:19,272 INFO L290 TraceCheckUtils]: 58: Hoare triple {15084#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); {15084#false} is VALID [2022-04-27 15:28:19,272 INFO L290 TraceCheckUtils]: 59: Hoare triple {15084#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {15084#false} is VALID [2022-04-27 15:28:19,272 INFO L290 TraceCheckUtils]: 60: Hoare triple {15084#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15084#false} is VALID [2022-04-27 15:28:19,272 INFO L290 TraceCheckUtils]: 61: Hoare triple {15084#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15084#false} is VALID [2022-04-27 15:28:19,273 INFO L290 TraceCheckUtils]: 62: Hoare triple {15084#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {15084#false} is VALID [2022-04-27 15:28:19,273 INFO L290 TraceCheckUtils]: 63: Hoare triple {15084#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {15084#false} is VALID [2022-04-27 15:28:19,273 INFO L290 TraceCheckUtils]: 64: Hoare triple {15084#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {15084#false} is VALID [2022-04-27 15:28:19,273 INFO L290 TraceCheckUtils]: 65: Hoare triple {15084#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {15084#false} is VALID [2022-04-27 15:28:19,273 INFO L290 TraceCheckUtils]: 66: Hoare triple {15084#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {15084#false} is VALID [2022-04-27 15:28:19,273 INFO L290 TraceCheckUtils]: 67: Hoare triple {15084#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {15084#false} is VALID [2022-04-27 15:28:19,273 INFO L290 TraceCheckUtils]: 68: Hoare triple {15084#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {15084#false} is VALID [2022-04-27 15:28:19,273 INFO L290 TraceCheckUtils]: 69: Hoare triple {15084#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {15084#false} is VALID [2022-04-27 15:28:19,273 INFO L290 TraceCheckUtils]: 70: Hoare triple {15084#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {15084#false} is VALID [2022-04-27 15:28:19,273 INFO L290 TraceCheckUtils]: 71: Hoare triple {15084#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {15084#false} is VALID [2022-04-27 15:28:19,273 INFO L290 TraceCheckUtils]: 72: Hoare triple {15084#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {15084#false} is VALID [2022-04-27 15:28:19,273 INFO L290 TraceCheckUtils]: 73: Hoare triple {15084#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {15084#false} is VALID [2022-04-27 15:28:19,273 INFO L290 TraceCheckUtils]: 74: Hoare triple {15084#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {15084#false} is VALID [2022-04-27 15:28:19,273 INFO L290 TraceCheckUtils]: 75: Hoare triple {15084#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {15084#false} is VALID [2022-04-27 15:28:19,273 INFO L290 TraceCheckUtils]: 76: Hoare triple {15084#false} assume 8544 == #t~mem64;havoc #t~mem64; {15084#false} is VALID [2022-04-27 15:28:19,273 INFO L290 TraceCheckUtils]: 77: Hoare triple {15084#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {15084#false} is VALID [2022-04-27 15:28:19,274 INFO L290 TraceCheckUtils]: 78: Hoare triple {15084#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); {15084#false} is VALID [2022-04-27 15:28:19,274 INFO L290 TraceCheckUtils]: 79: Hoare triple {15084#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {15084#false} is VALID [2022-04-27 15:28:19,274 INFO L290 TraceCheckUtils]: 80: Hoare triple {15084#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); {15084#false} is VALID [2022-04-27 15:28:19,274 INFO L290 TraceCheckUtils]: 81: Hoare triple {15084#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; {15084#false} is VALID [2022-04-27 15:28:19,274 INFO L290 TraceCheckUtils]: 82: Hoare triple {15084#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; {15084#false} is VALID [2022-04-27 15:28:19,274 INFO L290 TraceCheckUtils]: 83: Hoare triple {15084#false} assume 8 == ~blastFlag~0; {15084#false} is VALID [2022-04-27 15:28:19,274 INFO L290 TraceCheckUtils]: 84: Hoare triple {15084#false} assume !false; {15084#false} is VALID [2022-04-27 15:28:19,274 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-27 15:28:19,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:28:19,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068376749] [2022-04-27 15:28:19,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068376749] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:28:19,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:28:19,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:28:19,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749071201] [2022-04-27 15:28:19,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:28:19,275 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2022-04-27 15:28:19,275 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:28:19,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:19,327 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:28:19,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:28:19,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:28:19,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:28:19,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:28:19,328 INFO L87 Difference]: Start difference. First operand 261 states and 414 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:25,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:28:25,145 INFO L93 Difference]: Finished difference Result 509 states and 812 transitions. [2022-04-27 15:28:25,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:28:25,146 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2022-04-27 15:28:25,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:28:25,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:25,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-27 15:28:25,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:25,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-27 15:28:25,149 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 442 transitions. [2022-04-27 15:28:25,430 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 442 edges. 442 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:28:25,434 INFO L225 Difference]: With dead ends: 509 [2022-04-27 15:28:25,434 INFO L226 Difference]: Without dead ends: 274 [2022-04-27 15:28:25,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:28:25,434 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 22 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s 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.9s IncrementalHoareTripleChecker+Time [2022-04-27 15:28:25,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 491 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-27 15:28:25,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2022-04-27 15:28:25,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 261. [2022-04-27 15:28:25,438 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:28:25,438 INFO L82 GeneralOperation]: Start isEquivalent. First operand 274 states. Second operand has 261 states, 256 states have (on average 1.59765625) internal successors, (409), 256 states have internal predecessors, (409), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:25,439 INFO L74 IsIncluded]: Start isIncluded. First operand 274 states. Second operand has 261 states, 256 states have (on average 1.59765625) internal successors, (409), 256 states have internal predecessors, (409), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:25,440 INFO L87 Difference]: Start difference. First operand 274 states. Second operand has 261 states, 256 states have (on average 1.59765625) internal successors, (409), 256 states have internal predecessors, (409), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:25,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:28:25,444 INFO L93 Difference]: Finished difference Result 274 states and 430 transitions. [2022-04-27 15:28:25,444 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 430 transitions. [2022-04-27 15:28:25,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:28:25,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:28:25,445 INFO L74 IsIncluded]: Start isIncluded. First operand has 261 states, 256 states have (on average 1.59765625) internal successors, (409), 256 states have internal predecessors, (409), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 274 states. [2022-04-27 15:28:25,445 INFO L87 Difference]: Start difference. First operand has 261 states, 256 states have (on average 1.59765625) internal successors, (409), 256 states have internal predecessors, (409), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 274 states. [2022-04-27 15:28:25,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:28:25,449 INFO L93 Difference]: Finished difference Result 274 states and 430 transitions. [2022-04-27 15:28:25,449 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 430 transitions. [2022-04-27 15:28:25,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:28:25,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:28:25,449 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:28:25,449 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:28:25,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 256 states have (on average 1.59765625) internal successors, (409), 256 states have internal predecessors, (409), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:25,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 413 transitions. [2022-04-27 15:28:25,453 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 413 transitions. Word has length 85 [2022-04-27 15:28:25,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:28:25,453 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 413 transitions. [2022-04-27 15:28:25,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:25,453 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 413 transitions. [2022-04-27 15:28:25,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-27 15:28:25,454 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:28:25,454 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:28:25,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-27 15:28:25,454 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:28:25,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:28:25,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1658086991, now seen corresponding path program 1 times [2022-04-27 15:28:25,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:28:25,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242433851] [2022-04-27 15:28:25,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:28:25,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:28:25,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:28:25,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:28:25,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:28:25,558 INFO L290 TraceCheckUtils]: 0: Hoare triple {16523#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {16516#true} is VALID [2022-04-27 15:28:25,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {16516#true} assume true; {16516#true} is VALID [2022-04-27 15:28:25,558 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16516#true} {16516#true} #689#return; {16516#true} is VALID [2022-04-27 15:28:25,559 INFO L272 TraceCheckUtils]: 0: Hoare triple {16516#true} call ULTIMATE.init(); {16523#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:28:25,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {16523#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {16516#true} is VALID [2022-04-27 15:28:25,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {16516#true} assume true; {16516#true} is VALID [2022-04-27 15:28:25,559 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16516#true} {16516#true} #689#return; {16516#true} is VALID [2022-04-27 15:28:25,559 INFO L272 TraceCheckUtils]: 4: Hoare triple {16516#true} call #t~ret161 := main(); {16516#true} is VALID [2022-04-27 15:28:25,559 INFO L290 TraceCheckUtils]: 5: Hoare triple {16516#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; {16516#true} is VALID [2022-04-27 15:28:25,559 INFO L290 TraceCheckUtils]: 6: Hoare triple {16516#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {16516#true} is VALID [2022-04-27 15:28:25,559 INFO L272 TraceCheckUtils]: 7: Hoare triple {16516#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {16516#true} is VALID [2022-04-27 15:28:25,561 INFO L290 TraceCheckUtils]: 8: Hoare triple {16516#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); {16521#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:28:25,561 INFO L290 TraceCheckUtils]: 9: Hoare triple {16521#(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; {16521#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:28:25,562 INFO L290 TraceCheckUtils]: 10: Hoare triple {16521#(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; {16521#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:28:25,562 INFO L290 TraceCheckUtils]: 11: Hoare triple {16521#(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)))); {16521#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:28:25,563 INFO L290 TraceCheckUtils]: 12: Hoare triple {16521#(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); {16521#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:28:25,563 INFO L290 TraceCheckUtils]: 13: Hoare triple {16521#(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; {16521#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:28:25,563 INFO L290 TraceCheckUtils]: 14: Hoare triple {16521#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {16521#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:28:25,564 INFO L290 TraceCheckUtils]: 15: Hoare triple {16521#(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); {16521#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:28:25,564 INFO L290 TraceCheckUtils]: 16: Hoare triple {16521#(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); {16521#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:28:25,564 INFO L290 TraceCheckUtils]: 17: Hoare triple {16521#(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); {16521#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:28:25,565 INFO L290 TraceCheckUtils]: 18: Hoare triple {16521#(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); {16522#(not (= 24576 |ssl3_accept_#t~mem50|))} is VALID [2022-04-27 15:28:25,565 INFO L290 TraceCheckUtils]: 19: Hoare triple {16522#(not (= 24576 |ssl3_accept_#t~mem50|))} assume 24576 == #t~mem50;havoc #t~mem50; {16517#false} is VALID [2022-04-27 15:28:25,565 INFO L290 TraceCheckUtils]: 20: Hoare triple {16517#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {16517#false} is VALID [2022-04-27 15:28:25,571 INFO L290 TraceCheckUtils]: 21: Hoare triple {16517#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {16517#false} is VALID [2022-04-27 15:28:25,571 INFO L290 TraceCheckUtils]: 22: Hoare triple {16517#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {16517#false} is VALID [2022-04-27 15:28:25,571 INFO L290 TraceCheckUtils]: 23: Hoare triple {16517#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); {16517#false} is VALID [2022-04-27 15:28:25,571 INFO L290 TraceCheckUtils]: 24: Hoare triple {16517#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {16517#false} is VALID [2022-04-27 15:28:25,571 INFO L290 TraceCheckUtils]: 25: Hoare triple {16517#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); {16517#false} is VALID [2022-04-27 15:28:25,571 INFO L290 TraceCheckUtils]: 26: Hoare triple {16517#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); {16517#false} is VALID [2022-04-27 15:28:25,571 INFO L290 TraceCheckUtils]: 27: Hoare triple {16517#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); {16517#false} is VALID [2022-04-27 15:28:25,572 INFO L290 TraceCheckUtils]: 28: Hoare triple {16517#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {16517#false} is VALID [2022-04-27 15:28:25,572 INFO L290 TraceCheckUtils]: 29: Hoare triple {16517#false} ~skip~0 := 0; {16517#false} is VALID [2022-04-27 15:28:25,572 INFO L290 TraceCheckUtils]: 30: Hoare triple {16517#false} assume !false; {16517#false} is VALID [2022-04-27 15:28:25,572 INFO L290 TraceCheckUtils]: 31: Hoare triple {16517#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); {16517#false} is VALID [2022-04-27 15:28:25,572 INFO L290 TraceCheckUtils]: 32: Hoare triple {16517#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {16517#false} is VALID [2022-04-27 15:28:25,572 INFO L290 TraceCheckUtils]: 33: Hoare triple {16517#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {16517#false} is VALID [2022-04-27 15:28:25,572 INFO L290 TraceCheckUtils]: 34: Hoare triple {16517#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {16517#false} is VALID [2022-04-27 15:28:25,572 INFO L290 TraceCheckUtils]: 35: Hoare triple {16517#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {16517#false} is VALID [2022-04-27 15:28:25,572 INFO L290 TraceCheckUtils]: 36: Hoare triple {16517#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {16517#false} is VALID [2022-04-27 15:28:25,572 INFO L290 TraceCheckUtils]: 37: Hoare triple {16517#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {16517#false} is VALID [2022-04-27 15:28:25,572 INFO L290 TraceCheckUtils]: 38: Hoare triple {16517#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {16517#false} is VALID [2022-04-27 15:28:25,572 INFO L290 TraceCheckUtils]: 39: Hoare triple {16517#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {16517#false} is VALID [2022-04-27 15:28:25,572 INFO L290 TraceCheckUtils]: 40: Hoare triple {16517#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {16517#false} is VALID [2022-04-27 15:28:25,572 INFO L290 TraceCheckUtils]: 41: Hoare triple {16517#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {16517#false} is VALID [2022-04-27 15:28:25,572 INFO L290 TraceCheckUtils]: 42: Hoare triple {16517#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {16517#false} is VALID [2022-04-27 15:28:25,572 INFO L290 TraceCheckUtils]: 43: Hoare triple {16517#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {16517#false} is VALID [2022-04-27 15:28:25,573 INFO L290 TraceCheckUtils]: 44: Hoare triple {16517#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {16517#false} is VALID [2022-04-27 15:28:25,573 INFO L290 TraceCheckUtils]: 45: Hoare triple {16517#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {16517#false} is VALID [2022-04-27 15:28:25,573 INFO L290 TraceCheckUtils]: 46: Hoare triple {16517#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {16517#false} is VALID [2022-04-27 15:28:25,573 INFO L290 TraceCheckUtils]: 47: Hoare triple {16517#false} assume 8528 == #t~mem62;havoc #t~mem62; {16517#false} is VALID [2022-04-27 15:28:25,573 INFO L290 TraceCheckUtils]: 48: Hoare triple {16517#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); {16517#false} is VALID [2022-04-27 15:28:25,573 INFO L290 TraceCheckUtils]: 49: Hoare triple {16517#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; {16517#false} is VALID [2022-04-27 15:28:25,573 INFO L290 TraceCheckUtils]: 50: Hoare triple {16517#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); {16517#false} is VALID [2022-04-27 15:28:25,573 INFO L290 TraceCheckUtils]: 51: Hoare triple {16517#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {16517#false} is VALID [2022-04-27 15:28:25,573 INFO L290 TraceCheckUtils]: 52: Hoare triple {16517#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {16517#false} is VALID [2022-04-27 15:28:25,573 INFO L290 TraceCheckUtils]: 53: Hoare triple {16517#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {16517#false} is VALID [2022-04-27 15:28:25,573 INFO L290 TraceCheckUtils]: 54: Hoare triple {16517#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {16517#false} is VALID [2022-04-27 15:28:25,573 INFO L290 TraceCheckUtils]: 55: Hoare triple {16517#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); {16517#false} is VALID [2022-04-27 15:28:25,573 INFO L290 TraceCheckUtils]: 56: Hoare triple {16517#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {16517#false} is VALID [2022-04-27 15:28:25,573 INFO L290 TraceCheckUtils]: 57: Hoare triple {16517#false} ~skip~0 := 0; {16517#false} is VALID [2022-04-27 15:28:25,573 INFO L290 TraceCheckUtils]: 58: Hoare triple {16517#false} assume !false; {16517#false} is VALID [2022-04-27 15:28:25,573 INFO L290 TraceCheckUtils]: 59: Hoare triple {16517#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); {16517#false} is VALID [2022-04-27 15:28:25,574 INFO L290 TraceCheckUtils]: 60: Hoare triple {16517#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {16517#false} is VALID [2022-04-27 15:28:25,574 INFO L290 TraceCheckUtils]: 61: Hoare triple {16517#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {16517#false} is VALID [2022-04-27 15:28:25,574 INFO L290 TraceCheckUtils]: 62: Hoare triple {16517#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {16517#false} is VALID [2022-04-27 15:28:25,574 INFO L290 TraceCheckUtils]: 63: Hoare triple {16517#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {16517#false} is VALID [2022-04-27 15:28:25,574 INFO L290 TraceCheckUtils]: 64: Hoare triple {16517#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {16517#false} is VALID [2022-04-27 15:28:25,574 INFO L290 TraceCheckUtils]: 65: Hoare triple {16517#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {16517#false} is VALID [2022-04-27 15:28:25,574 INFO L290 TraceCheckUtils]: 66: Hoare triple {16517#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {16517#false} is VALID [2022-04-27 15:28:25,574 INFO L290 TraceCheckUtils]: 67: Hoare triple {16517#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {16517#false} is VALID [2022-04-27 15:28:25,574 INFO L290 TraceCheckUtils]: 68: Hoare triple {16517#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {16517#false} is VALID [2022-04-27 15:28:25,574 INFO L290 TraceCheckUtils]: 69: Hoare triple {16517#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {16517#false} is VALID [2022-04-27 15:28:25,574 INFO L290 TraceCheckUtils]: 70: Hoare triple {16517#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {16517#false} is VALID [2022-04-27 15:28:25,574 INFO L290 TraceCheckUtils]: 71: Hoare triple {16517#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {16517#false} is VALID [2022-04-27 15:28:25,574 INFO L290 TraceCheckUtils]: 72: Hoare triple {16517#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {16517#false} is VALID [2022-04-27 15:28:25,574 INFO L290 TraceCheckUtils]: 73: Hoare triple {16517#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {16517#false} is VALID [2022-04-27 15:28:25,574 INFO L290 TraceCheckUtils]: 74: Hoare triple {16517#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {16517#false} is VALID [2022-04-27 15:28:25,574 INFO L290 TraceCheckUtils]: 75: Hoare triple {16517#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {16517#false} is VALID [2022-04-27 15:28:25,574 INFO L290 TraceCheckUtils]: 76: Hoare triple {16517#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {16517#false} is VALID [2022-04-27 15:28:25,575 INFO L290 TraceCheckUtils]: 77: Hoare triple {16517#false} assume 8544 == #t~mem64;havoc #t~mem64; {16517#false} is VALID [2022-04-27 15:28:25,575 INFO L290 TraceCheckUtils]: 78: Hoare triple {16517#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {16517#false} is VALID [2022-04-27 15:28:25,575 INFO L290 TraceCheckUtils]: 79: Hoare triple {16517#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); {16517#false} is VALID [2022-04-27 15:28:25,575 INFO L290 TraceCheckUtils]: 80: Hoare triple {16517#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {16517#false} is VALID [2022-04-27 15:28:25,575 INFO L290 TraceCheckUtils]: 81: Hoare triple {16517#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); {16517#false} is VALID [2022-04-27 15:28:25,575 INFO L290 TraceCheckUtils]: 82: Hoare triple {16517#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; {16517#false} is VALID [2022-04-27 15:28:25,575 INFO L290 TraceCheckUtils]: 83: Hoare triple {16517#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; {16517#false} is VALID [2022-04-27 15:28:25,575 INFO L290 TraceCheckUtils]: 84: Hoare triple {16517#false} assume 8 == ~blastFlag~0; {16517#false} is VALID [2022-04-27 15:28:25,575 INFO L290 TraceCheckUtils]: 85: Hoare triple {16517#false} assume !false; {16517#false} is VALID [2022-04-27 15:28:25,575 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-27 15:28:25,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:28:25,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242433851] [2022-04-27 15:28:25,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242433851] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:28:25,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:28:25,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:28:25,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506204429] [2022-04-27 15:28:25,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:28:25,576 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2022-04-27 15:28:25,576 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:28:25,576 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:25,626 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:28:25,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:28:25,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:28:25,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:28:25,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:28:25,627 INFO L87 Difference]: Start difference. First operand 261 states and 413 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:32,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:28:32,505 INFO L93 Difference]: Finished difference Result 571 states and 899 transitions. [2022-04-27 15:28:32,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:28:32,505 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2022-04-27 15:28:32,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:28:32,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:32,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 586 transitions. [2022-04-27 15:28:32,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:32,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 586 transitions. [2022-04-27 15:28:32,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 586 transitions. [2022-04-27 15:28:32,911 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 586 edges. 586 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:28:32,915 INFO L225 Difference]: With dead ends: 571 [2022-04-27 15:28:32,916 INFO L226 Difference]: Without dead ends: 336 [2022-04-27 15:28:32,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:28:32,916 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 140 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 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.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:28:32,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 360 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-04-27 15:28:32,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2022-04-27 15:28:32,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 261. [2022-04-27 15:28:32,920 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:28:32,921 INFO L82 GeneralOperation]: Start isEquivalent. First operand 336 states. Second operand has 261 states, 256 states have (on average 1.58203125) internal successors, (405), 256 states have internal predecessors, (405), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:32,921 INFO L74 IsIncluded]: Start isIncluded. First operand 336 states. Second operand has 261 states, 256 states have (on average 1.58203125) internal successors, (405), 256 states have internal predecessors, (405), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:32,921 INFO L87 Difference]: Start difference. First operand 336 states. Second operand has 261 states, 256 states have (on average 1.58203125) internal successors, (405), 256 states have internal predecessors, (405), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:32,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:28:32,926 INFO L93 Difference]: Finished difference Result 336 states and 514 transitions. [2022-04-27 15:28:32,926 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 514 transitions. [2022-04-27 15:28:32,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:28:32,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:28:32,926 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 336 states. [2022-04-27 15:28:32,927 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 336 states. [2022-04-27 15:28:32,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:28:32,931 INFO L93 Difference]: Finished difference Result 336 states and 514 transitions. [2022-04-27 15:28:32,931 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 514 transitions. [2022-04-27 15:28:32,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:28:32,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:28:32,931 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:28:32,931 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:28:32,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 256 states have (on average 1.58203125) internal successors, (405), 256 states have internal predecessors, (405), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:32,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 409 transitions. [2022-04-27 15:28:32,935 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 409 transitions. Word has length 86 [2022-04-27 15:28:32,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:28:32,935 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 409 transitions. [2022-04-27 15:28:32,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:32,935 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 409 transitions. [2022-04-27 15:28:32,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-27 15:28:32,936 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:28:32,936 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:28:32,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-27 15:28:32,936 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:28:32,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:28:32,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1580788918, now seen corresponding path program 1 times [2022-04-27 15:28:32,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:28:32,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155089214] [2022-04-27 15:28:32,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:28:32,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:28:33,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:28:33,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:28:33,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:28:33,057 INFO L290 TraceCheckUtils]: 0: Hoare triple {18159#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {18152#true} is VALID [2022-04-27 15:28:33,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {18152#true} assume true; {18152#true} is VALID [2022-04-27 15:28:33,057 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18152#true} {18152#true} #689#return; {18152#true} is VALID [2022-04-27 15:28:33,058 INFO L272 TraceCheckUtils]: 0: Hoare triple {18152#true} call ULTIMATE.init(); {18159#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:28:33,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {18159#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {18152#true} is VALID [2022-04-27 15:28:33,058 INFO L290 TraceCheckUtils]: 2: Hoare triple {18152#true} assume true; {18152#true} is VALID [2022-04-27 15:28:33,058 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18152#true} {18152#true} #689#return; {18152#true} is VALID [2022-04-27 15:28:33,058 INFO L272 TraceCheckUtils]: 4: Hoare triple {18152#true} call #t~ret161 := main(); {18152#true} is VALID [2022-04-27 15:28:33,058 INFO L290 TraceCheckUtils]: 5: Hoare triple {18152#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; {18152#true} is VALID [2022-04-27 15:28:33,058 INFO L290 TraceCheckUtils]: 6: Hoare triple {18152#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {18152#true} is VALID [2022-04-27 15:28:33,058 INFO L272 TraceCheckUtils]: 7: Hoare triple {18152#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {18152#true} is VALID [2022-04-27 15:28:33,060 INFO L290 TraceCheckUtils]: 8: Hoare triple {18152#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); {18157#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:28:33,060 INFO L290 TraceCheckUtils]: 9: Hoare triple {18157#(= 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; {18157#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:28:33,061 INFO L290 TraceCheckUtils]: 10: Hoare triple {18157#(= 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; {18157#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:28:33,061 INFO L290 TraceCheckUtils]: 11: Hoare triple {18157#(= 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)))); {18157#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:28:33,062 INFO L290 TraceCheckUtils]: 12: Hoare triple {18157#(= 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); {18157#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:28:33,062 INFO L290 TraceCheckUtils]: 13: Hoare triple {18157#(= 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; {18157#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:28:33,062 INFO L290 TraceCheckUtils]: 14: Hoare triple {18157#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {18157#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:28:33,063 INFO L290 TraceCheckUtils]: 15: Hoare triple {18157#(= 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); {18157#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:28:33,063 INFO L290 TraceCheckUtils]: 16: Hoare triple {18157#(= 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); {18157#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:28:33,063 INFO L290 TraceCheckUtils]: 17: Hoare triple {18157#(= 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); {18157#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:28:33,064 INFO L290 TraceCheckUtils]: 18: Hoare triple {18157#(= 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); {18157#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:28:33,064 INFO L290 TraceCheckUtils]: 19: Hoare triple {18157#(= 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); {18158#(= 8464 |ssl3_accept_#t~mem51|)} is VALID [2022-04-27 15:28:33,064 INFO L290 TraceCheckUtils]: 20: Hoare triple {18158#(= 8464 |ssl3_accept_#t~mem51|)} assume 8195 == #t~mem51;havoc #t~mem51; {18153#false} is VALID [2022-04-27 15:28:33,065 INFO L290 TraceCheckUtils]: 21: Hoare triple {18153#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {18153#false} is VALID [2022-04-27 15:28:33,065 INFO L290 TraceCheckUtils]: 22: Hoare triple {18153#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {18153#false} is VALID [2022-04-27 15:28:33,065 INFO L290 TraceCheckUtils]: 23: Hoare triple {18153#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {18153#false} is VALID [2022-04-27 15:28:33,065 INFO L290 TraceCheckUtils]: 24: Hoare triple {18153#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); {18153#false} is VALID [2022-04-27 15:28:33,065 INFO L290 TraceCheckUtils]: 25: Hoare triple {18153#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {18153#false} is VALID [2022-04-27 15:28:33,065 INFO L290 TraceCheckUtils]: 26: Hoare triple {18153#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); {18153#false} is VALID [2022-04-27 15:28:33,065 INFO L290 TraceCheckUtils]: 27: Hoare triple {18153#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); {18153#false} is VALID [2022-04-27 15:28:33,065 INFO L290 TraceCheckUtils]: 28: Hoare triple {18153#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); {18153#false} is VALID [2022-04-27 15:28:33,065 INFO L290 TraceCheckUtils]: 29: Hoare triple {18153#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {18153#false} is VALID [2022-04-27 15:28:33,065 INFO L290 TraceCheckUtils]: 30: Hoare triple {18153#false} ~skip~0 := 0; {18153#false} is VALID [2022-04-27 15:28:33,065 INFO L290 TraceCheckUtils]: 31: Hoare triple {18153#false} assume !false; {18153#false} is VALID [2022-04-27 15:28:33,065 INFO L290 TraceCheckUtils]: 32: Hoare triple {18153#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); {18153#false} is VALID [2022-04-27 15:28:33,065 INFO L290 TraceCheckUtils]: 33: Hoare triple {18153#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {18153#false} is VALID [2022-04-27 15:28:33,065 INFO L290 TraceCheckUtils]: 34: Hoare triple {18153#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {18153#false} is VALID [2022-04-27 15:28:33,065 INFO L290 TraceCheckUtils]: 35: Hoare triple {18153#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {18153#false} is VALID [2022-04-27 15:28:33,066 INFO L290 TraceCheckUtils]: 36: Hoare triple {18153#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {18153#false} is VALID [2022-04-27 15:28:33,066 INFO L290 TraceCheckUtils]: 37: Hoare triple {18153#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {18153#false} is VALID [2022-04-27 15:28:33,066 INFO L290 TraceCheckUtils]: 38: Hoare triple {18153#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {18153#false} is VALID [2022-04-27 15:28:33,066 INFO L290 TraceCheckUtils]: 39: Hoare triple {18153#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {18153#false} is VALID [2022-04-27 15:28:33,066 INFO L290 TraceCheckUtils]: 40: Hoare triple {18153#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {18153#false} is VALID [2022-04-27 15:28:33,066 INFO L290 TraceCheckUtils]: 41: Hoare triple {18153#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {18153#false} is VALID [2022-04-27 15:28:33,066 INFO L290 TraceCheckUtils]: 42: Hoare triple {18153#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {18153#false} is VALID [2022-04-27 15:28:33,066 INFO L290 TraceCheckUtils]: 43: Hoare triple {18153#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {18153#false} is VALID [2022-04-27 15:28:33,066 INFO L290 TraceCheckUtils]: 44: Hoare triple {18153#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {18153#false} is VALID [2022-04-27 15:28:33,066 INFO L290 TraceCheckUtils]: 45: Hoare triple {18153#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {18153#false} is VALID [2022-04-27 15:28:33,066 INFO L290 TraceCheckUtils]: 46: Hoare triple {18153#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {18153#false} is VALID [2022-04-27 15:28:33,066 INFO L290 TraceCheckUtils]: 47: Hoare triple {18153#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {18153#false} is VALID [2022-04-27 15:28:33,066 INFO L290 TraceCheckUtils]: 48: Hoare triple {18153#false} assume 8528 == #t~mem62;havoc #t~mem62; {18153#false} is VALID [2022-04-27 15:28:33,066 INFO L290 TraceCheckUtils]: 49: Hoare triple {18153#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); {18153#false} is VALID [2022-04-27 15:28:33,066 INFO L290 TraceCheckUtils]: 50: Hoare triple {18153#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; {18153#false} is VALID [2022-04-27 15:28:33,066 INFO L290 TraceCheckUtils]: 51: Hoare triple {18153#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); {18153#false} is VALID [2022-04-27 15:28:33,067 INFO L290 TraceCheckUtils]: 52: Hoare triple {18153#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {18153#false} is VALID [2022-04-27 15:28:33,067 INFO L290 TraceCheckUtils]: 53: Hoare triple {18153#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {18153#false} is VALID [2022-04-27 15:28:33,067 INFO L290 TraceCheckUtils]: 54: Hoare triple {18153#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {18153#false} is VALID [2022-04-27 15:28:33,067 INFO L290 TraceCheckUtils]: 55: Hoare triple {18153#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {18153#false} is VALID [2022-04-27 15:28:33,067 INFO L290 TraceCheckUtils]: 56: Hoare triple {18153#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); {18153#false} is VALID [2022-04-27 15:28:33,067 INFO L290 TraceCheckUtils]: 57: Hoare triple {18153#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {18153#false} is VALID [2022-04-27 15:28:33,067 INFO L290 TraceCheckUtils]: 58: Hoare triple {18153#false} ~skip~0 := 0; {18153#false} is VALID [2022-04-27 15:28:33,067 INFO L290 TraceCheckUtils]: 59: Hoare triple {18153#false} assume !false; {18153#false} is VALID [2022-04-27 15:28:33,067 INFO L290 TraceCheckUtils]: 60: Hoare triple {18153#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); {18153#false} is VALID [2022-04-27 15:28:33,067 INFO L290 TraceCheckUtils]: 61: Hoare triple {18153#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {18153#false} is VALID [2022-04-27 15:28:33,067 INFO L290 TraceCheckUtils]: 62: Hoare triple {18153#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {18153#false} is VALID [2022-04-27 15:28:33,067 INFO L290 TraceCheckUtils]: 63: Hoare triple {18153#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {18153#false} is VALID [2022-04-27 15:28:33,067 INFO L290 TraceCheckUtils]: 64: Hoare triple {18153#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {18153#false} is VALID [2022-04-27 15:28:33,067 INFO L290 TraceCheckUtils]: 65: Hoare triple {18153#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {18153#false} is VALID [2022-04-27 15:28:33,067 INFO L290 TraceCheckUtils]: 66: Hoare triple {18153#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {18153#false} is VALID [2022-04-27 15:28:33,067 INFO L290 TraceCheckUtils]: 67: Hoare triple {18153#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {18153#false} is VALID [2022-04-27 15:28:33,067 INFO L290 TraceCheckUtils]: 68: Hoare triple {18153#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {18153#false} is VALID [2022-04-27 15:28:33,068 INFO L290 TraceCheckUtils]: 69: Hoare triple {18153#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {18153#false} is VALID [2022-04-27 15:28:33,068 INFO L290 TraceCheckUtils]: 70: Hoare triple {18153#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {18153#false} is VALID [2022-04-27 15:28:33,068 INFO L290 TraceCheckUtils]: 71: Hoare triple {18153#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {18153#false} is VALID [2022-04-27 15:28:33,068 INFO L290 TraceCheckUtils]: 72: Hoare triple {18153#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {18153#false} is VALID [2022-04-27 15:28:33,068 INFO L290 TraceCheckUtils]: 73: Hoare triple {18153#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {18153#false} is VALID [2022-04-27 15:28:33,068 INFO L290 TraceCheckUtils]: 74: Hoare triple {18153#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {18153#false} is VALID [2022-04-27 15:28:33,068 INFO L290 TraceCheckUtils]: 75: Hoare triple {18153#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {18153#false} is VALID [2022-04-27 15:28:33,068 INFO L290 TraceCheckUtils]: 76: Hoare triple {18153#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {18153#false} is VALID [2022-04-27 15:28:33,068 INFO L290 TraceCheckUtils]: 77: Hoare triple {18153#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {18153#false} is VALID [2022-04-27 15:28:33,068 INFO L290 TraceCheckUtils]: 78: Hoare triple {18153#false} assume 8544 == #t~mem64;havoc #t~mem64; {18153#false} is VALID [2022-04-27 15:28:33,068 INFO L290 TraceCheckUtils]: 79: Hoare triple {18153#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {18153#false} is VALID [2022-04-27 15:28:33,068 INFO L290 TraceCheckUtils]: 80: Hoare triple {18153#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); {18153#false} is VALID [2022-04-27 15:28:33,068 INFO L290 TraceCheckUtils]: 81: Hoare triple {18153#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {18153#false} is VALID [2022-04-27 15:28:33,068 INFO L290 TraceCheckUtils]: 82: Hoare triple {18153#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); {18153#false} is VALID [2022-04-27 15:28:33,068 INFO L290 TraceCheckUtils]: 83: Hoare triple {18153#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; {18153#false} is VALID [2022-04-27 15:28:33,068 INFO L290 TraceCheckUtils]: 84: Hoare triple {18153#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; {18153#false} is VALID [2022-04-27 15:28:33,069 INFO L290 TraceCheckUtils]: 85: Hoare triple {18153#false} assume 8 == ~blastFlag~0; {18153#false} is VALID [2022-04-27 15:28:33,069 INFO L290 TraceCheckUtils]: 86: Hoare triple {18153#false} assume !false; {18153#false} is VALID [2022-04-27 15:28:33,069 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-27 15:28:33,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:28:33,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155089214] [2022-04-27 15:28:33,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155089214] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:28:33,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:28:33,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:28:33,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558972597] [2022-04-27 15:28:33,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:28:33,070 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 87 [2022-04-27 15:28:33,070 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:28:33,070 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:33,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:28:33,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:28:33,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:28:33,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:28:33,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:28:33,121 INFO L87 Difference]: Start difference. First operand 261 states and 409 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:37,547 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:28:38,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:28:38,318 INFO L93 Difference]: Finished difference Result 499 states and 791 transitions. [2022-04-27 15:28:38,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:28:38,318 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 87 [2022-04-27 15:28:38,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:28:38,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:38,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 427 transitions. [2022-04-27 15:28:38,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:38,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 427 transitions. [2022-04-27 15:28:38,321 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 427 transitions. [2022-04-27 15:28:38,555 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 427 edges. 427 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:28:38,559 INFO L225 Difference]: With dead ends: 499 [2022-04-27 15:28:38,559 INFO L226 Difference]: Without dead ends: 264 [2022-04-27 15:28:38,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:28:38,560 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 11 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s 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.8s IncrementalHoareTripleChecker+Time [2022-04-27 15:28:38,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 505 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-04-27 15:28:38,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-04-27 15:28:38,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 261. [2022-04-27 15:28:38,582 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:28:38,582 INFO L82 GeneralOperation]: Start isEquivalent. First operand 264 states. Second operand has 261 states, 256 states have (on average 1.578125) internal successors, (404), 256 states have internal predecessors, (404), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:38,583 INFO L74 IsIncluded]: Start isIncluded. First operand 264 states. Second operand has 261 states, 256 states have (on average 1.578125) internal successors, (404), 256 states have internal predecessors, (404), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:38,583 INFO L87 Difference]: Start difference. First operand 264 states. Second operand has 261 states, 256 states have (on average 1.578125) internal successors, (404), 256 states have internal predecessors, (404), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:38,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:28:38,586 INFO L93 Difference]: Finished difference Result 264 states and 412 transitions. [2022-04-27 15:28:38,586 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 412 transitions. [2022-04-27 15:28:38,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:28:38,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:28:38,587 INFO L74 IsIncluded]: Start isIncluded. First operand has 261 states, 256 states have (on average 1.578125) internal successors, (404), 256 states have internal predecessors, (404), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 264 states. [2022-04-27 15:28:38,587 INFO L87 Difference]: Start difference. First operand has 261 states, 256 states have (on average 1.578125) internal successors, (404), 256 states have internal predecessors, (404), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 264 states. [2022-04-27 15:28:38,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:28:38,590 INFO L93 Difference]: Finished difference Result 264 states and 412 transitions. [2022-04-27 15:28:38,590 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 412 transitions. [2022-04-27 15:28:38,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:28:38,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:28:38,591 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:28:38,591 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:28:38,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 256 states have (on average 1.578125) internal successors, (404), 256 states have internal predecessors, (404), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:38,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 408 transitions. [2022-04-27 15:28:38,594 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 408 transitions. Word has length 87 [2022-04-27 15:28:38,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:28:38,594 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 408 transitions. [2022-04-27 15:28:38,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:38,594 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 408 transitions. [2022-04-27 15:28:38,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-27 15:28:38,595 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:28:38,595 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:28:38,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-27 15:28:38,595 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:28:38,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:28:38,595 INFO L85 PathProgramCache]: Analyzing trace with hash -2127873441, now seen corresponding path program 1 times [2022-04-27 15:28:38,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:28:38,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479117703] [2022-04-27 15:28:38,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:28:38,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:28:38,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:28:38,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:28:38,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:28:38,691 INFO L290 TraceCheckUtils]: 0: Hoare triple {19561#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {19554#true} is VALID [2022-04-27 15:28:38,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {19554#true} assume true; {19554#true} is VALID [2022-04-27 15:28:38,691 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19554#true} {19554#true} #689#return; {19554#true} is VALID [2022-04-27 15:28:38,692 INFO L272 TraceCheckUtils]: 0: Hoare triple {19554#true} call ULTIMATE.init(); {19561#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:28:38,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {19561#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {19554#true} is VALID [2022-04-27 15:28:38,692 INFO L290 TraceCheckUtils]: 2: Hoare triple {19554#true} assume true; {19554#true} is VALID [2022-04-27 15:28:38,692 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19554#true} {19554#true} #689#return; {19554#true} is VALID [2022-04-27 15:28:38,692 INFO L272 TraceCheckUtils]: 4: Hoare triple {19554#true} call #t~ret161 := main(); {19554#true} is VALID [2022-04-27 15:28:38,692 INFO L290 TraceCheckUtils]: 5: Hoare triple {19554#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; {19554#true} is VALID [2022-04-27 15:28:38,692 INFO L290 TraceCheckUtils]: 6: Hoare triple {19554#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {19554#true} is VALID [2022-04-27 15:28:38,692 INFO L272 TraceCheckUtils]: 7: Hoare triple {19554#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {19554#true} is VALID [2022-04-27 15:28:38,692 INFO L290 TraceCheckUtils]: 8: Hoare triple {19554#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); {19554#true} is VALID [2022-04-27 15:28:38,692 INFO L290 TraceCheckUtils]: 9: Hoare triple {19554#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; {19554#true} is VALID [2022-04-27 15:28:38,692 INFO L290 TraceCheckUtils]: 10: Hoare triple {19554#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; {19554#true} is VALID [2022-04-27 15:28:38,692 INFO L290 TraceCheckUtils]: 11: Hoare triple {19554#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {19554#true} is VALID [2022-04-27 15:28:38,693 INFO L290 TraceCheckUtils]: 12: Hoare triple {19554#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {19554#true} is VALID [2022-04-27 15:28:38,693 INFO L290 TraceCheckUtils]: 13: Hoare triple {19554#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {19554#true} is VALID [2022-04-27 15:28:38,693 INFO L290 TraceCheckUtils]: 14: Hoare triple {19554#true} assume !false; {19554#true} is VALID [2022-04-27 15:28:38,693 INFO L290 TraceCheckUtils]: 15: Hoare triple {19554#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); {19554#true} is VALID [2022-04-27 15:28:38,693 INFO L290 TraceCheckUtils]: 16: Hoare triple {19554#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {19554#true} is VALID [2022-04-27 15:28:38,693 INFO L290 TraceCheckUtils]: 17: Hoare triple {19554#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {19554#true} is VALID [2022-04-27 15:28:38,693 INFO L290 TraceCheckUtils]: 18: Hoare triple {19554#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {19554#true} is VALID [2022-04-27 15:28:38,693 INFO L290 TraceCheckUtils]: 19: Hoare triple {19554#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {19554#true} is VALID [2022-04-27 15:28:38,693 INFO L290 TraceCheckUtils]: 20: Hoare triple {19554#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {19554#true} is VALID [2022-04-27 15:28:38,693 INFO L290 TraceCheckUtils]: 21: Hoare triple {19554#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {19554#true} is VALID [2022-04-27 15:28:38,693 INFO L290 TraceCheckUtils]: 22: Hoare triple {19554#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {19554#true} is VALID [2022-04-27 15:28:38,693 INFO L290 TraceCheckUtils]: 23: Hoare triple {19554#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {19554#true} is VALID [2022-04-27 15:28:38,693 INFO L290 TraceCheckUtils]: 24: Hoare triple {19554#true} assume 8464 == #t~mem55;havoc #t~mem55; {19554#true} is VALID [2022-04-27 15:28:38,693 INFO L290 TraceCheckUtils]: 25: Hoare triple {19554#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; {19554#true} is VALID [2022-04-27 15:28:38,693 INFO L290 TraceCheckUtils]: 26: Hoare triple {19554#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {19554#true} is VALID [2022-04-27 15:28:38,694 INFO L290 TraceCheckUtils]: 27: Hoare triple {19554#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); {19559#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:28:38,695 INFO L290 TraceCheckUtils]: 28: Hoare triple {19559#(= 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); {19559#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:28:38,695 INFO L290 TraceCheckUtils]: 29: Hoare triple {19559#(= 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; {19559#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:28:38,695 INFO L290 TraceCheckUtils]: 30: Hoare triple {19559#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {19559#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:28:38,696 INFO L290 TraceCheckUtils]: 31: Hoare triple {19559#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {19559#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:28:38,696 INFO L290 TraceCheckUtils]: 32: Hoare triple {19559#(= 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); {19559#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:28:38,696 INFO L290 TraceCheckUtils]: 33: Hoare triple {19559#(= 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); {19559#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:28:38,697 INFO L290 TraceCheckUtils]: 34: Hoare triple {19559#(= 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); {19559#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:28:38,699 INFO L290 TraceCheckUtils]: 35: Hoare triple {19559#(= 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); {19559#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:28:38,699 INFO L290 TraceCheckUtils]: 36: Hoare triple {19559#(= 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); {19559#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:28:38,699 INFO L290 TraceCheckUtils]: 37: Hoare triple {19559#(= 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); {19559#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:28:38,700 INFO L290 TraceCheckUtils]: 38: Hoare triple {19559#(= 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); {19559#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:28:38,700 INFO L290 TraceCheckUtils]: 39: Hoare triple {19559#(= 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); {19559#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:28:38,700 INFO L290 TraceCheckUtils]: 40: Hoare triple {19559#(= 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); {19559#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:28:38,702 INFO L290 TraceCheckUtils]: 41: Hoare triple {19559#(= 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); {19559#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:28:38,702 INFO L290 TraceCheckUtils]: 42: Hoare triple {19559#(= 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); {19559#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:28:38,703 INFO L290 TraceCheckUtils]: 43: Hoare triple {19559#(= 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); {19560#(= |ssl3_accept_#t~mem58| 8496)} is VALID [2022-04-27 15:28:38,703 INFO L290 TraceCheckUtils]: 44: Hoare triple {19560#(= |ssl3_accept_#t~mem58| 8496)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {19555#false} is VALID [2022-04-27 15:28:38,703 INFO L290 TraceCheckUtils]: 45: Hoare triple {19555#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {19555#false} is VALID [2022-04-27 15:28:38,703 INFO L290 TraceCheckUtils]: 46: Hoare triple {19555#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {19555#false} is VALID [2022-04-27 15:28:38,703 INFO L290 TraceCheckUtils]: 47: Hoare triple {19555#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {19555#false} is VALID [2022-04-27 15:28:38,703 INFO L290 TraceCheckUtils]: 48: Hoare triple {19555#false} assume 8528 == #t~mem62;havoc #t~mem62; {19555#false} is VALID [2022-04-27 15:28:38,703 INFO L290 TraceCheckUtils]: 49: Hoare triple {19555#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); {19555#false} is VALID [2022-04-27 15:28:38,703 INFO L290 TraceCheckUtils]: 50: Hoare triple {19555#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; {19555#false} is VALID [2022-04-27 15:28:38,703 INFO L290 TraceCheckUtils]: 51: Hoare triple {19555#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); {19555#false} is VALID [2022-04-27 15:28:38,704 INFO L290 TraceCheckUtils]: 52: Hoare triple {19555#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {19555#false} is VALID [2022-04-27 15:28:38,704 INFO L290 TraceCheckUtils]: 53: Hoare triple {19555#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {19555#false} is VALID [2022-04-27 15:28:38,704 INFO L290 TraceCheckUtils]: 54: Hoare triple {19555#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {19555#false} is VALID [2022-04-27 15:28:38,704 INFO L290 TraceCheckUtils]: 55: Hoare triple {19555#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {19555#false} is VALID [2022-04-27 15:28:38,704 INFO L290 TraceCheckUtils]: 56: Hoare triple {19555#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); {19555#false} is VALID [2022-04-27 15:28:38,704 INFO L290 TraceCheckUtils]: 57: Hoare triple {19555#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {19555#false} is VALID [2022-04-27 15:28:38,704 INFO L290 TraceCheckUtils]: 58: Hoare triple {19555#false} ~skip~0 := 0; {19555#false} is VALID [2022-04-27 15:28:38,704 INFO L290 TraceCheckUtils]: 59: Hoare triple {19555#false} assume !false; {19555#false} is VALID [2022-04-27 15:28:38,704 INFO L290 TraceCheckUtils]: 60: Hoare triple {19555#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); {19555#false} is VALID [2022-04-27 15:28:38,704 INFO L290 TraceCheckUtils]: 61: Hoare triple {19555#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {19555#false} is VALID [2022-04-27 15:28:38,704 INFO L290 TraceCheckUtils]: 62: Hoare triple {19555#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {19555#false} is VALID [2022-04-27 15:28:38,704 INFO L290 TraceCheckUtils]: 63: Hoare triple {19555#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {19555#false} is VALID [2022-04-27 15:28:38,704 INFO L290 TraceCheckUtils]: 64: Hoare triple {19555#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {19555#false} is VALID [2022-04-27 15:28:38,704 INFO L290 TraceCheckUtils]: 65: Hoare triple {19555#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {19555#false} is VALID [2022-04-27 15:28:38,704 INFO L290 TraceCheckUtils]: 66: Hoare triple {19555#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {19555#false} is VALID [2022-04-27 15:28:38,704 INFO L290 TraceCheckUtils]: 67: Hoare triple {19555#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {19555#false} is VALID [2022-04-27 15:28:38,705 INFO L290 TraceCheckUtils]: 68: Hoare triple {19555#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {19555#false} is VALID [2022-04-27 15:28:38,705 INFO L290 TraceCheckUtils]: 69: Hoare triple {19555#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {19555#false} is VALID [2022-04-27 15:28:38,705 INFO L290 TraceCheckUtils]: 70: Hoare triple {19555#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {19555#false} is VALID [2022-04-27 15:28:38,705 INFO L290 TraceCheckUtils]: 71: Hoare triple {19555#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {19555#false} is VALID [2022-04-27 15:28:38,705 INFO L290 TraceCheckUtils]: 72: Hoare triple {19555#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {19555#false} is VALID [2022-04-27 15:28:38,705 INFO L290 TraceCheckUtils]: 73: Hoare triple {19555#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {19555#false} is VALID [2022-04-27 15:28:38,705 INFO L290 TraceCheckUtils]: 74: Hoare triple {19555#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {19555#false} is VALID [2022-04-27 15:28:38,705 INFO L290 TraceCheckUtils]: 75: Hoare triple {19555#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {19555#false} is VALID [2022-04-27 15:28:38,705 INFO L290 TraceCheckUtils]: 76: Hoare triple {19555#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {19555#false} is VALID [2022-04-27 15:28:38,705 INFO L290 TraceCheckUtils]: 77: Hoare triple {19555#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {19555#false} is VALID [2022-04-27 15:28:38,705 INFO L290 TraceCheckUtils]: 78: Hoare triple {19555#false} assume 8544 == #t~mem64;havoc #t~mem64; {19555#false} is VALID [2022-04-27 15:28:38,705 INFO L290 TraceCheckUtils]: 79: Hoare triple {19555#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {19555#false} is VALID [2022-04-27 15:28:38,705 INFO L290 TraceCheckUtils]: 80: Hoare triple {19555#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); {19555#false} is VALID [2022-04-27 15:28:38,706 INFO L290 TraceCheckUtils]: 81: Hoare triple {19555#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {19555#false} is VALID [2022-04-27 15:28:38,706 INFO L290 TraceCheckUtils]: 82: Hoare triple {19555#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); {19555#false} is VALID [2022-04-27 15:28:38,706 INFO L290 TraceCheckUtils]: 83: Hoare triple {19555#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; {19555#false} is VALID [2022-04-27 15:28:38,706 INFO L290 TraceCheckUtils]: 84: Hoare triple {19555#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; {19555#false} is VALID [2022-04-27 15:28:38,706 INFO L290 TraceCheckUtils]: 85: Hoare triple {19555#false} assume 8 == ~blastFlag~0; {19555#false} is VALID [2022-04-27 15:28:38,706 INFO L290 TraceCheckUtils]: 86: Hoare triple {19555#false} assume !false; {19555#false} is VALID [2022-04-27 15:28:38,707 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 15:28:38,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:28:38,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479117703] [2022-04-27 15:28:38,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479117703] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:28:38,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:28:38,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:28:38,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126343300] [2022-04-27 15:28:38,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:28:38,709 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 87 [2022-04-27 15:28:38,709 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:28:38,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:38,756 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:28:38,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:28:38,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:28:38,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:28:38,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:28:38,757 INFO L87 Difference]: Start difference. First operand 261 states and 408 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:45,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:28:45,052 INFO L93 Difference]: Finished difference Result 537 states and 846 transitions. [2022-04-27 15:28:45,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:28:45,052 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 87 [2022-04-27 15:28:45,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:28:45,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:45,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 471 transitions. [2022-04-27 15:28:45,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:45,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 471 transitions. [2022-04-27 15:28:45,056 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 471 transitions. [2022-04-27 15:28:45,364 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 471 edges. 471 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:28:45,368 INFO L225 Difference]: With dead ends: 537 [2022-04-27 15:28:45,368 INFO L226 Difference]: Without dead ends: 302 [2022-04-27 15:28:45,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:28:45,369 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 30 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-27 15:28:45,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 507 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-04-27 15:28:45,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2022-04-27 15:28:45,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 283. [2022-04-27 15:28:45,373 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:28:45,373 INFO L82 GeneralOperation]: Start isEquivalent. First operand 302 states. Second operand has 283 states, 278 states have (on average 1.5755395683453237) internal successors, (438), 278 states have internal predecessors, (438), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:45,373 INFO L74 IsIncluded]: Start isIncluded. First operand 302 states. Second operand has 283 states, 278 states have (on average 1.5755395683453237) internal successors, (438), 278 states have internal predecessors, (438), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:45,374 INFO L87 Difference]: Start difference. First operand 302 states. Second operand has 283 states, 278 states have (on average 1.5755395683453237) internal successors, (438), 278 states have internal predecessors, (438), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:45,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:28:45,377 INFO L93 Difference]: Finished difference Result 302 states and 467 transitions. [2022-04-27 15:28:45,377 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 467 transitions. [2022-04-27 15:28:45,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:28:45,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:28:45,378 INFO L74 IsIncluded]: Start isIncluded. First operand has 283 states, 278 states have (on average 1.5755395683453237) internal successors, (438), 278 states have internal predecessors, (438), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 302 states. [2022-04-27 15:28:45,378 INFO L87 Difference]: Start difference. First operand has 283 states, 278 states have (on average 1.5755395683453237) internal successors, (438), 278 states have internal predecessors, (438), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 302 states. [2022-04-27 15:28:45,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:28:45,382 INFO L93 Difference]: Finished difference Result 302 states and 467 transitions. [2022-04-27 15:28:45,382 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 467 transitions. [2022-04-27 15:28:45,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:28:45,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:28:45,383 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:28:45,383 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:28:45,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 278 states have (on average 1.5755395683453237) internal successors, (438), 278 states have internal predecessors, (438), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:45,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 442 transitions. [2022-04-27 15:28:45,387 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 442 transitions. Word has length 87 [2022-04-27 15:28:45,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:28:45,387 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 442 transitions. [2022-04-27 15:28:45,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:45,387 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 442 transitions. [2022-04-27 15:28:45,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-04-27 15:28:45,388 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:28:45,388 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:28:45,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-27 15:28:45,388 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:28:45,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:28:45,389 INFO L85 PathProgramCache]: Analyzing trace with hash 880442311, now seen corresponding path program 1 times [2022-04-27 15:28:45,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:28:45,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799344961] [2022-04-27 15:28:45,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:28:45,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:28:45,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:28:45,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:28:45,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:28:45,491 INFO L290 TraceCheckUtils]: 0: Hoare triple {21106#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {21099#true} is VALID [2022-04-27 15:28:45,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {21099#true} assume true; {21099#true} is VALID [2022-04-27 15:28:45,491 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21099#true} {21099#true} #689#return; {21099#true} is VALID [2022-04-27 15:28:45,492 INFO L272 TraceCheckUtils]: 0: Hoare triple {21099#true} call ULTIMATE.init(); {21106#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:28:45,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {21106#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {21099#true} is VALID [2022-04-27 15:28:45,492 INFO L290 TraceCheckUtils]: 2: Hoare triple {21099#true} assume true; {21099#true} is VALID [2022-04-27 15:28:45,492 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21099#true} {21099#true} #689#return; {21099#true} is VALID [2022-04-27 15:28:45,492 INFO L272 TraceCheckUtils]: 4: Hoare triple {21099#true} call #t~ret161 := main(); {21099#true} is VALID [2022-04-27 15:28:45,492 INFO L290 TraceCheckUtils]: 5: Hoare triple {21099#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; {21099#true} is VALID [2022-04-27 15:28:45,492 INFO L290 TraceCheckUtils]: 6: Hoare triple {21099#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {21099#true} is VALID [2022-04-27 15:28:45,492 INFO L272 TraceCheckUtils]: 7: Hoare triple {21099#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {21099#true} is VALID [2022-04-27 15:28:45,492 INFO L290 TraceCheckUtils]: 8: Hoare triple {21099#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); {21099#true} is VALID [2022-04-27 15:28:45,492 INFO L290 TraceCheckUtils]: 9: Hoare triple {21099#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; {21099#true} is VALID [2022-04-27 15:28:45,492 INFO L290 TraceCheckUtils]: 10: Hoare triple {21099#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; {21099#true} is VALID [2022-04-27 15:28:45,492 INFO L290 TraceCheckUtils]: 11: Hoare triple {21099#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {21099#true} is VALID [2022-04-27 15:28:45,492 INFO L290 TraceCheckUtils]: 12: Hoare triple {21099#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {21099#true} is VALID [2022-04-27 15:28:45,492 INFO L290 TraceCheckUtils]: 13: Hoare triple {21099#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {21099#true} is VALID [2022-04-27 15:28:45,492 INFO L290 TraceCheckUtils]: 14: Hoare triple {21099#true} assume !false; {21099#true} is VALID [2022-04-27 15:28:45,493 INFO L290 TraceCheckUtils]: 15: Hoare triple {21099#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); {21099#true} is VALID [2022-04-27 15:28:45,493 INFO L290 TraceCheckUtils]: 16: Hoare triple {21099#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {21099#true} is VALID [2022-04-27 15:28:45,493 INFO L290 TraceCheckUtils]: 17: Hoare triple {21099#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21099#true} is VALID [2022-04-27 15:28:45,493 INFO L290 TraceCheckUtils]: 18: Hoare triple {21099#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21099#true} is VALID [2022-04-27 15:28:45,493 INFO L290 TraceCheckUtils]: 19: Hoare triple {21099#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21099#true} is VALID [2022-04-27 15:28:45,493 INFO L290 TraceCheckUtils]: 20: Hoare triple {21099#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21099#true} is VALID [2022-04-27 15:28:45,493 INFO L290 TraceCheckUtils]: 21: Hoare triple {21099#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {21099#true} is VALID [2022-04-27 15:28:45,493 INFO L290 TraceCheckUtils]: 22: Hoare triple {21099#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {21099#true} is VALID [2022-04-27 15:28:45,493 INFO L290 TraceCheckUtils]: 23: Hoare triple {21099#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {21099#true} is VALID [2022-04-27 15:28:45,493 INFO L290 TraceCheckUtils]: 24: Hoare triple {21099#true} assume 8464 == #t~mem55;havoc #t~mem55; {21099#true} is VALID [2022-04-27 15:28:45,493 INFO L290 TraceCheckUtils]: 25: Hoare triple {21099#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; {21099#true} is VALID [2022-04-27 15:28:45,493 INFO L290 TraceCheckUtils]: 26: Hoare triple {21099#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {21099#true} is VALID [2022-04-27 15:28:45,494 INFO L290 TraceCheckUtils]: 27: Hoare triple {21099#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); {21104#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:28:45,494 INFO L290 TraceCheckUtils]: 28: Hoare triple {21104#(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); {21104#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:28:45,495 INFO L290 TraceCheckUtils]: 29: Hoare triple {21104#(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; {21104#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:28:45,495 INFO L290 TraceCheckUtils]: 30: Hoare triple {21104#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {21104#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:28:45,495 INFO L290 TraceCheckUtils]: 31: Hoare triple {21104#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {21104#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:28:45,496 INFO L290 TraceCheckUtils]: 32: Hoare triple {21104#(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); {21104#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:28:45,496 INFO L290 TraceCheckUtils]: 33: Hoare triple {21104#(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); {21104#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:28:45,496 INFO L290 TraceCheckUtils]: 34: Hoare triple {21104#(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); {21104#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:28:45,497 INFO L290 TraceCheckUtils]: 35: Hoare triple {21104#(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); {21104#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:28:45,497 INFO L290 TraceCheckUtils]: 36: Hoare triple {21104#(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); {21104#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:28:45,497 INFO L290 TraceCheckUtils]: 37: Hoare triple {21104#(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); {21105#(not (= |ssl3_accept_#t~mem52| 8480))} is VALID [2022-04-27 15:28:45,498 INFO L290 TraceCheckUtils]: 38: Hoare triple {21105#(not (= |ssl3_accept_#t~mem52| 8480))} assume 8480 == #t~mem52;havoc #t~mem52; {21100#false} is VALID [2022-04-27 15:28:45,498 INFO L290 TraceCheckUtils]: 39: Hoare triple {21100#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; {21100#false} is VALID [2022-04-27 15:28:45,498 INFO L290 TraceCheckUtils]: 40: Hoare triple {21100#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); {21100#false} is VALID [2022-04-27 15:28:45,498 INFO L290 TraceCheckUtils]: 41: Hoare triple {21100#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); {21100#false} is VALID [2022-04-27 15:28:45,498 INFO L290 TraceCheckUtils]: 42: Hoare triple {21100#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {21100#false} is VALID [2022-04-27 15:28:45,498 INFO L290 TraceCheckUtils]: 43: Hoare triple {21100#false} ~skip~0 := 0; {21100#false} is VALID [2022-04-27 15:28:45,498 INFO L290 TraceCheckUtils]: 44: Hoare triple {21100#false} assume !false; {21100#false} is VALID [2022-04-27 15:28:45,498 INFO L290 TraceCheckUtils]: 45: Hoare triple {21100#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); {21100#false} is VALID [2022-04-27 15:28:45,498 INFO L290 TraceCheckUtils]: 46: Hoare triple {21100#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {21100#false} is VALID [2022-04-27 15:28:45,498 INFO L290 TraceCheckUtils]: 47: Hoare triple {21100#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21100#false} is VALID [2022-04-27 15:28:45,498 INFO L290 TraceCheckUtils]: 48: Hoare triple {21100#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21100#false} is VALID [2022-04-27 15:28:45,498 INFO L290 TraceCheckUtils]: 49: Hoare triple {21100#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21100#false} is VALID [2022-04-27 15:28:45,498 INFO L290 TraceCheckUtils]: 50: Hoare triple {21100#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21100#false} is VALID [2022-04-27 15:28:45,498 INFO L290 TraceCheckUtils]: 51: Hoare triple {21100#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {21100#false} is VALID [2022-04-27 15:28:45,498 INFO L290 TraceCheckUtils]: 52: Hoare triple {21100#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {21100#false} is VALID [2022-04-27 15:28:45,498 INFO L290 TraceCheckUtils]: 53: Hoare triple {21100#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {21100#false} is VALID [2022-04-27 15:28:45,499 INFO L290 TraceCheckUtils]: 54: Hoare triple {21100#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {21100#false} is VALID [2022-04-27 15:28:45,499 INFO L290 TraceCheckUtils]: 55: Hoare triple {21100#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {21100#false} is VALID [2022-04-27 15:28:45,499 INFO L290 TraceCheckUtils]: 56: Hoare triple {21100#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {21100#false} is VALID [2022-04-27 15:28:45,499 INFO L290 TraceCheckUtils]: 57: Hoare triple {21100#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {21100#false} is VALID [2022-04-27 15:28:45,499 INFO L290 TraceCheckUtils]: 58: Hoare triple {21100#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {21100#false} is VALID [2022-04-27 15:28:45,499 INFO L290 TraceCheckUtils]: 59: Hoare triple {21100#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {21100#false} is VALID [2022-04-27 15:28:45,499 INFO L290 TraceCheckUtils]: 60: Hoare triple {21100#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {21100#false} is VALID [2022-04-27 15:28:45,499 INFO L290 TraceCheckUtils]: 61: Hoare triple {21100#false} assume 8528 == #t~mem62;havoc #t~mem62; {21100#false} is VALID [2022-04-27 15:28:45,499 INFO L290 TraceCheckUtils]: 62: Hoare triple {21100#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); {21100#false} is VALID [2022-04-27 15:28:45,499 INFO L290 TraceCheckUtils]: 63: Hoare triple {21100#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; {21100#false} is VALID [2022-04-27 15:28:45,499 INFO L290 TraceCheckUtils]: 64: Hoare triple {21100#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); {21100#false} is VALID [2022-04-27 15:28:45,499 INFO L290 TraceCheckUtils]: 65: Hoare triple {21100#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {21100#false} is VALID [2022-04-27 15:28:45,499 INFO L290 TraceCheckUtils]: 66: Hoare triple {21100#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {21100#false} is VALID [2022-04-27 15:28:45,499 INFO L290 TraceCheckUtils]: 67: Hoare triple {21100#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {21100#false} is VALID [2022-04-27 15:28:45,499 INFO L290 TraceCheckUtils]: 68: Hoare triple {21100#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {21100#false} is VALID [2022-04-27 15:28:45,499 INFO L290 TraceCheckUtils]: 69: Hoare triple {21100#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); {21100#false} is VALID [2022-04-27 15:28:45,499 INFO L290 TraceCheckUtils]: 70: Hoare triple {21100#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {21100#false} is VALID [2022-04-27 15:28:45,500 INFO L290 TraceCheckUtils]: 71: Hoare triple {21100#false} ~skip~0 := 0; {21100#false} is VALID [2022-04-27 15:28:45,500 INFO L290 TraceCheckUtils]: 72: Hoare triple {21100#false} assume !false; {21100#false} is VALID [2022-04-27 15:28:45,500 INFO L290 TraceCheckUtils]: 73: Hoare triple {21100#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); {21100#false} is VALID [2022-04-27 15:28:45,500 INFO L290 TraceCheckUtils]: 74: Hoare triple {21100#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {21100#false} is VALID [2022-04-27 15:28:45,500 INFO L290 TraceCheckUtils]: 75: Hoare triple {21100#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21100#false} is VALID [2022-04-27 15:28:45,500 INFO L290 TraceCheckUtils]: 76: Hoare triple {21100#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21100#false} is VALID [2022-04-27 15:28:45,500 INFO L290 TraceCheckUtils]: 77: Hoare triple {21100#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21100#false} is VALID [2022-04-27 15:28:45,500 INFO L290 TraceCheckUtils]: 78: Hoare triple {21100#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21100#false} is VALID [2022-04-27 15:28:45,500 INFO L290 TraceCheckUtils]: 79: Hoare triple {21100#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {21100#false} is VALID [2022-04-27 15:28:45,500 INFO L290 TraceCheckUtils]: 80: Hoare triple {21100#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {21100#false} is VALID [2022-04-27 15:28:45,500 INFO L290 TraceCheckUtils]: 81: Hoare triple {21100#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {21100#false} is VALID [2022-04-27 15:28:45,500 INFO L290 TraceCheckUtils]: 82: Hoare triple {21100#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {21100#false} is VALID [2022-04-27 15:28:45,500 INFO L290 TraceCheckUtils]: 83: Hoare triple {21100#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {21100#false} is VALID [2022-04-27 15:28:45,500 INFO L290 TraceCheckUtils]: 84: Hoare triple {21100#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {21100#false} is VALID [2022-04-27 15:28:45,500 INFO L290 TraceCheckUtils]: 85: Hoare triple {21100#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {21100#false} is VALID [2022-04-27 15:28:45,500 INFO L290 TraceCheckUtils]: 86: Hoare triple {21100#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {21100#false} is VALID [2022-04-27 15:28:45,500 INFO L290 TraceCheckUtils]: 87: Hoare triple {21100#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {21100#false} is VALID [2022-04-27 15:28:45,501 INFO L290 TraceCheckUtils]: 88: Hoare triple {21100#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {21100#false} is VALID [2022-04-27 15:28:45,501 INFO L290 TraceCheckUtils]: 89: Hoare triple {21100#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {21100#false} is VALID [2022-04-27 15:28:45,501 INFO L290 TraceCheckUtils]: 90: Hoare triple {21100#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {21100#false} is VALID [2022-04-27 15:28:45,501 INFO L290 TraceCheckUtils]: 91: Hoare triple {21100#false} assume 8544 == #t~mem64;havoc #t~mem64; {21100#false} is VALID [2022-04-27 15:28:45,501 INFO L290 TraceCheckUtils]: 92: Hoare triple {21100#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {21100#false} is VALID [2022-04-27 15:28:45,501 INFO L290 TraceCheckUtils]: 93: Hoare triple {21100#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); {21100#false} is VALID [2022-04-27 15:28:45,501 INFO L290 TraceCheckUtils]: 94: Hoare triple {21100#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {21100#false} is VALID [2022-04-27 15:28:45,501 INFO L290 TraceCheckUtils]: 95: Hoare triple {21100#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); {21100#false} is VALID [2022-04-27 15:28:45,501 INFO L290 TraceCheckUtils]: 96: Hoare triple {21100#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; {21100#false} is VALID [2022-04-27 15:28:45,501 INFO L290 TraceCheckUtils]: 97: Hoare triple {21100#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; {21100#false} is VALID [2022-04-27 15:28:45,501 INFO L290 TraceCheckUtils]: 98: Hoare triple {21100#false} assume 8 == ~blastFlag~0; {21100#false} is VALID [2022-04-27 15:28:45,501 INFO L290 TraceCheckUtils]: 99: Hoare triple {21100#false} assume !false; {21100#false} is VALID [2022-04-27 15:28:45,501 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-27 15:28:45,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:28:45,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799344961] [2022-04-27 15:28:45,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799344961] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:28:45,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:28:45,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:28:45,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076135714] [2022-04-27 15:28:45,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:28:45,502 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 100 [2022-04-27 15:28:45,502 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:28:45,503 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:45,556 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:28:45,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:28:45,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:28:45,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:28:45,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:28:45,556 INFO L87 Difference]: Start difference. First operand 283 states and 442 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:49,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:28:49,441 INFO L93 Difference]: Finished difference Result 655 states and 1026 transitions. [2022-04-27 15:28:49,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:28:49,441 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 100 [2022-04-27 15:28:49,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:28:49,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:49,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 585 transitions. [2022-04-27 15:28:49,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:49,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 585 transitions. [2022-04-27 15:28:49,445 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 585 transitions. [2022-04-27 15:28:49,821 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 585 edges. 585 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:28:49,827 INFO L225 Difference]: With dead ends: 655 [2022-04-27 15:28:49,827 INFO L226 Difference]: Without dead ends: 398 [2022-04-27 15:28:49,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:28:49,828 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 138 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 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, 1.8s IncrementalHoareTripleChecker+Time [2022-04-27 15:28:49,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 360 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-27 15:28:49,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2022-04-27 15:28:49,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 299. [2022-04-27 15:28:49,832 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:28:49,833 INFO L82 GeneralOperation]: Start isEquivalent. First operand 398 states. Second operand has 299 states, 294 states have (on average 1.5578231292517006) internal successors, (458), 294 states have internal predecessors, (458), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:49,833 INFO L74 IsIncluded]: Start isIncluded. First operand 398 states. Second operand has 299 states, 294 states have (on average 1.5578231292517006) internal successors, (458), 294 states have internal predecessors, (458), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:49,833 INFO L87 Difference]: Start difference. First operand 398 states. Second operand has 299 states, 294 states have (on average 1.5578231292517006) internal successors, (458), 294 states have internal predecessors, (458), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:49,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:28:49,839 INFO L93 Difference]: Finished difference Result 398 states and 610 transitions. [2022-04-27 15:28:49,839 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 610 transitions. [2022-04-27 15:28:49,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:28:49,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:28:49,840 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 398 states. [2022-04-27 15:28:49,840 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 398 states. [2022-04-27 15:28:49,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:28:49,846 INFO L93 Difference]: Finished difference Result 398 states and 610 transitions. [2022-04-27 15:28:49,846 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 610 transitions. [2022-04-27 15:28:49,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:28:49,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:28:49,847 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:28:49,847 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:28:49,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.5578231292517006) internal successors, (458), 294 states have internal predecessors, (458), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:49,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 462 transitions. [2022-04-27 15:28:49,851 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 462 transitions. Word has length 100 [2022-04-27 15:28:49,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:28:49,851 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 462 transitions. [2022-04-27 15:28:49,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:49,851 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 462 transitions. [2022-04-27 15:28:49,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-27 15:28:49,852 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:28:49,852 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:28:49,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-27 15:28:49,852 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:28:49,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:28:49,853 INFO L85 PathProgramCache]: Analyzing trace with hash -130486748, now seen corresponding path program 1 times [2022-04-27 15:28:49,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:28:49,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119389012] [2022-04-27 15:28:49,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:28:49,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:28:49,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:28:49,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:28:49,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:28:49,958 INFO L290 TraceCheckUtils]: 0: Hoare triple {22998#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {22991#true} is VALID [2022-04-27 15:28:49,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {22991#true} assume true; {22991#true} is VALID [2022-04-27 15:28:49,958 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22991#true} {22991#true} #689#return; {22991#true} is VALID [2022-04-27 15:28:49,959 INFO L272 TraceCheckUtils]: 0: Hoare triple {22991#true} call ULTIMATE.init(); {22998#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:28:49,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {22998#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {22991#true} is VALID [2022-04-27 15:28:49,959 INFO L290 TraceCheckUtils]: 2: Hoare triple {22991#true} assume true; {22991#true} is VALID [2022-04-27 15:28:49,959 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22991#true} {22991#true} #689#return; {22991#true} is VALID [2022-04-27 15:28:49,960 INFO L272 TraceCheckUtils]: 4: Hoare triple {22991#true} call #t~ret161 := main(); {22991#true} is VALID [2022-04-27 15:28:49,960 INFO L290 TraceCheckUtils]: 5: Hoare triple {22991#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; {22991#true} is VALID [2022-04-27 15:28:49,960 INFO L290 TraceCheckUtils]: 6: Hoare triple {22991#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {22991#true} is VALID [2022-04-27 15:28:49,960 INFO L272 TraceCheckUtils]: 7: Hoare triple {22991#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {22991#true} is VALID [2022-04-27 15:28:49,960 INFO L290 TraceCheckUtils]: 8: Hoare triple {22991#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); {22991#true} is VALID [2022-04-27 15:28:49,960 INFO L290 TraceCheckUtils]: 9: Hoare triple {22991#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; {22991#true} is VALID [2022-04-27 15:28:49,960 INFO L290 TraceCheckUtils]: 10: Hoare triple {22991#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; {22991#true} is VALID [2022-04-27 15:28:49,960 INFO L290 TraceCheckUtils]: 11: Hoare triple {22991#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {22991#true} is VALID [2022-04-27 15:28:49,960 INFO L290 TraceCheckUtils]: 12: Hoare triple {22991#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {22991#true} is VALID [2022-04-27 15:28:49,960 INFO L290 TraceCheckUtils]: 13: Hoare triple {22991#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {22991#true} is VALID [2022-04-27 15:28:49,960 INFO L290 TraceCheckUtils]: 14: Hoare triple {22991#true} assume !false; {22991#true} is VALID [2022-04-27 15:28:49,960 INFO L290 TraceCheckUtils]: 15: Hoare triple {22991#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); {22991#true} is VALID [2022-04-27 15:28:49,960 INFO L290 TraceCheckUtils]: 16: Hoare triple {22991#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {22991#true} is VALID [2022-04-27 15:28:49,960 INFO L290 TraceCheckUtils]: 17: Hoare triple {22991#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {22991#true} is VALID [2022-04-27 15:28:49,960 INFO L290 TraceCheckUtils]: 18: Hoare triple {22991#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {22991#true} is VALID [2022-04-27 15:28:49,960 INFO L290 TraceCheckUtils]: 19: Hoare triple {22991#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {22991#true} is VALID [2022-04-27 15:28:49,961 INFO L290 TraceCheckUtils]: 20: Hoare triple {22991#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {22991#true} is VALID [2022-04-27 15:28:49,961 INFO L290 TraceCheckUtils]: 21: Hoare triple {22991#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {22991#true} is VALID [2022-04-27 15:28:49,961 INFO L290 TraceCheckUtils]: 22: Hoare triple {22991#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {22991#true} is VALID [2022-04-27 15:28:49,961 INFO L290 TraceCheckUtils]: 23: Hoare triple {22991#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {22991#true} is VALID [2022-04-27 15:28:49,961 INFO L290 TraceCheckUtils]: 24: Hoare triple {22991#true} assume 8464 == #t~mem55;havoc #t~mem55; {22991#true} is VALID [2022-04-27 15:28:49,961 INFO L290 TraceCheckUtils]: 25: Hoare triple {22991#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; {22991#true} is VALID [2022-04-27 15:28:49,961 INFO L290 TraceCheckUtils]: 26: Hoare triple {22991#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {22991#true} is VALID [2022-04-27 15:28:49,962 INFO L290 TraceCheckUtils]: 27: Hoare triple {22991#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); {22996#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:28:49,962 INFO L290 TraceCheckUtils]: 28: Hoare triple {22996#(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); {22996#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:28:49,962 INFO L290 TraceCheckUtils]: 29: Hoare triple {22996#(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; {22996#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:28:49,963 INFO L290 TraceCheckUtils]: 30: Hoare triple {22996#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} ~skip~0 := 0; {22996#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:28:49,963 INFO L290 TraceCheckUtils]: 31: Hoare triple {22996#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !false; {22996#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:28:49,963 INFO L290 TraceCheckUtils]: 32: Hoare triple {22996#(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); {22996#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:28:49,964 INFO L290 TraceCheckUtils]: 33: Hoare triple {22996#(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); {22996#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:28:49,964 INFO L290 TraceCheckUtils]: 34: Hoare triple {22996#(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); {22996#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:28:49,964 INFO L290 TraceCheckUtils]: 35: Hoare triple {22996#(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); {22996#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:28:49,965 INFO L290 TraceCheckUtils]: 36: Hoare triple {22996#(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); {22996#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:28:49,965 INFO L290 TraceCheckUtils]: 37: Hoare triple {22996#(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); {22996#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:28:49,965 INFO L290 TraceCheckUtils]: 38: Hoare triple {22996#(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); {22997#(not (= |ssl3_accept_#t~mem53| 8481))} is VALID [2022-04-27 15:28:49,966 INFO L290 TraceCheckUtils]: 39: Hoare triple {22997#(not (= |ssl3_accept_#t~mem53| 8481))} assume 8481 == #t~mem53;havoc #t~mem53; {22992#false} is VALID [2022-04-27 15:28:49,966 INFO L290 TraceCheckUtils]: 40: Hoare triple {22992#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; {22992#false} is VALID [2022-04-27 15:28:49,966 INFO L290 TraceCheckUtils]: 41: Hoare triple {22992#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); {22992#false} is VALID [2022-04-27 15:28:49,966 INFO L290 TraceCheckUtils]: 42: Hoare triple {22992#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); {22992#false} is VALID [2022-04-27 15:28:49,966 INFO L290 TraceCheckUtils]: 43: Hoare triple {22992#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {22992#false} is VALID [2022-04-27 15:28:49,966 INFO L290 TraceCheckUtils]: 44: Hoare triple {22992#false} ~skip~0 := 0; {22992#false} is VALID [2022-04-27 15:28:49,966 INFO L290 TraceCheckUtils]: 45: Hoare triple {22992#false} assume !false; {22992#false} is VALID [2022-04-27 15:28:49,966 INFO L290 TraceCheckUtils]: 46: Hoare triple {22992#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); {22992#false} is VALID [2022-04-27 15:28:49,966 INFO L290 TraceCheckUtils]: 47: Hoare triple {22992#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {22992#false} is VALID [2022-04-27 15:28:49,966 INFO L290 TraceCheckUtils]: 48: Hoare triple {22992#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {22992#false} is VALID [2022-04-27 15:28:49,966 INFO L290 TraceCheckUtils]: 49: Hoare triple {22992#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {22992#false} is VALID [2022-04-27 15:28:49,966 INFO L290 TraceCheckUtils]: 50: Hoare triple {22992#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {22992#false} is VALID [2022-04-27 15:28:49,966 INFO L290 TraceCheckUtils]: 51: Hoare triple {22992#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {22992#false} is VALID [2022-04-27 15:28:49,966 INFO L290 TraceCheckUtils]: 52: Hoare triple {22992#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {22992#false} is VALID [2022-04-27 15:28:49,966 INFO L290 TraceCheckUtils]: 53: Hoare triple {22992#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {22992#false} is VALID [2022-04-27 15:28:49,967 INFO L290 TraceCheckUtils]: 54: Hoare triple {22992#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {22992#false} is VALID [2022-04-27 15:28:49,967 INFO L290 TraceCheckUtils]: 55: Hoare triple {22992#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {22992#false} is VALID [2022-04-27 15:28:49,967 INFO L290 TraceCheckUtils]: 56: Hoare triple {22992#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {22992#false} is VALID [2022-04-27 15:28:49,967 INFO L290 TraceCheckUtils]: 57: Hoare triple {22992#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {22992#false} is VALID [2022-04-27 15:28:49,967 INFO L290 TraceCheckUtils]: 58: Hoare triple {22992#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {22992#false} is VALID [2022-04-27 15:28:49,967 INFO L290 TraceCheckUtils]: 59: Hoare triple {22992#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {22992#false} is VALID [2022-04-27 15:28:49,967 INFO L290 TraceCheckUtils]: 60: Hoare triple {22992#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {22992#false} is VALID [2022-04-27 15:28:49,967 INFO L290 TraceCheckUtils]: 61: Hoare triple {22992#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {22992#false} is VALID [2022-04-27 15:28:49,967 INFO L290 TraceCheckUtils]: 62: Hoare triple {22992#false} assume 8528 == #t~mem62;havoc #t~mem62; {22992#false} is VALID [2022-04-27 15:28:49,967 INFO L290 TraceCheckUtils]: 63: Hoare triple {22992#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); {22992#false} is VALID [2022-04-27 15:28:49,967 INFO L290 TraceCheckUtils]: 64: Hoare triple {22992#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; {22992#false} is VALID [2022-04-27 15:28:49,967 INFO L290 TraceCheckUtils]: 65: Hoare triple {22992#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); {22992#false} is VALID [2022-04-27 15:28:49,967 INFO L290 TraceCheckUtils]: 66: Hoare triple {22992#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {22992#false} is VALID [2022-04-27 15:28:49,967 INFO L290 TraceCheckUtils]: 67: Hoare triple {22992#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {22992#false} is VALID [2022-04-27 15:28:49,967 INFO L290 TraceCheckUtils]: 68: Hoare triple {22992#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {22992#false} is VALID [2022-04-27 15:28:49,967 INFO L290 TraceCheckUtils]: 69: Hoare triple {22992#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {22992#false} is VALID [2022-04-27 15:28:49,968 INFO L290 TraceCheckUtils]: 70: Hoare triple {22992#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); {22992#false} is VALID [2022-04-27 15:28:49,968 INFO L290 TraceCheckUtils]: 71: Hoare triple {22992#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {22992#false} is VALID [2022-04-27 15:28:49,968 INFO L290 TraceCheckUtils]: 72: Hoare triple {22992#false} ~skip~0 := 0; {22992#false} is VALID [2022-04-27 15:28:49,968 INFO L290 TraceCheckUtils]: 73: Hoare triple {22992#false} assume !false; {22992#false} is VALID [2022-04-27 15:28:49,968 INFO L290 TraceCheckUtils]: 74: Hoare triple {22992#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); {22992#false} is VALID [2022-04-27 15:28:49,968 INFO L290 TraceCheckUtils]: 75: Hoare triple {22992#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {22992#false} is VALID [2022-04-27 15:28:49,968 INFO L290 TraceCheckUtils]: 76: Hoare triple {22992#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {22992#false} is VALID [2022-04-27 15:28:49,968 INFO L290 TraceCheckUtils]: 77: Hoare triple {22992#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {22992#false} is VALID [2022-04-27 15:28:49,968 INFO L290 TraceCheckUtils]: 78: Hoare triple {22992#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {22992#false} is VALID [2022-04-27 15:28:49,968 INFO L290 TraceCheckUtils]: 79: Hoare triple {22992#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {22992#false} is VALID [2022-04-27 15:28:49,968 INFO L290 TraceCheckUtils]: 80: Hoare triple {22992#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {22992#false} is VALID [2022-04-27 15:28:49,968 INFO L290 TraceCheckUtils]: 81: Hoare triple {22992#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {22992#false} is VALID [2022-04-27 15:28:49,968 INFO L290 TraceCheckUtils]: 82: Hoare triple {22992#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {22992#false} is VALID [2022-04-27 15:28:49,968 INFO L290 TraceCheckUtils]: 83: Hoare triple {22992#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {22992#false} is VALID [2022-04-27 15:28:49,968 INFO L290 TraceCheckUtils]: 84: Hoare triple {22992#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {22992#false} is VALID [2022-04-27 15:28:49,968 INFO L290 TraceCheckUtils]: 85: Hoare triple {22992#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {22992#false} is VALID [2022-04-27 15:28:49,969 INFO L290 TraceCheckUtils]: 86: Hoare triple {22992#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {22992#false} is VALID [2022-04-27 15:28:49,969 INFO L290 TraceCheckUtils]: 87: Hoare triple {22992#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {22992#false} is VALID [2022-04-27 15:28:49,969 INFO L290 TraceCheckUtils]: 88: Hoare triple {22992#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {22992#false} is VALID [2022-04-27 15:28:49,969 INFO L290 TraceCheckUtils]: 89: Hoare triple {22992#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {22992#false} is VALID [2022-04-27 15:28:49,969 INFO L290 TraceCheckUtils]: 90: Hoare triple {22992#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {22992#false} is VALID [2022-04-27 15:28:49,969 INFO L290 TraceCheckUtils]: 91: Hoare triple {22992#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {22992#false} is VALID [2022-04-27 15:28:49,969 INFO L290 TraceCheckUtils]: 92: Hoare triple {22992#false} assume 8544 == #t~mem64;havoc #t~mem64; {22992#false} is VALID [2022-04-27 15:28:49,969 INFO L290 TraceCheckUtils]: 93: Hoare triple {22992#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {22992#false} is VALID [2022-04-27 15:28:49,969 INFO L290 TraceCheckUtils]: 94: Hoare triple {22992#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); {22992#false} is VALID [2022-04-27 15:28:49,969 INFO L290 TraceCheckUtils]: 95: Hoare triple {22992#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {22992#false} is VALID [2022-04-27 15:28:49,969 INFO L290 TraceCheckUtils]: 96: Hoare triple {22992#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); {22992#false} is VALID [2022-04-27 15:28:49,969 INFO L290 TraceCheckUtils]: 97: Hoare triple {22992#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; {22992#false} is VALID [2022-04-27 15:28:49,969 INFO L290 TraceCheckUtils]: 98: Hoare triple {22992#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; {22992#false} is VALID [2022-04-27 15:28:49,969 INFO L290 TraceCheckUtils]: 99: Hoare triple {22992#false} assume 8 == ~blastFlag~0; {22992#false} is VALID [2022-04-27 15:28:49,969 INFO L290 TraceCheckUtils]: 100: Hoare triple {22992#false} assume !false; {22992#false} is VALID [2022-04-27 15:28:49,970 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-27 15:28:49,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:28:49,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119389012] [2022-04-27 15:28:49,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119389012] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:28:49,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:28:49,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:28:49,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897985493] [2022-04-27 15:28:49,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:28:49,971 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 101 [2022-04-27 15:28:49,971 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:28:49,971 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:50,038 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:28:50,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:28:50,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:28:50,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:28:50,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:28:50,039 INFO L87 Difference]: Start difference. First operand 299 states and 462 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:55,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:28:55,477 INFO L93 Difference]: Finished difference Result 647 states and 999 transitions. [2022-04-27 15:28:55,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:28:55,478 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 101 [2022-04-27 15:28:55,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:28:55,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:55,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 585 transitions. [2022-04-27 15:28:55,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:55,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 585 transitions. [2022-04-27 15:28:55,489 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 585 transitions. [2022-04-27 15:28:55,844 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 585 edges. 585 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:28:55,849 INFO L225 Difference]: With dead ends: 647 [2022-04-27 15:28:55,849 INFO L226 Difference]: Without dead ends: 374 [2022-04-27 15:28:55,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:28:55,850 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 137 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 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-27 15:28:55,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 360 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-27 15:28:55,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2022-04-27 15:28:55,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 299. [2022-04-27 15:28:55,855 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:28:55,856 INFO L82 GeneralOperation]: Start isEquivalent. First operand 374 states. Second operand has 299 states, 294 states have (on average 1.5442176870748299) internal successors, (454), 294 states have internal predecessors, (454), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:55,856 INFO L74 IsIncluded]: Start isIncluded. First operand 374 states. Second operand has 299 states, 294 states have (on average 1.5442176870748299) internal successors, (454), 294 states have internal predecessors, (454), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:55,856 INFO L87 Difference]: Start difference. First operand 374 states. Second operand has 299 states, 294 states have (on average 1.5442176870748299) internal successors, (454), 294 states have internal predecessors, (454), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:55,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:28:55,861 INFO L93 Difference]: Finished difference Result 374 states and 563 transitions. [2022-04-27 15:28:55,861 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 563 transitions. [2022-04-27 15:28:55,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:28:55,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:28:55,862 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 374 states. [2022-04-27 15:28:55,862 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 374 states. [2022-04-27 15:28:55,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:28:55,867 INFO L93 Difference]: Finished difference Result 374 states and 563 transitions. [2022-04-27 15:28:55,867 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 563 transitions. [2022-04-27 15:28:55,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:28:55,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:28:55,868 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:28:55,868 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:28:55,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.5442176870748299) internal successors, (454), 294 states have internal predecessors, (454), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:55,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 458 transitions. [2022-04-27 15:28:55,871 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 458 transitions. Word has length 101 [2022-04-27 15:28:55,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:28:55,872 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 458 transitions. [2022-04-27 15:28:55,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:55,872 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 458 transitions. [2022-04-27 15:28:55,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-04-27 15:28:55,872 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:28:55,872 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:28:55,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-27 15:28:55,873 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:28:55,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:28:55,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1045112784, now seen corresponding path program 1 times [2022-04-27 15:28:55,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:28:55,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690438335] [2022-04-27 15:28:55,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:28:55,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:28:55,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:28:56,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:28:56,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:28:56,009 INFO L290 TraceCheckUtils]: 0: Hoare triple {24836#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {24829#true} is VALID [2022-04-27 15:28:56,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {24829#true} assume true; {24829#true} is VALID [2022-04-27 15:28:56,009 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24829#true} {24829#true} #689#return; {24829#true} is VALID [2022-04-27 15:28:56,009 INFO L272 TraceCheckUtils]: 0: Hoare triple {24829#true} call ULTIMATE.init(); {24836#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:28:56,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {24836#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {24829#true} is VALID [2022-04-27 15:28:56,010 INFO L290 TraceCheckUtils]: 2: Hoare triple {24829#true} assume true; {24829#true} is VALID [2022-04-27 15:28:56,010 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24829#true} {24829#true} #689#return; {24829#true} is VALID [2022-04-27 15:28:56,010 INFO L272 TraceCheckUtils]: 4: Hoare triple {24829#true} call #t~ret161 := main(); {24829#true} is VALID [2022-04-27 15:28:56,010 INFO L290 TraceCheckUtils]: 5: Hoare triple {24829#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; {24829#true} is VALID [2022-04-27 15:28:56,010 INFO L290 TraceCheckUtils]: 6: Hoare triple {24829#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {24829#true} is VALID [2022-04-27 15:28:56,010 INFO L272 TraceCheckUtils]: 7: Hoare triple {24829#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {24829#true} is VALID [2022-04-27 15:28:56,010 INFO L290 TraceCheckUtils]: 8: Hoare triple {24829#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); {24829#true} is VALID [2022-04-27 15:28:56,010 INFO L290 TraceCheckUtils]: 9: Hoare triple {24829#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; {24829#true} is VALID [2022-04-27 15:28:56,010 INFO L290 TraceCheckUtils]: 10: Hoare triple {24829#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; {24829#true} is VALID [2022-04-27 15:28:56,010 INFO L290 TraceCheckUtils]: 11: Hoare triple {24829#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {24829#true} is VALID [2022-04-27 15:28:56,010 INFO L290 TraceCheckUtils]: 12: Hoare triple {24829#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {24829#true} is VALID [2022-04-27 15:28:56,010 INFO L290 TraceCheckUtils]: 13: Hoare triple {24829#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {24829#true} is VALID [2022-04-27 15:28:56,010 INFO L290 TraceCheckUtils]: 14: Hoare triple {24829#true} assume !false; {24829#true} is VALID [2022-04-27 15:28:56,010 INFO L290 TraceCheckUtils]: 15: Hoare triple {24829#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); {24829#true} is VALID [2022-04-27 15:28:56,011 INFO L290 TraceCheckUtils]: 16: Hoare triple {24829#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {24829#true} is VALID [2022-04-27 15:28:56,011 INFO L290 TraceCheckUtils]: 17: Hoare triple {24829#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {24829#true} is VALID [2022-04-27 15:28:56,011 INFO L290 TraceCheckUtils]: 18: Hoare triple {24829#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {24829#true} is VALID [2022-04-27 15:28:56,011 INFO L290 TraceCheckUtils]: 19: Hoare triple {24829#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {24829#true} is VALID [2022-04-27 15:28:56,011 INFO L290 TraceCheckUtils]: 20: Hoare triple {24829#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {24829#true} is VALID [2022-04-27 15:28:56,011 INFO L290 TraceCheckUtils]: 21: Hoare triple {24829#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {24829#true} is VALID [2022-04-27 15:28:56,011 INFO L290 TraceCheckUtils]: 22: Hoare triple {24829#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {24829#true} is VALID [2022-04-27 15:28:56,011 INFO L290 TraceCheckUtils]: 23: Hoare triple {24829#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {24829#true} is VALID [2022-04-27 15:28:56,011 INFO L290 TraceCheckUtils]: 24: Hoare triple {24829#true} assume 8464 == #t~mem55;havoc #t~mem55; {24829#true} is VALID [2022-04-27 15:28:56,011 INFO L290 TraceCheckUtils]: 25: Hoare triple {24829#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; {24829#true} is VALID [2022-04-27 15:28:56,011 INFO L290 TraceCheckUtils]: 26: Hoare triple {24829#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {24829#true} is VALID [2022-04-27 15:28:56,011 INFO L290 TraceCheckUtils]: 27: Hoare triple {24829#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); {24829#true} is VALID [2022-04-27 15:28:56,011 INFO L290 TraceCheckUtils]: 28: Hoare triple {24829#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); {24829#true} is VALID [2022-04-27 15:28:56,011 INFO L290 TraceCheckUtils]: 29: Hoare triple {24829#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {24829#true} is VALID [2022-04-27 15:28:56,011 INFO L290 TraceCheckUtils]: 30: Hoare triple {24829#true} ~skip~0 := 0; {24829#true} is VALID [2022-04-27 15:28:56,011 INFO L290 TraceCheckUtils]: 31: Hoare triple {24829#true} assume !false; {24829#true} is VALID [2022-04-27 15:28:56,011 INFO L290 TraceCheckUtils]: 32: Hoare triple {24829#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); {24829#true} is VALID [2022-04-27 15:28:56,012 INFO L290 TraceCheckUtils]: 33: Hoare triple {24829#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {24829#true} is VALID [2022-04-27 15:28:56,012 INFO L290 TraceCheckUtils]: 34: Hoare triple {24829#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {24829#true} is VALID [2022-04-27 15:28:56,012 INFO L290 TraceCheckUtils]: 35: Hoare triple {24829#true} assume 8192 == #t~mem49;havoc #t~mem49; {24829#true} is VALID [2022-04-27 15:28:56,012 INFO L290 TraceCheckUtils]: 36: Hoare triple {24829#true} call write~int(1, ~s.base, 36 + ~s.offset, 4); {24829#true} is VALID [2022-04-27 15:28:56,012 INFO L290 TraceCheckUtils]: 37: Hoare triple {24829#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {24829#true} is VALID [2022-04-27 15:28:56,012 INFO L290 TraceCheckUtils]: 38: Hoare triple {24829#true} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {24829#true} is VALID [2022-04-27 15:28:56,012 INFO L290 TraceCheckUtils]: 39: Hoare triple {24829#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); {24829#true} is VALID [2022-04-27 15:28:56,012 INFO L290 TraceCheckUtils]: 40: Hoare triple {24829#true} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {24829#true} is VALID [2022-04-27 15:28:56,012 INFO L290 TraceCheckUtils]: 41: Hoare triple {24829#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); {24829#true} is VALID [2022-04-27 15:28:56,013 INFO L290 TraceCheckUtils]: 42: Hoare triple {24829#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); {24834#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:28:56,013 INFO L290 TraceCheckUtils]: 43: Hoare triple {24834#(= 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); {24834#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:28:56,014 INFO L290 TraceCheckUtils]: 44: Hoare triple {24834#(= 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; {24834#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:28:56,014 INFO L290 TraceCheckUtils]: 45: Hoare triple {24834#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {24834#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:28:56,014 INFO L290 TraceCheckUtils]: 46: Hoare triple {24834#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {24834#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:28:56,015 INFO L290 TraceCheckUtils]: 47: Hoare triple {24834#(= 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); {24834#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:28:56,015 INFO L290 TraceCheckUtils]: 48: Hoare triple {24834#(= 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); {24834#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:28:56,015 INFO L290 TraceCheckUtils]: 49: Hoare triple {24834#(= 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); {24834#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:28:56,016 INFO L290 TraceCheckUtils]: 50: Hoare triple {24834#(= 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); {24834#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:28:56,016 INFO L290 TraceCheckUtils]: 51: Hoare triple {24834#(= 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); {24834#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:28:56,016 INFO L290 TraceCheckUtils]: 52: Hoare triple {24834#(= 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); {24835#(= |ssl3_accept_#t~mem52| 8480)} is VALID [2022-04-27 15:28:56,017 INFO L290 TraceCheckUtils]: 53: Hoare triple {24835#(= |ssl3_accept_#t~mem52| 8480)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {24830#false} is VALID [2022-04-27 15:28:56,017 INFO L290 TraceCheckUtils]: 54: Hoare triple {24830#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {24830#false} is VALID [2022-04-27 15:28:56,017 INFO L290 TraceCheckUtils]: 55: Hoare triple {24830#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {24830#false} is VALID [2022-04-27 15:28:56,017 INFO L290 TraceCheckUtils]: 56: Hoare triple {24830#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {24830#false} is VALID [2022-04-27 15:28:56,017 INFO L290 TraceCheckUtils]: 57: Hoare triple {24830#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {24830#false} is VALID [2022-04-27 15:28:56,017 INFO L290 TraceCheckUtils]: 58: Hoare triple {24830#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {24830#false} is VALID [2022-04-27 15:28:56,017 INFO L290 TraceCheckUtils]: 59: Hoare triple {24830#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {24830#false} is VALID [2022-04-27 15:28:56,017 INFO L290 TraceCheckUtils]: 60: Hoare triple {24830#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {24830#false} is VALID [2022-04-27 15:28:56,017 INFO L290 TraceCheckUtils]: 61: Hoare triple {24830#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {24830#false} is VALID [2022-04-27 15:28:56,017 INFO L290 TraceCheckUtils]: 62: Hoare triple {24830#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {24830#false} is VALID [2022-04-27 15:28:56,017 INFO L290 TraceCheckUtils]: 63: Hoare triple {24830#false} assume 8528 == #t~mem62;havoc #t~mem62; {24830#false} is VALID [2022-04-27 15:28:56,017 INFO L290 TraceCheckUtils]: 64: Hoare triple {24830#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); {24830#false} is VALID [2022-04-27 15:28:56,017 INFO L290 TraceCheckUtils]: 65: Hoare triple {24830#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; {24830#false} is VALID [2022-04-27 15:28:56,017 INFO L290 TraceCheckUtils]: 66: Hoare triple {24830#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); {24830#false} is VALID [2022-04-27 15:28:56,017 INFO L290 TraceCheckUtils]: 67: Hoare triple {24830#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {24830#false} is VALID [2022-04-27 15:28:56,018 INFO L290 TraceCheckUtils]: 68: Hoare triple {24830#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {24830#false} is VALID [2022-04-27 15:28:56,018 INFO L290 TraceCheckUtils]: 69: Hoare triple {24830#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {24830#false} is VALID [2022-04-27 15:28:56,018 INFO L290 TraceCheckUtils]: 70: Hoare triple {24830#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {24830#false} is VALID [2022-04-27 15:28:56,018 INFO L290 TraceCheckUtils]: 71: Hoare triple {24830#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); {24830#false} is VALID [2022-04-27 15:28:56,018 INFO L290 TraceCheckUtils]: 72: Hoare triple {24830#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {24830#false} is VALID [2022-04-27 15:28:56,018 INFO L290 TraceCheckUtils]: 73: Hoare triple {24830#false} ~skip~0 := 0; {24830#false} is VALID [2022-04-27 15:28:56,018 INFO L290 TraceCheckUtils]: 74: Hoare triple {24830#false} assume !false; {24830#false} is VALID [2022-04-27 15:28:56,018 INFO L290 TraceCheckUtils]: 75: Hoare triple {24830#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); {24830#false} is VALID [2022-04-27 15:28:56,018 INFO L290 TraceCheckUtils]: 76: Hoare triple {24830#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {24830#false} is VALID [2022-04-27 15:28:56,018 INFO L290 TraceCheckUtils]: 77: Hoare triple {24830#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {24830#false} is VALID [2022-04-27 15:28:56,018 INFO L290 TraceCheckUtils]: 78: Hoare triple {24830#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {24830#false} is VALID [2022-04-27 15:28:56,018 INFO L290 TraceCheckUtils]: 79: Hoare triple {24830#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {24830#false} is VALID [2022-04-27 15:28:56,018 INFO L290 TraceCheckUtils]: 80: Hoare triple {24830#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {24830#false} is VALID [2022-04-27 15:28:56,018 INFO L290 TraceCheckUtils]: 81: Hoare triple {24830#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {24830#false} is VALID [2022-04-27 15:28:56,018 INFO L290 TraceCheckUtils]: 82: Hoare triple {24830#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {24830#false} is VALID [2022-04-27 15:28:56,018 INFO L290 TraceCheckUtils]: 83: Hoare triple {24830#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {24830#false} is VALID [2022-04-27 15:28:56,018 INFO L290 TraceCheckUtils]: 84: Hoare triple {24830#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {24830#false} is VALID [2022-04-27 15:28:56,019 INFO L290 TraceCheckUtils]: 85: Hoare triple {24830#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {24830#false} is VALID [2022-04-27 15:28:56,019 INFO L290 TraceCheckUtils]: 86: Hoare triple {24830#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {24830#false} is VALID [2022-04-27 15:28:56,019 INFO L290 TraceCheckUtils]: 87: Hoare triple {24830#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {24830#false} is VALID [2022-04-27 15:28:56,019 INFO L290 TraceCheckUtils]: 88: Hoare triple {24830#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {24830#false} is VALID [2022-04-27 15:28:56,019 INFO L290 TraceCheckUtils]: 89: Hoare triple {24830#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {24830#false} is VALID [2022-04-27 15:28:56,019 INFO L290 TraceCheckUtils]: 90: Hoare triple {24830#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {24830#false} is VALID [2022-04-27 15:28:56,019 INFO L290 TraceCheckUtils]: 91: Hoare triple {24830#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {24830#false} is VALID [2022-04-27 15:28:56,019 INFO L290 TraceCheckUtils]: 92: Hoare triple {24830#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {24830#false} is VALID [2022-04-27 15:28:56,019 INFO L290 TraceCheckUtils]: 93: Hoare triple {24830#false} assume 8544 == #t~mem64;havoc #t~mem64; {24830#false} is VALID [2022-04-27 15:28:56,019 INFO L290 TraceCheckUtils]: 94: Hoare triple {24830#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {24830#false} is VALID [2022-04-27 15:28:56,019 INFO L290 TraceCheckUtils]: 95: Hoare triple {24830#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); {24830#false} is VALID [2022-04-27 15:28:56,019 INFO L290 TraceCheckUtils]: 96: Hoare triple {24830#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {24830#false} is VALID [2022-04-27 15:28:56,019 INFO L290 TraceCheckUtils]: 97: Hoare triple {24830#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); {24830#false} is VALID [2022-04-27 15:28:56,019 INFO L290 TraceCheckUtils]: 98: Hoare triple {24830#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; {24830#false} is VALID [2022-04-27 15:28:56,019 INFO L290 TraceCheckUtils]: 99: Hoare triple {24830#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; {24830#false} is VALID [2022-04-27 15:28:56,019 INFO L290 TraceCheckUtils]: 100: Hoare triple {24830#false} assume 8 == ~blastFlag~0; {24830#false} is VALID [2022-04-27 15:28:56,019 INFO L290 TraceCheckUtils]: 101: Hoare triple {24830#false} assume !false; {24830#false} is VALID [2022-04-27 15:28:56,020 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 15:28:56,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:28:56,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690438335] [2022-04-27 15:28:56,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690438335] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:28:56,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:28:56,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:28:56,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779313714] [2022-04-27 15:28:56,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:28:56,021 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 102 [2022-04-27 15:28:56,021 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:28:56,021 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:56,082 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:28:56,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:28:56,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:28:56,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:28:56,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:28:56,083 INFO L87 Difference]: Start difference. First operand 299 states and 458 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:28:58,399 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:29:01,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:29:01,291 INFO L93 Difference]: Finished difference Result 584 states and 901 transitions. [2022-04-27 15:29:01,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:29:01,291 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 102 [2022-04-27 15:29:01,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:29:01,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:01,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 450 transitions. [2022-04-27 15:29:01,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:01,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 450 transitions. [2022-04-27 15:29:01,295 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 450 transitions. [2022-04-27 15:29:01,541 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 450 edges. 450 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:29:01,545 INFO L225 Difference]: With dead ends: 584 [2022-04-27 15:29:01,545 INFO L226 Difference]: Without dead ends: 311 [2022-04-27 15:29:01,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:29:01,546 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 19 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-27 15:29:01,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 568 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-04-27 15:29:01,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2022-04-27 15:29:01,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 299. [2022-04-27 15:29:01,551 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:29:01,552 INFO L82 GeneralOperation]: Start isEquivalent. First operand 311 states. Second operand has 299 states, 294 states have (on average 1.5408163265306123) internal successors, (453), 294 states have internal predecessors, (453), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:01,552 INFO L74 IsIncluded]: Start isIncluded. First operand 311 states. Second operand has 299 states, 294 states have (on average 1.5408163265306123) internal successors, (453), 294 states have internal predecessors, (453), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:01,552 INFO L87 Difference]: Start difference. First operand 311 states. Second operand has 299 states, 294 states have (on average 1.5408163265306123) internal successors, (453), 294 states have internal predecessors, (453), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:01,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:29:01,559 INFO L93 Difference]: Finished difference Result 311 states and 472 transitions. [2022-04-27 15:29:01,559 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 472 transitions. [2022-04-27 15:29:01,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:29:01,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:29:01,559 INFO L74 IsIncluded]: Start isIncluded. First operand has 299 states, 294 states have (on average 1.5408163265306123) internal successors, (453), 294 states have internal predecessors, (453), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 311 states. [2022-04-27 15:29:01,560 INFO L87 Difference]: Start difference. First operand has 299 states, 294 states have (on average 1.5408163265306123) internal successors, (453), 294 states have internal predecessors, (453), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 311 states. [2022-04-27 15:29:01,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:29:01,564 INFO L93 Difference]: Finished difference Result 311 states and 472 transitions. [2022-04-27 15:29:01,564 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 472 transitions. [2022-04-27 15:29:01,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:29:01,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:29:01,564 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:29:01,564 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:29:01,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.5408163265306123) internal successors, (453), 294 states have internal predecessors, (453), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:01,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 457 transitions. [2022-04-27 15:29:01,568 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 457 transitions. Word has length 102 [2022-04-27 15:29:01,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:29:01,568 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 457 transitions. [2022-04-27 15:29:01,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:01,569 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 457 transitions. [2022-04-27 15:29:01,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-27 15:29:01,569 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:29:01,569 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:29:01,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-27 15:29:01,570 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:29:01,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:29:01,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1460823327, now seen corresponding path program 1 times [2022-04-27 15:29:01,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:29:01,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156039370] [2022-04-27 15:29:01,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:29:01,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:29:01,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:29:01,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:29:01,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:29:01,686 INFO L290 TraceCheckUtils]: 0: Hoare triple {26468#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {26461#true} is VALID [2022-04-27 15:29:01,686 INFO L290 TraceCheckUtils]: 1: Hoare triple {26461#true} assume true; {26461#true} is VALID [2022-04-27 15:29:01,686 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26461#true} {26461#true} #689#return; {26461#true} is VALID [2022-04-27 15:29:01,687 INFO L272 TraceCheckUtils]: 0: Hoare triple {26461#true} call ULTIMATE.init(); {26468#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:29:01,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {26468#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {26461#true} is VALID [2022-04-27 15:29:01,687 INFO L290 TraceCheckUtils]: 2: Hoare triple {26461#true} assume true; {26461#true} is VALID [2022-04-27 15:29:01,687 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26461#true} {26461#true} #689#return; {26461#true} is VALID [2022-04-27 15:29:01,687 INFO L272 TraceCheckUtils]: 4: Hoare triple {26461#true} call #t~ret161 := main(); {26461#true} is VALID [2022-04-27 15:29:01,687 INFO L290 TraceCheckUtils]: 5: Hoare triple {26461#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; {26461#true} is VALID [2022-04-27 15:29:01,687 INFO L290 TraceCheckUtils]: 6: Hoare triple {26461#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {26461#true} is VALID [2022-04-27 15:29:01,687 INFO L272 TraceCheckUtils]: 7: Hoare triple {26461#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {26461#true} is VALID [2022-04-27 15:29:01,687 INFO L290 TraceCheckUtils]: 8: Hoare triple {26461#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); {26461#true} is VALID [2022-04-27 15:29:01,687 INFO L290 TraceCheckUtils]: 9: Hoare triple {26461#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; {26461#true} is VALID [2022-04-27 15:29:01,687 INFO L290 TraceCheckUtils]: 10: Hoare triple {26461#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; {26461#true} is VALID [2022-04-27 15:29:01,687 INFO L290 TraceCheckUtils]: 11: Hoare triple {26461#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {26461#true} is VALID [2022-04-27 15:29:01,687 INFO L290 TraceCheckUtils]: 12: Hoare triple {26461#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {26461#true} is VALID [2022-04-27 15:29:01,687 INFO L290 TraceCheckUtils]: 13: Hoare triple {26461#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {26461#true} is VALID [2022-04-27 15:29:01,688 INFO L290 TraceCheckUtils]: 14: Hoare triple {26461#true} assume !false; {26461#true} is VALID [2022-04-27 15:29:01,688 INFO L290 TraceCheckUtils]: 15: Hoare triple {26461#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); {26461#true} is VALID [2022-04-27 15:29:01,688 INFO L290 TraceCheckUtils]: 16: Hoare triple {26461#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {26461#true} is VALID [2022-04-27 15:29:01,688 INFO L290 TraceCheckUtils]: 17: Hoare triple {26461#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {26461#true} is VALID [2022-04-27 15:29:01,688 INFO L290 TraceCheckUtils]: 18: Hoare triple {26461#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {26461#true} is VALID [2022-04-27 15:29:01,688 INFO L290 TraceCheckUtils]: 19: Hoare triple {26461#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {26461#true} is VALID [2022-04-27 15:29:01,688 INFO L290 TraceCheckUtils]: 20: Hoare triple {26461#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {26461#true} is VALID [2022-04-27 15:29:01,688 INFO L290 TraceCheckUtils]: 21: Hoare triple {26461#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {26461#true} is VALID [2022-04-27 15:29:01,688 INFO L290 TraceCheckUtils]: 22: Hoare triple {26461#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {26461#true} is VALID [2022-04-27 15:29:01,688 INFO L290 TraceCheckUtils]: 23: Hoare triple {26461#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {26461#true} is VALID [2022-04-27 15:29:01,688 INFO L290 TraceCheckUtils]: 24: Hoare triple {26461#true} assume 8464 == #t~mem55;havoc #t~mem55; {26461#true} is VALID [2022-04-27 15:29:01,688 INFO L290 TraceCheckUtils]: 25: Hoare triple {26461#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; {26461#true} is VALID [2022-04-27 15:29:01,688 INFO L290 TraceCheckUtils]: 26: Hoare triple {26461#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {26461#true} is VALID [2022-04-27 15:29:01,689 INFO L290 TraceCheckUtils]: 27: Hoare triple {26461#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); {26466#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:01,689 INFO L290 TraceCheckUtils]: 28: Hoare triple {26466#(= 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); {26466#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:01,690 INFO L290 TraceCheckUtils]: 29: Hoare triple {26466#(= 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; {26466#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:01,690 INFO L290 TraceCheckUtils]: 30: Hoare triple {26466#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {26466#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:01,690 INFO L290 TraceCheckUtils]: 31: Hoare triple {26466#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {26466#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:01,691 INFO L290 TraceCheckUtils]: 32: Hoare triple {26466#(= 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); {26466#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:01,691 INFO L290 TraceCheckUtils]: 33: Hoare triple {26466#(= 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); {26466#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:01,691 INFO L290 TraceCheckUtils]: 34: Hoare triple {26466#(= 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); {26467#(= |ssl3_accept_#t~mem49| 8496)} is VALID [2022-04-27 15:29:01,692 INFO L290 TraceCheckUtils]: 35: Hoare triple {26467#(= |ssl3_accept_#t~mem49| 8496)} assume 8192 == #t~mem49;havoc #t~mem49; {26462#false} is VALID [2022-04-27 15:29:01,692 INFO L290 TraceCheckUtils]: 36: Hoare triple {26462#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {26462#false} is VALID [2022-04-27 15:29:01,692 INFO L290 TraceCheckUtils]: 37: Hoare triple {26462#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {26462#false} is VALID [2022-04-27 15:29:01,692 INFO L290 TraceCheckUtils]: 38: Hoare triple {26462#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {26462#false} is VALID [2022-04-27 15:29:01,692 INFO L290 TraceCheckUtils]: 39: Hoare triple {26462#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); {26462#false} is VALID [2022-04-27 15:29:01,692 INFO L290 TraceCheckUtils]: 40: Hoare triple {26462#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {26462#false} is VALID [2022-04-27 15:29:01,692 INFO L290 TraceCheckUtils]: 41: Hoare triple {26462#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); {26462#false} is VALID [2022-04-27 15:29:01,692 INFO L290 TraceCheckUtils]: 42: Hoare triple {26462#false} assume 12292 != #t~mem85;havoc #t~mem85; {26462#false} is VALID [2022-04-27 15:29:01,692 INFO L290 TraceCheckUtils]: 43: Hoare triple {26462#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; {26462#false} is VALID [2022-04-27 15:29:01,692 INFO L290 TraceCheckUtils]: 44: Hoare triple {26462#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); {26462#false} is VALID [2022-04-27 15:29:01,692 INFO L290 TraceCheckUtils]: 45: Hoare triple {26462#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {26462#false} is VALID [2022-04-27 15:29:01,692 INFO L290 TraceCheckUtils]: 46: Hoare triple {26462#false} ~skip~0 := 0; {26462#false} is VALID [2022-04-27 15:29:01,693 INFO L290 TraceCheckUtils]: 47: Hoare triple {26462#false} assume !false; {26462#false} is VALID [2022-04-27 15:29:01,693 INFO L290 TraceCheckUtils]: 48: Hoare triple {26462#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); {26462#false} is VALID [2022-04-27 15:29:01,693 INFO L290 TraceCheckUtils]: 49: Hoare triple {26462#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {26462#false} is VALID [2022-04-27 15:29:01,693 INFO L290 TraceCheckUtils]: 50: Hoare triple {26462#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {26462#false} is VALID [2022-04-27 15:29:01,693 INFO L290 TraceCheckUtils]: 51: Hoare triple {26462#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {26462#false} is VALID [2022-04-27 15:29:01,693 INFO L290 TraceCheckUtils]: 52: Hoare triple {26462#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {26462#false} is VALID [2022-04-27 15:29:01,693 INFO L290 TraceCheckUtils]: 53: Hoare triple {26462#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {26462#false} is VALID [2022-04-27 15:29:01,693 INFO L290 TraceCheckUtils]: 54: Hoare triple {26462#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {26462#false} is VALID [2022-04-27 15:29:01,693 INFO L290 TraceCheckUtils]: 55: Hoare triple {26462#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {26462#false} is VALID [2022-04-27 15:29:01,693 INFO L290 TraceCheckUtils]: 56: Hoare triple {26462#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {26462#false} is VALID [2022-04-27 15:29:01,693 INFO L290 TraceCheckUtils]: 57: Hoare triple {26462#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {26462#false} is VALID [2022-04-27 15:29:01,693 INFO L290 TraceCheckUtils]: 58: Hoare triple {26462#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {26462#false} is VALID [2022-04-27 15:29:01,693 INFO L290 TraceCheckUtils]: 59: Hoare triple {26462#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {26462#false} is VALID [2022-04-27 15:29:01,693 INFO L290 TraceCheckUtils]: 60: Hoare triple {26462#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {26462#false} is VALID [2022-04-27 15:29:01,693 INFO L290 TraceCheckUtils]: 61: Hoare triple {26462#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {26462#false} is VALID [2022-04-27 15:29:01,693 INFO L290 TraceCheckUtils]: 62: Hoare triple {26462#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {26462#false} is VALID [2022-04-27 15:29:01,694 INFO L290 TraceCheckUtils]: 63: Hoare triple {26462#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {26462#false} is VALID [2022-04-27 15:29:01,694 INFO L290 TraceCheckUtils]: 64: Hoare triple {26462#false} assume 8528 == #t~mem62;havoc #t~mem62; {26462#false} is VALID [2022-04-27 15:29:01,694 INFO L290 TraceCheckUtils]: 65: Hoare triple {26462#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); {26462#false} is VALID [2022-04-27 15:29:01,694 INFO L290 TraceCheckUtils]: 66: Hoare triple {26462#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; {26462#false} is VALID [2022-04-27 15:29:01,694 INFO L290 TraceCheckUtils]: 67: Hoare triple {26462#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); {26462#false} is VALID [2022-04-27 15:29:01,694 INFO L290 TraceCheckUtils]: 68: Hoare triple {26462#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {26462#false} is VALID [2022-04-27 15:29:01,694 INFO L290 TraceCheckUtils]: 69: Hoare triple {26462#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {26462#false} is VALID [2022-04-27 15:29:01,694 INFO L290 TraceCheckUtils]: 70: Hoare triple {26462#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {26462#false} is VALID [2022-04-27 15:29:01,694 INFO L290 TraceCheckUtils]: 71: Hoare triple {26462#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {26462#false} is VALID [2022-04-27 15:29:01,694 INFO L290 TraceCheckUtils]: 72: Hoare triple {26462#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); {26462#false} is VALID [2022-04-27 15:29:01,694 INFO L290 TraceCheckUtils]: 73: Hoare triple {26462#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {26462#false} is VALID [2022-04-27 15:29:01,694 INFO L290 TraceCheckUtils]: 74: Hoare triple {26462#false} ~skip~0 := 0; {26462#false} is VALID [2022-04-27 15:29:01,694 INFO L290 TraceCheckUtils]: 75: Hoare triple {26462#false} assume !false; {26462#false} is VALID [2022-04-27 15:29:01,694 INFO L290 TraceCheckUtils]: 76: Hoare triple {26462#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); {26462#false} is VALID [2022-04-27 15:29:01,694 INFO L290 TraceCheckUtils]: 77: Hoare triple {26462#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {26462#false} is VALID [2022-04-27 15:29:01,694 INFO L290 TraceCheckUtils]: 78: Hoare triple {26462#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {26462#false} is VALID [2022-04-27 15:29:01,694 INFO L290 TraceCheckUtils]: 79: Hoare triple {26462#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {26462#false} is VALID [2022-04-27 15:29:01,695 INFO L290 TraceCheckUtils]: 80: Hoare triple {26462#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {26462#false} is VALID [2022-04-27 15:29:01,695 INFO L290 TraceCheckUtils]: 81: Hoare triple {26462#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {26462#false} is VALID [2022-04-27 15:29:01,695 INFO L290 TraceCheckUtils]: 82: Hoare triple {26462#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {26462#false} is VALID [2022-04-27 15:29:01,695 INFO L290 TraceCheckUtils]: 83: Hoare triple {26462#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {26462#false} is VALID [2022-04-27 15:29:01,695 INFO L290 TraceCheckUtils]: 84: Hoare triple {26462#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {26462#false} is VALID [2022-04-27 15:29:01,695 INFO L290 TraceCheckUtils]: 85: Hoare triple {26462#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {26462#false} is VALID [2022-04-27 15:29:01,695 INFO L290 TraceCheckUtils]: 86: Hoare triple {26462#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {26462#false} is VALID [2022-04-27 15:29:01,695 INFO L290 TraceCheckUtils]: 87: Hoare triple {26462#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {26462#false} is VALID [2022-04-27 15:29:01,695 INFO L290 TraceCheckUtils]: 88: Hoare triple {26462#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {26462#false} is VALID [2022-04-27 15:29:01,695 INFO L290 TraceCheckUtils]: 89: Hoare triple {26462#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {26462#false} is VALID [2022-04-27 15:29:01,695 INFO L290 TraceCheckUtils]: 90: Hoare triple {26462#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {26462#false} is VALID [2022-04-27 15:29:01,695 INFO L290 TraceCheckUtils]: 91: Hoare triple {26462#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {26462#false} is VALID [2022-04-27 15:29:01,695 INFO L290 TraceCheckUtils]: 92: Hoare triple {26462#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {26462#false} is VALID [2022-04-27 15:29:01,695 INFO L290 TraceCheckUtils]: 93: Hoare triple {26462#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {26462#false} is VALID [2022-04-27 15:29:01,695 INFO L290 TraceCheckUtils]: 94: Hoare triple {26462#false} assume 8544 == #t~mem64;havoc #t~mem64; {26462#false} is VALID [2022-04-27 15:29:01,695 INFO L290 TraceCheckUtils]: 95: Hoare triple {26462#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {26462#false} is VALID [2022-04-27 15:29:01,695 INFO L290 TraceCheckUtils]: 96: Hoare triple {26462#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); {26462#false} is VALID [2022-04-27 15:29:01,696 INFO L290 TraceCheckUtils]: 97: Hoare triple {26462#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {26462#false} is VALID [2022-04-27 15:29:01,696 INFO L290 TraceCheckUtils]: 98: Hoare triple {26462#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); {26462#false} is VALID [2022-04-27 15:29:01,696 INFO L290 TraceCheckUtils]: 99: Hoare triple {26462#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; {26462#false} is VALID [2022-04-27 15:29:01,696 INFO L290 TraceCheckUtils]: 100: Hoare triple {26462#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; {26462#false} is VALID [2022-04-27 15:29:01,696 INFO L290 TraceCheckUtils]: 101: Hoare triple {26462#false} assume 8 == ~blastFlag~0; {26462#false} is VALID [2022-04-27 15:29:01,696 INFO L290 TraceCheckUtils]: 102: Hoare triple {26462#false} assume !false; {26462#false} is VALID [2022-04-27 15:29:01,696 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-27 15:29:01,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:29:01,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156039370] [2022-04-27 15:29:01,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156039370] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:29:01,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:29:01,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:29:01,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813350091] [2022-04-27 15:29:01,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:29:01,697 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 103 [2022-04-27 15:29:01,697 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:29:01,697 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:01,764 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:29:01,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:29:01,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:29:01,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:29:01,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:29:01,765 INFO L87 Difference]: Start difference. First operand 299 states and 457 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:08,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:29:08,033 INFO L93 Difference]: Finished difference Result 589 states and 907 transitions. [2022-04-27 15:29:08,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:29:08,033 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 103 [2022-04-27 15:29:08,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:29:08,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:08,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 466 transitions. [2022-04-27 15:29:08,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:08,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 466 transitions. [2022-04-27 15:29:08,037 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 466 transitions. [2022-04-27 15:29:08,330 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 466 edges. 466 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:29:08,334 INFO L225 Difference]: With dead ends: 589 [2022-04-27 15:29:08,334 INFO L226 Difference]: Without dead ends: 316 [2022-04-27 15:29:08,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:29:08,335 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 36 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s 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, 2.6s IncrementalHoareTripleChecker+Time [2022-04-27 15:29:08,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 511 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-04-27 15:29:08,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2022-04-27 15:29:08,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 299. [2022-04-27 15:29:08,340 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:29:08,341 INFO L82 GeneralOperation]: Start isEquivalent. First operand 316 states. Second operand has 299 states, 294 states have (on average 1.5374149659863945) internal successors, (452), 294 states have internal predecessors, (452), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:08,341 INFO L74 IsIncluded]: Start isIncluded. First operand 316 states. Second operand has 299 states, 294 states have (on average 1.5374149659863945) internal successors, (452), 294 states have internal predecessors, (452), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:08,341 INFO L87 Difference]: Start difference. First operand 316 states. Second operand has 299 states, 294 states have (on average 1.5374149659863945) internal successors, (452), 294 states have internal predecessors, (452), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:08,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:29:08,345 INFO L93 Difference]: Finished difference Result 316 states and 479 transitions. [2022-04-27 15:29:08,345 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 479 transitions. [2022-04-27 15:29:08,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:29:08,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:29:08,345 INFO L74 IsIncluded]: Start isIncluded. First operand has 299 states, 294 states have (on average 1.5374149659863945) internal successors, (452), 294 states have internal predecessors, (452), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 316 states. [2022-04-27 15:29:08,346 INFO L87 Difference]: Start difference. First operand has 299 states, 294 states have (on average 1.5374149659863945) internal successors, (452), 294 states have internal predecessors, (452), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 316 states. [2022-04-27 15:29:08,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:29:08,349 INFO L93 Difference]: Finished difference Result 316 states and 479 transitions. [2022-04-27 15:29:08,349 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 479 transitions. [2022-04-27 15:29:08,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:29:08,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:29:08,350 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:29:08,350 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:29:08,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.5374149659863945) internal successors, (452), 294 states have internal predecessors, (452), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:08,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 456 transitions. [2022-04-27 15:29:08,354 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 456 transitions. Word has length 103 [2022-04-27 15:29:08,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:29:08,354 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 456 transitions. [2022-04-27 15:29:08,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:08,354 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 456 transitions. [2022-04-27 15:29:08,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-27 15:29:08,355 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:29:08,355 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:29:08,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-27 15:29:08,355 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:29:08,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:29:08,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1486400636, now seen corresponding path program 1 times [2022-04-27 15:29:08,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:29:08,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357490329] [2022-04-27 15:29:08,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:29:08,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:29:08,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:29:08,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:29:08,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:29:08,454 INFO L290 TraceCheckUtils]: 0: Hoare triple {28116#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {28109#true} is VALID [2022-04-27 15:29:08,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {28109#true} assume true; {28109#true} is VALID [2022-04-27 15:29:08,454 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28109#true} {28109#true} #689#return; {28109#true} is VALID [2022-04-27 15:29:08,455 INFO L272 TraceCheckUtils]: 0: Hoare triple {28109#true} call ULTIMATE.init(); {28116#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:29:08,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {28116#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {28109#true} is VALID [2022-04-27 15:29:08,455 INFO L290 TraceCheckUtils]: 2: Hoare triple {28109#true} assume true; {28109#true} is VALID [2022-04-27 15:29:08,455 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28109#true} {28109#true} #689#return; {28109#true} is VALID [2022-04-27 15:29:08,455 INFO L272 TraceCheckUtils]: 4: Hoare triple {28109#true} call #t~ret161 := main(); {28109#true} is VALID [2022-04-27 15:29:08,455 INFO L290 TraceCheckUtils]: 5: Hoare triple {28109#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; {28109#true} is VALID [2022-04-27 15:29:08,455 INFO L290 TraceCheckUtils]: 6: Hoare triple {28109#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {28109#true} is VALID [2022-04-27 15:29:08,455 INFO L272 TraceCheckUtils]: 7: Hoare triple {28109#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {28109#true} is VALID [2022-04-27 15:29:08,455 INFO L290 TraceCheckUtils]: 8: Hoare triple {28109#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); {28109#true} is VALID [2022-04-27 15:29:08,456 INFO L290 TraceCheckUtils]: 9: Hoare triple {28109#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; {28109#true} is VALID [2022-04-27 15:29:08,456 INFO L290 TraceCheckUtils]: 10: Hoare triple {28109#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; {28109#true} is VALID [2022-04-27 15:29:08,456 INFO L290 TraceCheckUtils]: 11: Hoare triple {28109#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {28109#true} is VALID [2022-04-27 15:29:08,456 INFO L290 TraceCheckUtils]: 12: Hoare triple {28109#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {28109#true} is VALID [2022-04-27 15:29:08,456 INFO L290 TraceCheckUtils]: 13: Hoare triple {28109#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {28109#true} is VALID [2022-04-27 15:29:08,456 INFO L290 TraceCheckUtils]: 14: Hoare triple {28109#true} assume !false; {28109#true} is VALID [2022-04-27 15:29:08,456 INFO L290 TraceCheckUtils]: 15: Hoare triple {28109#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); {28109#true} is VALID [2022-04-27 15:29:08,456 INFO L290 TraceCheckUtils]: 16: Hoare triple {28109#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {28109#true} is VALID [2022-04-27 15:29:08,456 INFO L290 TraceCheckUtils]: 17: Hoare triple {28109#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {28109#true} is VALID [2022-04-27 15:29:08,456 INFO L290 TraceCheckUtils]: 18: Hoare triple {28109#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {28109#true} is VALID [2022-04-27 15:29:08,456 INFO L290 TraceCheckUtils]: 19: Hoare triple {28109#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {28109#true} is VALID [2022-04-27 15:29:08,456 INFO L290 TraceCheckUtils]: 20: Hoare triple {28109#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {28109#true} is VALID [2022-04-27 15:29:08,456 INFO L290 TraceCheckUtils]: 21: Hoare triple {28109#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {28109#true} is VALID [2022-04-27 15:29:08,456 INFO L290 TraceCheckUtils]: 22: Hoare triple {28109#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {28109#true} is VALID [2022-04-27 15:29:08,456 INFO L290 TraceCheckUtils]: 23: Hoare triple {28109#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {28109#true} is VALID [2022-04-27 15:29:08,456 INFO L290 TraceCheckUtils]: 24: Hoare triple {28109#true} assume 8464 == #t~mem55;havoc #t~mem55; {28109#true} is VALID [2022-04-27 15:29:08,457 INFO L290 TraceCheckUtils]: 25: Hoare triple {28109#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; {28109#true} is VALID [2022-04-27 15:29:08,457 INFO L290 TraceCheckUtils]: 26: Hoare triple {28109#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {28109#true} is VALID [2022-04-27 15:29:08,457 INFO L290 TraceCheckUtils]: 27: Hoare triple {28109#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); {28114#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:08,458 INFO L290 TraceCheckUtils]: 28: Hoare triple {28114#(= 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); {28114#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:08,458 INFO L290 TraceCheckUtils]: 29: Hoare triple {28114#(= 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; {28114#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:08,458 INFO L290 TraceCheckUtils]: 30: Hoare triple {28114#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {28114#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:08,459 INFO L290 TraceCheckUtils]: 31: Hoare triple {28114#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {28114#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:08,459 INFO L290 TraceCheckUtils]: 32: Hoare triple {28114#(= 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); {28114#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:08,459 INFO L290 TraceCheckUtils]: 33: Hoare triple {28114#(= 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); {28114#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:08,460 INFO L290 TraceCheckUtils]: 34: Hoare triple {28114#(= 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); {28114#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:08,460 INFO L290 TraceCheckUtils]: 35: Hoare triple {28114#(= 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); {28114#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:08,460 INFO L290 TraceCheckUtils]: 36: Hoare triple {28114#(= 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); {28115#(= |ssl3_accept_#t~mem51| 8496)} is VALID [2022-04-27 15:29:08,461 INFO L290 TraceCheckUtils]: 37: Hoare triple {28115#(= |ssl3_accept_#t~mem51| 8496)} assume 8195 == #t~mem51;havoc #t~mem51; {28110#false} is VALID [2022-04-27 15:29:08,461 INFO L290 TraceCheckUtils]: 38: Hoare triple {28110#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {28110#false} is VALID [2022-04-27 15:29:08,461 INFO L290 TraceCheckUtils]: 39: Hoare triple {28110#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {28110#false} is VALID [2022-04-27 15:29:08,461 INFO L290 TraceCheckUtils]: 40: Hoare triple {28110#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {28110#false} is VALID [2022-04-27 15:29:08,461 INFO L290 TraceCheckUtils]: 41: Hoare triple {28110#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); {28110#false} is VALID [2022-04-27 15:29:08,461 INFO L290 TraceCheckUtils]: 42: Hoare triple {28110#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {28110#false} is VALID [2022-04-27 15:29:08,461 INFO L290 TraceCheckUtils]: 43: Hoare triple {28110#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); {28110#false} is VALID [2022-04-27 15:29:08,461 INFO L290 TraceCheckUtils]: 44: Hoare triple {28110#false} assume 12292 != #t~mem85;havoc #t~mem85; {28110#false} is VALID [2022-04-27 15:29:08,461 INFO L290 TraceCheckUtils]: 45: Hoare triple {28110#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; {28110#false} is VALID [2022-04-27 15:29:08,461 INFO L290 TraceCheckUtils]: 46: Hoare triple {28110#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); {28110#false} is VALID [2022-04-27 15:29:08,461 INFO L290 TraceCheckUtils]: 47: Hoare triple {28110#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {28110#false} is VALID [2022-04-27 15:29:08,461 INFO L290 TraceCheckUtils]: 48: Hoare triple {28110#false} ~skip~0 := 0; {28110#false} is VALID [2022-04-27 15:29:08,461 INFO L290 TraceCheckUtils]: 49: Hoare triple {28110#false} assume !false; {28110#false} is VALID [2022-04-27 15:29:08,461 INFO L290 TraceCheckUtils]: 50: Hoare triple {28110#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); {28110#false} is VALID [2022-04-27 15:29:08,461 INFO L290 TraceCheckUtils]: 51: Hoare triple {28110#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {28110#false} is VALID [2022-04-27 15:29:08,462 INFO L290 TraceCheckUtils]: 52: Hoare triple {28110#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {28110#false} is VALID [2022-04-27 15:29:08,462 INFO L290 TraceCheckUtils]: 53: Hoare triple {28110#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {28110#false} is VALID [2022-04-27 15:29:08,462 INFO L290 TraceCheckUtils]: 54: Hoare triple {28110#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {28110#false} is VALID [2022-04-27 15:29:08,462 INFO L290 TraceCheckUtils]: 55: Hoare triple {28110#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {28110#false} is VALID [2022-04-27 15:29:08,462 INFO L290 TraceCheckUtils]: 56: Hoare triple {28110#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {28110#false} is VALID [2022-04-27 15:29:08,462 INFO L290 TraceCheckUtils]: 57: Hoare triple {28110#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {28110#false} is VALID [2022-04-27 15:29:08,462 INFO L290 TraceCheckUtils]: 58: Hoare triple {28110#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {28110#false} is VALID [2022-04-27 15:29:08,462 INFO L290 TraceCheckUtils]: 59: Hoare triple {28110#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {28110#false} is VALID [2022-04-27 15:29:08,462 INFO L290 TraceCheckUtils]: 60: Hoare triple {28110#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {28110#false} is VALID [2022-04-27 15:29:08,462 INFO L290 TraceCheckUtils]: 61: Hoare triple {28110#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {28110#false} is VALID [2022-04-27 15:29:08,462 INFO L290 TraceCheckUtils]: 62: Hoare triple {28110#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {28110#false} is VALID [2022-04-27 15:29:08,462 INFO L290 TraceCheckUtils]: 63: Hoare triple {28110#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {28110#false} is VALID [2022-04-27 15:29:08,462 INFO L290 TraceCheckUtils]: 64: Hoare triple {28110#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {28110#false} is VALID [2022-04-27 15:29:08,462 INFO L290 TraceCheckUtils]: 65: Hoare triple {28110#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {28110#false} is VALID [2022-04-27 15:29:08,462 INFO L290 TraceCheckUtils]: 66: Hoare triple {28110#false} assume 8528 == #t~mem62;havoc #t~mem62; {28110#false} is VALID [2022-04-27 15:29:08,462 INFO L290 TraceCheckUtils]: 67: Hoare triple {28110#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); {28110#false} is VALID [2022-04-27 15:29:08,462 INFO L290 TraceCheckUtils]: 68: Hoare triple {28110#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; {28110#false} is VALID [2022-04-27 15:29:08,463 INFO L290 TraceCheckUtils]: 69: Hoare triple {28110#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); {28110#false} is VALID [2022-04-27 15:29:08,463 INFO L290 TraceCheckUtils]: 70: Hoare triple {28110#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {28110#false} is VALID [2022-04-27 15:29:08,463 INFO L290 TraceCheckUtils]: 71: Hoare triple {28110#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {28110#false} is VALID [2022-04-27 15:29:08,463 INFO L290 TraceCheckUtils]: 72: Hoare triple {28110#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {28110#false} is VALID [2022-04-27 15:29:08,463 INFO L290 TraceCheckUtils]: 73: Hoare triple {28110#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {28110#false} is VALID [2022-04-27 15:29:08,463 INFO L290 TraceCheckUtils]: 74: Hoare triple {28110#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); {28110#false} is VALID [2022-04-27 15:29:08,463 INFO L290 TraceCheckUtils]: 75: Hoare triple {28110#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {28110#false} is VALID [2022-04-27 15:29:08,463 INFO L290 TraceCheckUtils]: 76: Hoare triple {28110#false} ~skip~0 := 0; {28110#false} is VALID [2022-04-27 15:29:08,463 INFO L290 TraceCheckUtils]: 77: Hoare triple {28110#false} assume !false; {28110#false} is VALID [2022-04-27 15:29:08,463 INFO L290 TraceCheckUtils]: 78: Hoare triple {28110#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); {28110#false} is VALID [2022-04-27 15:29:08,463 INFO L290 TraceCheckUtils]: 79: Hoare triple {28110#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {28110#false} is VALID [2022-04-27 15:29:08,463 INFO L290 TraceCheckUtils]: 80: Hoare triple {28110#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {28110#false} is VALID [2022-04-27 15:29:08,463 INFO L290 TraceCheckUtils]: 81: Hoare triple {28110#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {28110#false} is VALID [2022-04-27 15:29:08,463 INFO L290 TraceCheckUtils]: 82: Hoare triple {28110#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {28110#false} is VALID [2022-04-27 15:29:08,463 INFO L290 TraceCheckUtils]: 83: Hoare triple {28110#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {28110#false} is VALID [2022-04-27 15:29:08,463 INFO L290 TraceCheckUtils]: 84: Hoare triple {28110#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {28110#false} is VALID [2022-04-27 15:29:08,464 INFO L290 TraceCheckUtils]: 85: Hoare triple {28110#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {28110#false} is VALID [2022-04-27 15:29:08,464 INFO L290 TraceCheckUtils]: 86: Hoare triple {28110#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {28110#false} is VALID [2022-04-27 15:29:08,464 INFO L290 TraceCheckUtils]: 87: Hoare triple {28110#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {28110#false} is VALID [2022-04-27 15:29:08,464 INFO L290 TraceCheckUtils]: 88: Hoare triple {28110#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {28110#false} is VALID [2022-04-27 15:29:08,464 INFO L290 TraceCheckUtils]: 89: Hoare triple {28110#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {28110#false} is VALID [2022-04-27 15:29:08,464 INFO L290 TraceCheckUtils]: 90: Hoare triple {28110#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {28110#false} is VALID [2022-04-27 15:29:08,464 INFO L290 TraceCheckUtils]: 91: Hoare triple {28110#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {28110#false} is VALID [2022-04-27 15:29:08,464 INFO L290 TraceCheckUtils]: 92: Hoare triple {28110#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {28110#false} is VALID [2022-04-27 15:29:08,464 INFO L290 TraceCheckUtils]: 93: Hoare triple {28110#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {28110#false} is VALID [2022-04-27 15:29:08,464 INFO L290 TraceCheckUtils]: 94: Hoare triple {28110#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {28110#false} is VALID [2022-04-27 15:29:08,464 INFO L290 TraceCheckUtils]: 95: Hoare triple {28110#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {28110#false} is VALID [2022-04-27 15:29:08,464 INFO L290 TraceCheckUtils]: 96: Hoare triple {28110#false} assume 8544 == #t~mem64;havoc #t~mem64; {28110#false} is VALID [2022-04-27 15:29:08,464 INFO L290 TraceCheckUtils]: 97: Hoare triple {28110#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {28110#false} is VALID [2022-04-27 15:29:08,464 INFO L290 TraceCheckUtils]: 98: Hoare triple {28110#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); {28110#false} is VALID [2022-04-27 15:29:08,464 INFO L290 TraceCheckUtils]: 99: Hoare triple {28110#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {28110#false} is VALID [2022-04-27 15:29:08,464 INFO L290 TraceCheckUtils]: 100: Hoare triple {28110#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); {28110#false} is VALID [2022-04-27 15:29:08,465 INFO L290 TraceCheckUtils]: 101: Hoare triple {28110#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; {28110#false} is VALID [2022-04-27 15:29:08,465 INFO L290 TraceCheckUtils]: 102: Hoare triple {28110#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; {28110#false} is VALID [2022-04-27 15:29:08,465 INFO L290 TraceCheckUtils]: 103: Hoare triple {28110#false} assume 8 == ~blastFlag~0; {28110#false} is VALID [2022-04-27 15:29:08,465 INFO L290 TraceCheckUtils]: 104: Hoare triple {28110#false} assume !false; {28110#false} is VALID [2022-04-27 15:29:08,465 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-27 15:29:08,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:29:08,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357490329] [2022-04-27 15:29:08,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357490329] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:29:08,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:29:08,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:29:08,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444145719] [2022-04-27 15:29:08,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:29:08,467 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 105 [2022-04-27 15:29:08,467 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:29:08,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:08,522 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:29:08,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:29:08,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:29:08,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:29:08,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:29:08,523 INFO L87 Difference]: Start difference. First operand 299 states and 456 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:12,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:29:12,188 INFO L93 Difference]: Finished difference Result 579 states and 892 transitions. [2022-04-27 15:29:12,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:29:12,188 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 105 [2022-04-27 15:29:12,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:29:12,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:12,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 452 transitions. [2022-04-27 15:29:12,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:12,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 452 transitions. [2022-04-27 15:29:12,194 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 452 transitions. [2022-04-27 15:29:12,399 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 452 edges. 452 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:29:12,403 INFO L225 Difference]: With dead ends: 579 [2022-04-27 15:29:12,403 INFO L226 Difference]: Without dead ends: 306 [2022-04-27 15:29:12,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:29:12,404 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 26 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-27 15:29:12,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 525 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-27 15:29:12,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-04-27 15:29:12,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 299. [2022-04-27 15:29:12,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:29:12,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-27 15:29:12,408 INFO L74 IsIncluded]: Start isIncluded. First operand 306 states. Second operand has 299 states, 294 states have (on average 1.534013605442177) internal successors, (451), 294 states have internal predecessors, (451), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:12,408 INFO L87 Difference]: Start difference. First operand 306 states. Second operand has 299 states, 294 states have (on average 1.534013605442177) internal successors, (451), 294 states have internal predecessors, (451), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:12,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:29:12,412 INFO L93 Difference]: Finished difference Result 306 states and 465 transitions. [2022-04-27 15:29:12,412 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 465 transitions. [2022-04-27 15:29:12,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:29:12,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:29:12,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-27 15:29:12,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-27 15:29:12,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:29:12,416 INFO L93 Difference]: Finished difference Result 306 states and 465 transitions. [2022-04-27 15:29:12,416 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 465 transitions. [2022-04-27 15:29:12,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:29:12,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:29:12,417 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:29:12,417 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:29:12,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.534013605442177) internal successors, (451), 294 states have internal predecessors, (451), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:12,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 455 transitions. [2022-04-27 15:29:12,421 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 455 transitions. Word has length 105 [2022-04-27 15:29:12,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:29:12,421 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 455 transitions. [2022-04-27 15:29:12,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:12,421 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 455 transitions. [2022-04-27 15:29:12,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-04-27 15:29:12,422 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:29:12,422 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:29:12,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-27 15:29:12,422 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:29:12,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:29:12,422 INFO L85 PathProgramCache]: Analyzing trace with hash -541256236, now seen corresponding path program 1 times [2022-04-27 15:29:12,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:29:12,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776757404] [2022-04-27 15:29:12,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:29:12,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:29:12,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:29:12,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:29:12,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:29:12,516 INFO L290 TraceCheckUtils]: 0: Hoare triple {29733#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {29726#true} is VALID [2022-04-27 15:29:12,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {29726#true} assume true; {29726#true} is VALID [2022-04-27 15:29:12,516 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29726#true} {29726#true} #689#return; {29726#true} is VALID [2022-04-27 15:29:12,517 INFO L272 TraceCheckUtils]: 0: Hoare triple {29726#true} call ULTIMATE.init(); {29733#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:29:12,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {29733#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {29726#true} is VALID [2022-04-27 15:29:12,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {29726#true} assume true; {29726#true} is VALID [2022-04-27 15:29:12,517 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29726#true} {29726#true} #689#return; {29726#true} is VALID [2022-04-27 15:29:12,517 INFO L272 TraceCheckUtils]: 4: Hoare triple {29726#true} call #t~ret161 := main(); {29726#true} is VALID [2022-04-27 15:29:12,517 INFO L290 TraceCheckUtils]: 5: Hoare triple {29726#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; {29726#true} is VALID [2022-04-27 15:29:12,517 INFO L290 TraceCheckUtils]: 6: Hoare triple {29726#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {29726#true} is VALID [2022-04-27 15:29:12,517 INFO L272 TraceCheckUtils]: 7: Hoare triple {29726#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {29726#true} is VALID [2022-04-27 15:29:12,517 INFO L290 TraceCheckUtils]: 8: Hoare triple {29726#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); {29726#true} is VALID [2022-04-27 15:29:12,517 INFO L290 TraceCheckUtils]: 9: Hoare triple {29726#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; {29726#true} is VALID [2022-04-27 15:29:12,517 INFO L290 TraceCheckUtils]: 10: Hoare triple {29726#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; {29726#true} is VALID [2022-04-27 15:29:12,517 INFO L290 TraceCheckUtils]: 11: Hoare triple {29726#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {29726#true} is VALID [2022-04-27 15:29:12,517 INFO L290 TraceCheckUtils]: 12: Hoare triple {29726#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {29726#true} is VALID [2022-04-27 15:29:12,517 INFO L290 TraceCheckUtils]: 13: Hoare triple {29726#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {29726#true} is VALID [2022-04-27 15:29:12,517 INFO L290 TraceCheckUtils]: 14: Hoare triple {29726#true} assume !false; {29726#true} is VALID [2022-04-27 15:29:12,518 INFO L290 TraceCheckUtils]: 15: Hoare triple {29726#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); {29726#true} is VALID [2022-04-27 15:29:12,518 INFO L290 TraceCheckUtils]: 16: Hoare triple {29726#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {29726#true} is VALID [2022-04-27 15:29:12,518 INFO L290 TraceCheckUtils]: 17: Hoare triple {29726#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {29726#true} is VALID [2022-04-27 15:29:12,518 INFO L290 TraceCheckUtils]: 18: Hoare triple {29726#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {29726#true} is VALID [2022-04-27 15:29:12,518 INFO L290 TraceCheckUtils]: 19: Hoare triple {29726#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {29726#true} is VALID [2022-04-27 15:29:12,518 INFO L290 TraceCheckUtils]: 20: Hoare triple {29726#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {29726#true} is VALID [2022-04-27 15:29:12,518 INFO L290 TraceCheckUtils]: 21: Hoare triple {29726#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {29726#true} is VALID [2022-04-27 15:29:12,518 INFO L290 TraceCheckUtils]: 22: Hoare triple {29726#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {29726#true} is VALID [2022-04-27 15:29:12,518 INFO L290 TraceCheckUtils]: 23: Hoare triple {29726#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {29726#true} is VALID [2022-04-27 15:29:12,518 INFO L290 TraceCheckUtils]: 24: Hoare triple {29726#true} assume 8464 == #t~mem55;havoc #t~mem55; {29726#true} is VALID [2022-04-27 15:29:12,518 INFO L290 TraceCheckUtils]: 25: Hoare triple {29726#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; {29726#true} is VALID [2022-04-27 15:29:12,518 INFO L290 TraceCheckUtils]: 26: Hoare triple {29726#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {29726#true} is VALID [2022-04-27 15:29:12,518 INFO L290 TraceCheckUtils]: 27: Hoare triple {29726#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); {29726#true} is VALID [2022-04-27 15:29:12,518 INFO L290 TraceCheckUtils]: 28: Hoare triple {29726#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); {29726#true} is VALID [2022-04-27 15:29:12,518 INFO L290 TraceCheckUtils]: 29: Hoare triple {29726#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {29726#true} is VALID [2022-04-27 15:29:12,518 INFO L290 TraceCheckUtils]: 30: Hoare triple {29726#true} ~skip~0 := 0; {29726#true} is VALID [2022-04-27 15:29:12,518 INFO L290 TraceCheckUtils]: 31: Hoare triple {29726#true} assume !false; {29726#true} is VALID [2022-04-27 15:29:12,519 INFO L290 TraceCheckUtils]: 32: Hoare triple {29726#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); {29726#true} is VALID [2022-04-27 15:29:12,519 INFO L290 TraceCheckUtils]: 33: Hoare triple {29726#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {29726#true} is VALID [2022-04-27 15:29:12,519 INFO L290 TraceCheckUtils]: 34: Hoare triple {29726#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {29726#true} is VALID [2022-04-27 15:29:12,519 INFO L290 TraceCheckUtils]: 35: Hoare triple {29726#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {29726#true} is VALID [2022-04-27 15:29:12,519 INFO L290 TraceCheckUtils]: 36: Hoare triple {29726#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {29726#true} is VALID [2022-04-27 15:29:12,519 INFO L290 TraceCheckUtils]: 37: Hoare triple {29726#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {29726#true} is VALID [2022-04-27 15:29:12,519 INFO L290 TraceCheckUtils]: 38: Hoare triple {29726#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {29726#true} is VALID [2022-04-27 15:29:12,519 INFO L290 TraceCheckUtils]: 39: Hoare triple {29726#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {29726#true} is VALID [2022-04-27 15:29:12,519 INFO L290 TraceCheckUtils]: 40: Hoare triple {29726#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {29726#true} is VALID [2022-04-27 15:29:12,519 INFO L290 TraceCheckUtils]: 41: Hoare triple {29726#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {29726#true} is VALID [2022-04-27 15:29:12,519 INFO L290 TraceCheckUtils]: 42: Hoare triple {29726#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {29726#true} is VALID [2022-04-27 15:29:12,519 INFO L290 TraceCheckUtils]: 43: Hoare triple {29726#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {29726#true} is VALID [2022-04-27 15:29:12,519 INFO L290 TraceCheckUtils]: 44: Hoare triple {29726#true} assume 8496 == #t~mem58;havoc #t~mem58; {29726#true} is VALID [2022-04-27 15:29:12,519 INFO L290 TraceCheckUtils]: 45: Hoare triple {29726#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {29726#true} is VALID [2022-04-27 15:29:12,519 INFO L290 TraceCheckUtils]: 46: Hoare triple {29726#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {29726#true} is VALID [2022-04-27 15:29:12,520 INFO L290 TraceCheckUtils]: 47: Hoare triple {29726#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {29726#true} is VALID [2022-04-27 15:29:12,520 INFO L290 TraceCheckUtils]: 48: Hoare triple {29726#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {29731#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:12,521 INFO L290 TraceCheckUtils]: 49: Hoare triple {29731#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {29731#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:12,521 INFO L290 TraceCheckUtils]: 50: Hoare triple {29731#(= 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); {29731#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:12,521 INFO L290 TraceCheckUtils]: 51: Hoare triple {29731#(= 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; {29731#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:12,522 INFO L290 TraceCheckUtils]: 52: Hoare triple {29731#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {29731#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:12,522 INFO L290 TraceCheckUtils]: 53: Hoare triple {29731#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {29731#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:12,522 INFO L290 TraceCheckUtils]: 54: Hoare triple {29731#(= 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); {29731#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:12,522 INFO L290 TraceCheckUtils]: 55: Hoare triple {29731#(= 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); {29731#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:12,523 INFO L290 TraceCheckUtils]: 56: Hoare triple {29731#(= 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); {29731#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:12,523 INFO L290 TraceCheckUtils]: 57: Hoare triple {29731#(= 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); {29731#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:12,523 INFO L290 TraceCheckUtils]: 58: Hoare triple {29731#(= 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); {29731#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:12,524 INFO L290 TraceCheckUtils]: 59: Hoare triple {29731#(= 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); {29731#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:12,524 INFO L290 TraceCheckUtils]: 60: Hoare triple {29731#(= 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); {29731#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:12,524 INFO L290 TraceCheckUtils]: 61: Hoare triple {29731#(= 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); {29731#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:12,524 INFO L290 TraceCheckUtils]: 62: Hoare triple {29731#(= 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); {29731#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:12,525 INFO L290 TraceCheckUtils]: 63: Hoare triple {29731#(= 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); {29731#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:12,525 INFO L290 TraceCheckUtils]: 64: Hoare triple {29731#(= 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); {29731#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:12,525 INFO L290 TraceCheckUtils]: 65: Hoare triple {29731#(= 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); {29731#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:12,526 INFO L290 TraceCheckUtils]: 66: Hoare triple {29731#(= 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); {29731#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:12,526 INFO L290 TraceCheckUtils]: 67: Hoare triple {29731#(= 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); {29731#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:12,526 INFO L290 TraceCheckUtils]: 68: Hoare triple {29731#(= 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); {29731#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:12,527 INFO L290 TraceCheckUtils]: 69: Hoare triple {29731#(= 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); {29732#(= |ssl3_accept_#t~mem62| 8656)} is VALID [2022-04-27 15:29:12,527 INFO L290 TraceCheckUtils]: 70: Hoare triple {29732#(= |ssl3_accept_#t~mem62| 8656)} assume 8528 == #t~mem62;havoc #t~mem62; {29727#false} is VALID [2022-04-27 15:29:12,527 INFO L290 TraceCheckUtils]: 71: Hoare triple {29727#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); {29727#false} is VALID [2022-04-27 15:29:12,527 INFO L290 TraceCheckUtils]: 72: Hoare triple {29727#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; {29727#false} is VALID [2022-04-27 15:29:12,527 INFO L290 TraceCheckUtils]: 73: Hoare triple {29727#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); {29727#false} is VALID [2022-04-27 15:29:12,527 INFO L290 TraceCheckUtils]: 74: Hoare triple {29727#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {29727#false} is VALID [2022-04-27 15:29:12,527 INFO L290 TraceCheckUtils]: 75: Hoare triple {29727#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {29727#false} is VALID [2022-04-27 15:29:12,527 INFO L290 TraceCheckUtils]: 76: Hoare triple {29727#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {29727#false} is VALID [2022-04-27 15:29:12,527 INFO L290 TraceCheckUtils]: 77: Hoare triple {29727#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {29727#false} is VALID [2022-04-27 15:29:12,527 INFO L290 TraceCheckUtils]: 78: Hoare triple {29727#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); {29727#false} is VALID [2022-04-27 15:29:12,527 INFO L290 TraceCheckUtils]: 79: Hoare triple {29727#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {29727#false} is VALID [2022-04-27 15:29:12,527 INFO L290 TraceCheckUtils]: 80: Hoare triple {29727#false} ~skip~0 := 0; {29727#false} is VALID [2022-04-27 15:29:12,527 INFO L290 TraceCheckUtils]: 81: Hoare triple {29727#false} assume !false; {29727#false} is VALID [2022-04-27 15:29:12,528 INFO L290 TraceCheckUtils]: 82: Hoare triple {29727#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); {29727#false} is VALID [2022-04-27 15:29:12,528 INFO L290 TraceCheckUtils]: 83: Hoare triple {29727#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {29727#false} is VALID [2022-04-27 15:29:12,528 INFO L290 TraceCheckUtils]: 84: Hoare triple {29727#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {29727#false} is VALID [2022-04-27 15:29:12,528 INFO L290 TraceCheckUtils]: 85: Hoare triple {29727#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {29727#false} is VALID [2022-04-27 15:29:12,528 INFO L290 TraceCheckUtils]: 86: Hoare triple {29727#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {29727#false} is VALID [2022-04-27 15:29:12,528 INFO L290 TraceCheckUtils]: 87: Hoare triple {29727#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {29727#false} is VALID [2022-04-27 15:29:12,528 INFO L290 TraceCheckUtils]: 88: Hoare triple {29727#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {29727#false} is VALID [2022-04-27 15:29:12,528 INFO L290 TraceCheckUtils]: 89: Hoare triple {29727#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {29727#false} is VALID [2022-04-27 15:29:12,528 INFO L290 TraceCheckUtils]: 90: Hoare triple {29727#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {29727#false} is VALID [2022-04-27 15:29:12,528 INFO L290 TraceCheckUtils]: 91: Hoare triple {29727#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {29727#false} is VALID [2022-04-27 15:29:12,528 INFO L290 TraceCheckUtils]: 92: Hoare triple {29727#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {29727#false} is VALID [2022-04-27 15:29:12,528 INFO L290 TraceCheckUtils]: 93: Hoare triple {29727#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {29727#false} is VALID [2022-04-27 15:29:12,528 INFO L290 TraceCheckUtils]: 94: Hoare triple {29727#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {29727#false} is VALID [2022-04-27 15:29:12,528 INFO L290 TraceCheckUtils]: 95: Hoare triple {29727#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {29727#false} is VALID [2022-04-27 15:29:12,528 INFO L290 TraceCheckUtils]: 96: Hoare triple {29727#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {29727#false} is VALID [2022-04-27 15:29:12,528 INFO L290 TraceCheckUtils]: 97: Hoare triple {29727#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {29727#false} is VALID [2022-04-27 15:29:12,528 INFO L290 TraceCheckUtils]: 98: Hoare triple {29727#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {29727#false} is VALID [2022-04-27 15:29:12,529 INFO L290 TraceCheckUtils]: 99: Hoare triple {29727#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {29727#false} is VALID [2022-04-27 15:29:12,529 INFO L290 TraceCheckUtils]: 100: Hoare triple {29727#false} assume 8544 == #t~mem64;havoc #t~mem64; {29727#false} is VALID [2022-04-27 15:29:12,529 INFO L290 TraceCheckUtils]: 101: Hoare triple {29727#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {29727#false} is VALID [2022-04-27 15:29:12,529 INFO L290 TraceCheckUtils]: 102: Hoare triple {29727#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); {29727#false} is VALID [2022-04-27 15:29:12,529 INFO L290 TraceCheckUtils]: 103: Hoare triple {29727#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {29727#false} is VALID [2022-04-27 15:29:12,529 INFO L290 TraceCheckUtils]: 104: Hoare triple {29727#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); {29727#false} is VALID [2022-04-27 15:29:12,529 INFO L290 TraceCheckUtils]: 105: Hoare triple {29727#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; {29727#false} is VALID [2022-04-27 15:29:12,529 INFO L290 TraceCheckUtils]: 106: Hoare triple {29727#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; {29727#false} is VALID [2022-04-27 15:29:12,529 INFO L290 TraceCheckUtils]: 107: Hoare triple {29727#false} assume 8 == ~blastFlag~0; {29727#false} is VALID [2022-04-27 15:29:12,529 INFO L290 TraceCheckUtils]: 108: Hoare triple {29727#false} assume !false; {29727#false} is VALID [2022-04-27 15:29:12,529 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-27 15:29:12,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:29:12,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776757404] [2022-04-27 15:29:12,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776757404] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:29:12,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:29:12,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:29:12,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790351967] [2022-04-27 15:29:12,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:29:12,530 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 109 [2022-04-27 15:29:12,530 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:29:12,531 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:12,594 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:29:12,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:29:12,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:29:12,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:29:12,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:29:12,597 INFO L87 Difference]: Start difference. First operand 299 states and 455 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:17,927 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:29:19,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:29:19,003 INFO L93 Difference]: Finished difference Result 659 states and 1007 transitions. [2022-04-27 15:29:19,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:29:19,003 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 109 [2022-04-27 15:29:19,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:29:19,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:19,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 538 transitions. [2022-04-27 15:29:19,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:19,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 538 transitions. [2022-04-27 15:29:19,007 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 538 transitions. [2022-04-27 15:29:19,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 538 edges. 538 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:29:19,357 INFO L225 Difference]: With dead ends: 659 [2022-04-27 15:29:19,357 INFO L226 Difference]: Without dead ends: 386 [2022-04-27 15:29:19,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:29:19,359 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 80 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 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, 3.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:29:19,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 493 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-04-27 15:29:19,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2022-04-27 15:29:19,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 327. [2022-04-27 15:29:19,381 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:29:19,382 INFO L82 GeneralOperation]: Start isEquivalent. First operand 386 states. Second operand has 327 states, 322 states have (on average 1.531055900621118) internal successors, (493), 322 states have internal predecessors, (493), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:19,382 INFO L74 IsIncluded]: Start isIncluded. First operand 386 states. Second operand has 327 states, 322 states have (on average 1.531055900621118) internal successors, (493), 322 states have internal predecessors, (493), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:19,383 INFO L87 Difference]: Start difference. First operand 386 states. Second operand has 327 states, 322 states have (on average 1.531055900621118) internal successors, (493), 322 states have internal predecessors, (493), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:19,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:29:19,388 INFO L93 Difference]: Finished difference Result 386 states and 581 transitions. [2022-04-27 15:29:19,388 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 581 transitions. [2022-04-27 15:29:19,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:29:19,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:29:19,401 INFO L74 IsIncluded]: Start isIncluded. First operand has 327 states, 322 states have (on average 1.531055900621118) internal successors, (493), 322 states have internal predecessors, (493), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 386 states. [2022-04-27 15:29:19,401 INFO L87 Difference]: Start difference. First operand has 327 states, 322 states have (on average 1.531055900621118) internal successors, (493), 322 states have internal predecessors, (493), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 386 states. [2022-04-27 15:29:19,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:29:19,407 INFO L93 Difference]: Finished difference Result 386 states and 581 transitions. [2022-04-27 15:29:19,407 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 581 transitions. [2022-04-27 15:29:19,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:29:19,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:29:19,407 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:29:19,407 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:29:19,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 322 states have (on average 1.531055900621118) internal successors, (493), 322 states have internal predecessors, (493), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:19,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 497 transitions. [2022-04-27 15:29:19,427 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 497 transitions. Word has length 109 [2022-04-27 15:29:19,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:29:19,427 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 497 transitions. [2022-04-27 15:29:19,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:19,428 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 497 transitions. [2022-04-27 15:29:19,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-04-27 15:29:19,428 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:29:19,428 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:29:19,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-27 15:29:19,428 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:29:19,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:29:19,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1420318422, now seen corresponding path program 1 times [2022-04-27 15:29:19,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:29:19,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740670044] [2022-04-27 15:29:19,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:29:19,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:29:19,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:29:19,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:29:19,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:29:19,594 INFO L290 TraceCheckUtils]: 0: Hoare triple {31632#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {31625#true} is VALID [2022-04-27 15:29:19,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {31625#true} assume true; {31625#true} is VALID [2022-04-27 15:29:19,594 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31625#true} {31625#true} #689#return; {31625#true} is VALID [2022-04-27 15:29:19,595 INFO L272 TraceCheckUtils]: 0: Hoare triple {31625#true} call ULTIMATE.init(); {31632#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:29:19,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {31632#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {31625#true} is VALID [2022-04-27 15:29:19,595 INFO L290 TraceCheckUtils]: 2: Hoare triple {31625#true} assume true; {31625#true} is VALID [2022-04-27 15:29:19,595 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31625#true} {31625#true} #689#return; {31625#true} is VALID [2022-04-27 15:29:19,595 INFO L272 TraceCheckUtils]: 4: Hoare triple {31625#true} call #t~ret161 := main(); {31625#true} is VALID [2022-04-27 15:29:19,595 INFO L290 TraceCheckUtils]: 5: Hoare triple {31625#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; {31625#true} is VALID [2022-04-27 15:29:19,595 INFO L290 TraceCheckUtils]: 6: Hoare triple {31625#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {31625#true} is VALID [2022-04-27 15:29:19,595 INFO L272 TraceCheckUtils]: 7: Hoare triple {31625#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {31625#true} is VALID [2022-04-27 15:29:19,596 INFO L290 TraceCheckUtils]: 8: Hoare triple {31625#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); {31625#true} is VALID [2022-04-27 15:29:19,596 INFO L290 TraceCheckUtils]: 9: Hoare triple {31625#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; {31625#true} is VALID [2022-04-27 15:29:19,596 INFO L290 TraceCheckUtils]: 10: Hoare triple {31625#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; {31625#true} is VALID [2022-04-27 15:29:19,596 INFO L290 TraceCheckUtils]: 11: Hoare triple {31625#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {31625#true} is VALID [2022-04-27 15:29:19,596 INFO L290 TraceCheckUtils]: 12: Hoare triple {31625#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {31625#true} is VALID [2022-04-27 15:29:19,596 INFO L290 TraceCheckUtils]: 13: Hoare triple {31625#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {31625#true} is VALID [2022-04-27 15:29:19,596 INFO L290 TraceCheckUtils]: 14: Hoare triple {31625#true} assume !false; {31625#true} is VALID [2022-04-27 15:29:19,596 INFO L290 TraceCheckUtils]: 15: Hoare triple {31625#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); {31625#true} is VALID [2022-04-27 15:29:19,596 INFO L290 TraceCheckUtils]: 16: Hoare triple {31625#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {31625#true} is VALID [2022-04-27 15:29:19,596 INFO L290 TraceCheckUtils]: 17: Hoare triple {31625#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {31625#true} is VALID [2022-04-27 15:29:19,596 INFO L290 TraceCheckUtils]: 18: Hoare triple {31625#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {31625#true} is VALID [2022-04-27 15:29:19,596 INFO L290 TraceCheckUtils]: 19: Hoare triple {31625#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {31625#true} is VALID [2022-04-27 15:29:19,596 INFO L290 TraceCheckUtils]: 20: Hoare triple {31625#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {31625#true} is VALID [2022-04-27 15:29:19,596 INFO L290 TraceCheckUtils]: 21: Hoare triple {31625#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {31625#true} is VALID [2022-04-27 15:29:19,596 INFO L290 TraceCheckUtils]: 22: Hoare triple {31625#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {31625#true} is VALID [2022-04-27 15:29:19,596 INFO L290 TraceCheckUtils]: 23: Hoare triple {31625#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {31625#true} is VALID [2022-04-27 15:29:19,596 INFO L290 TraceCheckUtils]: 24: Hoare triple {31625#true} assume 8464 == #t~mem55;havoc #t~mem55; {31625#true} is VALID [2022-04-27 15:29:19,597 INFO L290 TraceCheckUtils]: 25: Hoare triple {31625#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; {31625#true} is VALID [2022-04-27 15:29:19,597 INFO L290 TraceCheckUtils]: 26: Hoare triple {31625#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {31625#true} is VALID [2022-04-27 15:29:19,597 INFO L290 TraceCheckUtils]: 27: Hoare triple {31625#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); {31625#true} is VALID [2022-04-27 15:29:19,597 INFO L290 TraceCheckUtils]: 28: Hoare triple {31625#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); {31625#true} is VALID [2022-04-27 15:29:19,597 INFO L290 TraceCheckUtils]: 29: Hoare triple {31625#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {31625#true} is VALID [2022-04-27 15:29:19,597 INFO L290 TraceCheckUtils]: 30: Hoare triple {31625#true} ~skip~0 := 0; {31625#true} is VALID [2022-04-27 15:29:19,597 INFO L290 TraceCheckUtils]: 31: Hoare triple {31625#true} assume !false; {31625#true} is VALID [2022-04-27 15:29:19,597 INFO L290 TraceCheckUtils]: 32: Hoare triple {31625#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); {31625#true} is VALID [2022-04-27 15:29:19,597 INFO L290 TraceCheckUtils]: 33: Hoare triple {31625#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {31625#true} is VALID [2022-04-27 15:29:19,597 INFO L290 TraceCheckUtils]: 34: Hoare triple {31625#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {31625#true} is VALID [2022-04-27 15:29:19,597 INFO L290 TraceCheckUtils]: 35: Hoare triple {31625#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {31625#true} is VALID [2022-04-27 15:29:19,597 INFO L290 TraceCheckUtils]: 36: Hoare triple {31625#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {31625#true} is VALID [2022-04-27 15:29:19,597 INFO L290 TraceCheckUtils]: 37: Hoare triple {31625#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {31625#true} is VALID [2022-04-27 15:29:19,597 INFO L290 TraceCheckUtils]: 38: Hoare triple {31625#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {31625#true} is VALID [2022-04-27 15:29:19,597 INFO L290 TraceCheckUtils]: 39: Hoare triple {31625#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {31625#true} is VALID [2022-04-27 15:29:19,597 INFO L290 TraceCheckUtils]: 40: Hoare triple {31625#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {31625#true} is VALID [2022-04-27 15:29:19,598 INFO L290 TraceCheckUtils]: 41: Hoare triple {31625#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {31625#true} is VALID [2022-04-27 15:29:19,614 INFO L290 TraceCheckUtils]: 42: Hoare triple {31625#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {31625#true} is VALID [2022-04-27 15:29:19,614 INFO L290 TraceCheckUtils]: 43: Hoare triple {31625#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {31625#true} is VALID [2022-04-27 15:29:19,614 INFO L290 TraceCheckUtils]: 44: Hoare triple {31625#true} assume 8496 == #t~mem58;havoc #t~mem58; {31625#true} is VALID [2022-04-27 15:29:19,615 INFO L290 TraceCheckUtils]: 45: Hoare triple {31625#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {31625#true} is VALID [2022-04-27 15:29:19,615 INFO L290 TraceCheckUtils]: 46: Hoare triple {31625#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {31625#true} is VALID [2022-04-27 15:29:19,615 INFO L290 TraceCheckUtils]: 47: Hoare triple {31625#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {31625#true} is VALID [2022-04-27 15:29:19,616 INFO L290 TraceCheckUtils]: 48: Hoare triple {31625#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {31630#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:19,616 INFO L290 TraceCheckUtils]: 49: Hoare triple {31630#(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); {31630#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:19,617 INFO L290 TraceCheckUtils]: 50: Hoare triple {31630#(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); {31630#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:19,617 INFO L290 TraceCheckUtils]: 51: Hoare triple {31630#(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; {31630#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:19,617 INFO L290 TraceCheckUtils]: 52: Hoare triple {31630#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {31630#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:19,617 INFO L290 TraceCheckUtils]: 53: Hoare triple {31630#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {31630#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:19,618 INFO L290 TraceCheckUtils]: 54: Hoare triple {31630#(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); {31630#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:19,618 INFO L290 TraceCheckUtils]: 55: Hoare triple {31630#(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); {31630#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:19,618 INFO L290 TraceCheckUtils]: 56: Hoare triple {31630#(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); {31630#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:19,619 INFO L290 TraceCheckUtils]: 57: Hoare triple {31630#(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); {31630#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:19,619 INFO L290 TraceCheckUtils]: 58: Hoare triple {31630#(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); {31630#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:19,619 INFO L290 TraceCheckUtils]: 59: Hoare triple {31630#(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); {31630#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:19,620 INFO L290 TraceCheckUtils]: 60: Hoare triple {31630#(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); {31630#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:19,620 INFO L290 TraceCheckUtils]: 61: Hoare triple {31630#(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); {31630#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:19,620 INFO L290 TraceCheckUtils]: 62: Hoare triple {31630#(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); {31630#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:19,621 INFO L290 TraceCheckUtils]: 63: Hoare triple {31630#(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); {31630#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:19,621 INFO L290 TraceCheckUtils]: 64: Hoare triple {31630#(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); {31630#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:19,621 INFO L290 TraceCheckUtils]: 65: Hoare triple {31630#(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); {31630#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:19,621 INFO L290 TraceCheckUtils]: 66: Hoare triple {31630#(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); {31630#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:19,622 INFO L290 TraceCheckUtils]: 67: Hoare triple {31630#(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); {31630#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:19,622 INFO L290 TraceCheckUtils]: 68: Hoare triple {31630#(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); {31630#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:19,622 INFO L290 TraceCheckUtils]: 69: Hoare triple {31630#(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); {31631#(not (= |ssl3_accept_#t~mem62| 8528))} is VALID [2022-04-27 15:29:19,623 INFO L290 TraceCheckUtils]: 70: Hoare triple {31631#(not (= |ssl3_accept_#t~mem62| 8528))} assume 8528 == #t~mem62;havoc #t~mem62; {31626#false} is VALID [2022-04-27 15:29:19,623 INFO L290 TraceCheckUtils]: 71: Hoare triple {31626#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); {31626#false} is VALID [2022-04-27 15:29:19,623 INFO L290 TraceCheckUtils]: 72: Hoare triple {31626#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; {31626#false} is VALID [2022-04-27 15:29:19,623 INFO L290 TraceCheckUtils]: 73: Hoare triple {31626#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); {31626#false} is VALID [2022-04-27 15:29:19,623 INFO L290 TraceCheckUtils]: 74: Hoare triple {31626#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {31626#false} is VALID [2022-04-27 15:29:19,623 INFO L290 TraceCheckUtils]: 75: Hoare triple {31626#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {31626#false} is VALID [2022-04-27 15:29:19,623 INFO L290 TraceCheckUtils]: 76: Hoare triple {31626#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {31626#false} is VALID [2022-04-27 15:29:19,623 INFO L290 TraceCheckUtils]: 77: Hoare triple {31626#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {31626#false} is VALID [2022-04-27 15:29:19,623 INFO L290 TraceCheckUtils]: 78: Hoare triple {31626#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); {31626#false} is VALID [2022-04-27 15:29:19,623 INFO L290 TraceCheckUtils]: 79: Hoare triple {31626#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {31626#false} is VALID [2022-04-27 15:29:19,623 INFO L290 TraceCheckUtils]: 80: Hoare triple {31626#false} ~skip~0 := 0; {31626#false} is VALID [2022-04-27 15:29:19,623 INFO L290 TraceCheckUtils]: 81: Hoare triple {31626#false} assume !false; {31626#false} is VALID [2022-04-27 15:29:19,623 INFO L290 TraceCheckUtils]: 82: Hoare triple {31626#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); {31626#false} is VALID [2022-04-27 15:29:19,623 INFO L290 TraceCheckUtils]: 83: Hoare triple {31626#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {31626#false} is VALID [2022-04-27 15:29:19,624 INFO L290 TraceCheckUtils]: 84: Hoare triple {31626#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {31626#false} is VALID [2022-04-27 15:29:19,624 INFO L290 TraceCheckUtils]: 85: Hoare triple {31626#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {31626#false} is VALID [2022-04-27 15:29:19,624 INFO L290 TraceCheckUtils]: 86: Hoare triple {31626#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {31626#false} is VALID [2022-04-27 15:29:19,624 INFO L290 TraceCheckUtils]: 87: Hoare triple {31626#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {31626#false} is VALID [2022-04-27 15:29:19,624 INFO L290 TraceCheckUtils]: 88: Hoare triple {31626#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {31626#false} is VALID [2022-04-27 15:29:19,624 INFO L290 TraceCheckUtils]: 89: Hoare triple {31626#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {31626#false} is VALID [2022-04-27 15:29:19,624 INFO L290 TraceCheckUtils]: 90: Hoare triple {31626#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {31626#false} is VALID [2022-04-27 15:29:19,624 INFO L290 TraceCheckUtils]: 91: Hoare triple {31626#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {31626#false} is VALID [2022-04-27 15:29:19,624 INFO L290 TraceCheckUtils]: 92: Hoare triple {31626#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {31626#false} is VALID [2022-04-27 15:29:19,624 INFO L290 TraceCheckUtils]: 93: Hoare triple {31626#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {31626#false} is VALID [2022-04-27 15:29:19,624 INFO L290 TraceCheckUtils]: 94: Hoare triple {31626#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {31626#false} is VALID [2022-04-27 15:29:19,624 INFO L290 TraceCheckUtils]: 95: Hoare triple {31626#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {31626#false} is VALID [2022-04-27 15:29:19,624 INFO L290 TraceCheckUtils]: 96: Hoare triple {31626#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {31626#false} is VALID [2022-04-27 15:29:19,624 INFO L290 TraceCheckUtils]: 97: Hoare triple {31626#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {31626#false} is VALID [2022-04-27 15:29:19,624 INFO L290 TraceCheckUtils]: 98: Hoare triple {31626#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {31626#false} is VALID [2022-04-27 15:29:19,624 INFO L290 TraceCheckUtils]: 99: Hoare triple {31626#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {31626#false} is VALID [2022-04-27 15:29:19,624 INFO L290 TraceCheckUtils]: 100: Hoare triple {31626#false} assume 8544 == #t~mem64;havoc #t~mem64; {31626#false} is VALID [2022-04-27 15:29:19,625 INFO L290 TraceCheckUtils]: 101: Hoare triple {31626#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {31626#false} is VALID [2022-04-27 15:29:19,625 INFO L290 TraceCheckUtils]: 102: Hoare triple {31626#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); {31626#false} is VALID [2022-04-27 15:29:19,625 INFO L290 TraceCheckUtils]: 103: Hoare triple {31626#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {31626#false} is VALID [2022-04-27 15:29:19,625 INFO L290 TraceCheckUtils]: 104: Hoare triple {31626#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); {31626#false} is VALID [2022-04-27 15:29:19,625 INFO L290 TraceCheckUtils]: 105: Hoare triple {31626#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; {31626#false} is VALID [2022-04-27 15:29:19,625 INFO L290 TraceCheckUtils]: 106: Hoare triple {31626#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; {31626#false} is VALID [2022-04-27 15:29:19,625 INFO L290 TraceCheckUtils]: 107: Hoare triple {31626#false} assume 8 == ~blastFlag~0; {31626#false} is VALID [2022-04-27 15:29:19,625 INFO L290 TraceCheckUtils]: 108: Hoare triple {31626#false} assume !false; {31626#false} is VALID [2022-04-27 15:29:19,625 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-27 15:29:19,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:29:19,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740670044] [2022-04-27 15:29:19,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740670044] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:29:19,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:29:19,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:29:19,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236153660] [2022-04-27 15:29:19,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:29:19,626 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 109 [2022-04-27 15:29:19,626 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:29:19,626 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:19,698 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:29:19,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:29:19,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:29:19,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:29:19,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:29:19,699 INFO L87 Difference]: Start difference. First operand 327 states and 497 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:21,779 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-27 15:29:25,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:29:25,405 INFO L93 Difference]: Finished difference Result 743 states and 1134 transitions. [2022-04-27 15:29:25,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:29:25,405 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 109 [2022-04-27 15:29:25,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:29:25,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:25,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 584 transitions. [2022-04-27 15:29:25,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:25,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 584 transitions. [2022-04-27 15:29:25,409 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 584 transitions. [2022-04-27 15:29:25,762 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 584 edges. 584 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:29:25,769 INFO L225 Difference]: With dead ends: 743 [2022-04-27 15:29:25,769 INFO L226 Difference]: Without dead ends: 442 [2022-04-27 15:29:25,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:29:25,771 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 127 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 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, 2.7s IncrementalHoareTripleChecker+Time [2022-04-27 15:29:25,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 360 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-04-27 15:29:25,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2022-04-27 15:29:25,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 325. [2022-04-27 15:29:25,792 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:29:25,792 INFO L82 GeneralOperation]: Start isEquivalent. First operand 442 states. Second operand has 325 states, 320 states have (on average 1.528125) internal successors, (489), 320 states have internal predecessors, (489), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:25,793 INFO L74 IsIncluded]: Start isIncluded. First operand 442 states. Second operand has 325 states, 320 states have (on average 1.528125) internal successors, (489), 320 states have internal predecessors, (489), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:25,793 INFO L87 Difference]: Start difference. First operand 442 states. Second operand has 325 states, 320 states have (on average 1.528125) internal successors, (489), 320 states have internal predecessors, (489), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:25,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:29:25,799 INFO L93 Difference]: Finished difference Result 442 states and 664 transitions. [2022-04-27 15:29:25,799 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 664 transitions. [2022-04-27 15:29:25,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:29:25,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:29:25,800 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 442 states. [2022-04-27 15:29:25,800 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 442 states. [2022-04-27 15:29:25,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:29:25,807 INFO L93 Difference]: Finished difference Result 442 states and 664 transitions. [2022-04-27 15:29:25,807 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 664 transitions. [2022-04-27 15:29:25,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:29:25,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:29:25,807 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:29:25,807 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:29:25,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 320 states have (on average 1.528125) internal successors, (489), 320 states have internal predecessors, (489), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:25,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 493 transitions. [2022-04-27 15:29:25,812 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 493 transitions. Word has length 109 [2022-04-27 15:29:25,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:29:25,812 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 493 transitions. [2022-04-27 15:29:25,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:25,812 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 493 transitions. [2022-04-27 15:29:25,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-04-27 15:29:25,813 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:29:25,813 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:29:25,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-27 15:29:25,813 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:29:25,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:29:25,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1022958803, now seen corresponding path program 1 times [2022-04-27 15:29:25,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:29:25,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510143368] [2022-04-27 15:29:25,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:29:25,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:29:25,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:29:25,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:29:25,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:29:25,927 INFO L290 TraceCheckUtils]: 0: Hoare triple {33736#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {33729#true} is VALID [2022-04-27 15:29:25,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {33729#true} assume true; {33729#true} is VALID [2022-04-27 15:29:25,927 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33729#true} {33729#true} #689#return; {33729#true} is VALID [2022-04-27 15:29:25,928 INFO L272 TraceCheckUtils]: 0: Hoare triple {33729#true} call ULTIMATE.init(); {33736#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:29:25,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {33736#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {33729#true} is VALID [2022-04-27 15:29:25,928 INFO L290 TraceCheckUtils]: 2: Hoare triple {33729#true} assume true; {33729#true} is VALID [2022-04-27 15:29:25,928 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33729#true} {33729#true} #689#return; {33729#true} is VALID [2022-04-27 15:29:25,928 INFO L272 TraceCheckUtils]: 4: Hoare triple {33729#true} call #t~ret161 := main(); {33729#true} is VALID [2022-04-27 15:29:25,928 INFO L290 TraceCheckUtils]: 5: Hoare triple {33729#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; {33729#true} is VALID [2022-04-27 15:29:25,928 INFO L290 TraceCheckUtils]: 6: Hoare triple {33729#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {33729#true} is VALID [2022-04-27 15:29:25,928 INFO L272 TraceCheckUtils]: 7: Hoare triple {33729#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {33729#true} is VALID [2022-04-27 15:29:25,928 INFO L290 TraceCheckUtils]: 8: Hoare triple {33729#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); {33729#true} is VALID [2022-04-27 15:29:25,928 INFO L290 TraceCheckUtils]: 9: Hoare triple {33729#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; {33729#true} is VALID [2022-04-27 15:29:25,928 INFO L290 TraceCheckUtils]: 10: Hoare triple {33729#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; {33729#true} is VALID [2022-04-27 15:29:25,928 INFO L290 TraceCheckUtils]: 11: Hoare triple {33729#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {33729#true} is VALID [2022-04-27 15:29:25,928 INFO L290 TraceCheckUtils]: 12: Hoare triple {33729#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {33729#true} is VALID [2022-04-27 15:29:25,928 INFO L290 TraceCheckUtils]: 13: Hoare triple {33729#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {33729#true} is VALID [2022-04-27 15:29:25,928 INFO L290 TraceCheckUtils]: 14: Hoare triple {33729#true} assume !false; {33729#true} is VALID [2022-04-27 15:29:25,929 INFO L290 TraceCheckUtils]: 15: Hoare triple {33729#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); {33729#true} is VALID [2022-04-27 15:29:25,929 INFO L290 TraceCheckUtils]: 16: Hoare triple {33729#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {33729#true} is VALID [2022-04-27 15:29:25,929 INFO L290 TraceCheckUtils]: 17: Hoare triple {33729#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {33729#true} is VALID [2022-04-27 15:29:25,929 INFO L290 TraceCheckUtils]: 18: Hoare triple {33729#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {33729#true} is VALID [2022-04-27 15:29:25,929 INFO L290 TraceCheckUtils]: 19: Hoare triple {33729#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {33729#true} is VALID [2022-04-27 15:29:25,929 INFO L290 TraceCheckUtils]: 20: Hoare triple {33729#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {33729#true} is VALID [2022-04-27 15:29:25,929 INFO L290 TraceCheckUtils]: 21: Hoare triple {33729#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {33729#true} is VALID [2022-04-27 15:29:25,929 INFO L290 TraceCheckUtils]: 22: Hoare triple {33729#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {33729#true} is VALID [2022-04-27 15:29:25,929 INFO L290 TraceCheckUtils]: 23: Hoare triple {33729#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {33729#true} is VALID [2022-04-27 15:29:25,929 INFO L290 TraceCheckUtils]: 24: Hoare triple {33729#true} assume 8464 == #t~mem55;havoc #t~mem55; {33729#true} is VALID [2022-04-27 15:29:25,929 INFO L290 TraceCheckUtils]: 25: Hoare triple {33729#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; {33729#true} is VALID [2022-04-27 15:29:25,929 INFO L290 TraceCheckUtils]: 26: Hoare triple {33729#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {33729#true} is VALID [2022-04-27 15:29:25,929 INFO L290 TraceCheckUtils]: 27: Hoare triple {33729#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); {33729#true} is VALID [2022-04-27 15:29:25,929 INFO L290 TraceCheckUtils]: 28: Hoare triple {33729#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); {33729#true} is VALID [2022-04-27 15:29:25,929 INFO L290 TraceCheckUtils]: 29: Hoare triple {33729#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {33729#true} is VALID [2022-04-27 15:29:25,929 INFO L290 TraceCheckUtils]: 30: Hoare triple {33729#true} ~skip~0 := 0; {33729#true} is VALID [2022-04-27 15:29:25,929 INFO L290 TraceCheckUtils]: 31: Hoare triple {33729#true} assume !false; {33729#true} is VALID [2022-04-27 15:29:25,930 INFO L290 TraceCheckUtils]: 32: Hoare triple {33729#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); {33729#true} is VALID [2022-04-27 15:29:25,930 INFO L290 TraceCheckUtils]: 33: Hoare triple {33729#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {33729#true} is VALID [2022-04-27 15:29:25,930 INFO L290 TraceCheckUtils]: 34: Hoare triple {33729#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {33729#true} is VALID [2022-04-27 15:29:25,930 INFO L290 TraceCheckUtils]: 35: Hoare triple {33729#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {33729#true} is VALID [2022-04-27 15:29:25,930 INFO L290 TraceCheckUtils]: 36: Hoare triple {33729#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {33729#true} is VALID [2022-04-27 15:29:25,930 INFO L290 TraceCheckUtils]: 37: Hoare triple {33729#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {33729#true} is VALID [2022-04-27 15:29:25,930 INFO L290 TraceCheckUtils]: 38: Hoare triple {33729#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {33729#true} is VALID [2022-04-27 15:29:25,930 INFO L290 TraceCheckUtils]: 39: Hoare triple {33729#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {33729#true} is VALID [2022-04-27 15:29:25,930 INFO L290 TraceCheckUtils]: 40: Hoare triple {33729#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {33729#true} is VALID [2022-04-27 15:29:25,930 INFO L290 TraceCheckUtils]: 41: Hoare triple {33729#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {33729#true} is VALID [2022-04-27 15:29:25,930 INFO L290 TraceCheckUtils]: 42: Hoare triple {33729#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {33729#true} is VALID [2022-04-27 15:29:25,930 INFO L290 TraceCheckUtils]: 43: Hoare triple {33729#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {33729#true} is VALID [2022-04-27 15:29:25,930 INFO L290 TraceCheckUtils]: 44: Hoare triple {33729#true} assume 8496 == #t~mem58;havoc #t~mem58; {33729#true} is VALID [2022-04-27 15:29:25,930 INFO L290 TraceCheckUtils]: 45: Hoare triple {33729#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {33729#true} is VALID [2022-04-27 15:29:25,930 INFO L290 TraceCheckUtils]: 46: Hoare triple {33729#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {33729#true} is VALID [2022-04-27 15:29:25,930 INFO L290 TraceCheckUtils]: 47: Hoare triple {33729#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {33729#true} is VALID [2022-04-27 15:29:25,931 INFO L290 TraceCheckUtils]: 48: Hoare triple {33729#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {33734#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:25,932 INFO L290 TraceCheckUtils]: 49: Hoare triple {33734#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {33734#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:25,932 INFO L290 TraceCheckUtils]: 50: Hoare triple {33734#(= 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); {33734#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:25,932 INFO L290 TraceCheckUtils]: 51: Hoare triple {33734#(= 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; {33734#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:25,933 INFO L290 TraceCheckUtils]: 52: Hoare triple {33734#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {33734#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:25,933 INFO L290 TraceCheckUtils]: 53: Hoare triple {33734#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {33734#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:25,933 INFO L290 TraceCheckUtils]: 54: Hoare triple {33734#(= 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); {33734#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:25,934 INFO L290 TraceCheckUtils]: 55: Hoare triple {33734#(= 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); {33734#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:25,934 INFO L290 TraceCheckUtils]: 56: Hoare triple {33734#(= 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); {33734#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:25,934 INFO L290 TraceCheckUtils]: 57: Hoare triple {33734#(= 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); {33734#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:25,935 INFO L290 TraceCheckUtils]: 58: Hoare triple {33734#(= 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); {33734#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:25,935 INFO L290 TraceCheckUtils]: 59: Hoare triple {33734#(= 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); {33734#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:25,935 INFO L290 TraceCheckUtils]: 60: Hoare triple {33734#(= 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); {33734#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:25,936 INFO L290 TraceCheckUtils]: 61: Hoare triple {33734#(= 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); {33734#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:25,936 INFO L290 TraceCheckUtils]: 62: Hoare triple {33734#(= 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); {33734#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:25,936 INFO L290 TraceCheckUtils]: 63: Hoare triple {33734#(= 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); {33734#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:25,937 INFO L290 TraceCheckUtils]: 64: Hoare triple {33734#(= 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); {33734#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:25,937 INFO L290 TraceCheckUtils]: 65: Hoare triple {33734#(= 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); {33734#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:25,937 INFO L290 TraceCheckUtils]: 66: Hoare triple {33734#(= 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); {33734#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:25,937 INFO L290 TraceCheckUtils]: 67: Hoare triple {33734#(= 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); {33734#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:25,938 INFO L290 TraceCheckUtils]: 68: Hoare triple {33734#(= 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); {33734#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:25,938 INFO L290 TraceCheckUtils]: 69: Hoare triple {33734#(= 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); {33734#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:25,938 INFO L290 TraceCheckUtils]: 70: Hoare triple {33734#(= 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); {33735#(= |ssl3_accept_#t~mem63| 8656)} is VALID [2022-04-27 15:29:25,939 INFO L290 TraceCheckUtils]: 71: Hoare triple {33735#(= |ssl3_accept_#t~mem63| 8656)} assume 8529 == #t~mem63;havoc #t~mem63; {33730#false} is VALID [2022-04-27 15:29:25,939 INFO L290 TraceCheckUtils]: 72: Hoare triple {33730#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); {33730#false} is VALID [2022-04-27 15:29:25,939 INFO L290 TraceCheckUtils]: 73: Hoare triple {33730#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; {33730#false} is VALID [2022-04-27 15:29:25,939 INFO L290 TraceCheckUtils]: 74: Hoare triple {33730#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); {33730#false} is VALID [2022-04-27 15:29:25,939 INFO L290 TraceCheckUtils]: 75: Hoare triple {33730#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {33730#false} is VALID [2022-04-27 15:29:25,939 INFO L290 TraceCheckUtils]: 76: Hoare triple {33730#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {33730#false} is VALID [2022-04-27 15:29:25,939 INFO L290 TraceCheckUtils]: 77: Hoare triple {33730#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {33730#false} is VALID [2022-04-27 15:29:25,939 INFO L290 TraceCheckUtils]: 78: Hoare triple {33730#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {33730#false} is VALID [2022-04-27 15:29:25,939 INFO L290 TraceCheckUtils]: 79: Hoare triple {33730#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); {33730#false} is VALID [2022-04-27 15:29:25,939 INFO L290 TraceCheckUtils]: 80: Hoare triple {33730#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {33730#false} is VALID [2022-04-27 15:29:25,939 INFO L290 TraceCheckUtils]: 81: Hoare triple {33730#false} ~skip~0 := 0; {33730#false} is VALID [2022-04-27 15:29:25,939 INFO L290 TraceCheckUtils]: 82: Hoare triple {33730#false} assume !false; {33730#false} is VALID [2022-04-27 15:29:25,940 INFO L290 TraceCheckUtils]: 83: Hoare triple {33730#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); {33730#false} is VALID [2022-04-27 15:29:25,940 INFO L290 TraceCheckUtils]: 84: Hoare triple {33730#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {33730#false} is VALID [2022-04-27 15:29:25,940 INFO L290 TraceCheckUtils]: 85: Hoare triple {33730#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {33730#false} is VALID [2022-04-27 15:29:25,940 INFO L290 TraceCheckUtils]: 86: Hoare triple {33730#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {33730#false} is VALID [2022-04-27 15:29:25,940 INFO L290 TraceCheckUtils]: 87: Hoare triple {33730#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {33730#false} is VALID [2022-04-27 15:29:25,940 INFO L290 TraceCheckUtils]: 88: Hoare triple {33730#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {33730#false} is VALID [2022-04-27 15:29:25,940 INFO L290 TraceCheckUtils]: 89: Hoare triple {33730#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {33730#false} is VALID [2022-04-27 15:29:25,940 INFO L290 TraceCheckUtils]: 90: Hoare triple {33730#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {33730#false} is VALID [2022-04-27 15:29:25,940 INFO L290 TraceCheckUtils]: 91: Hoare triple {33730#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {33730#false} is VALID [2022-04-27 15:29:25,940 INFO L290 TraceCheckUtils]: 92: Hoare triple {33730#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {33730#false} is VALID [2022-04-27 15:29:25,940 INFO L290 TraceCheckUtils]: 93: Hoare triple {33730#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {33730#false} is VALID [2022-04-27 15:29:25,940 INFO L290 TraceCheckUtils]: 94: Hoare triple {33730#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {33730#false} is VALID [2022-04-27 15:29:25,940 INFO L290 TraceCheckUtils]: 95: Hoare triple {33730#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {33730#false} is VALID [2022-04-27 15:29:25,940 INFO L290 TraceCheckUtils]: 96: Hoare triple {33730#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {33730#false} is VALID [2022-04-27 15:29:25,940 INFO L290 TraceCheckUtils]: 97: Hoare triple {33730#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {33730#false} is VALID [2022-04-27 15:29:25,940 INFO L290 TraceCheckUtils]: 98: Hoare triple {33730#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {33730#false} is VALID [2022-04-27 15:29:25,940 INFO L290 TraceCheckUtils]: 99: Hoare triple {33730#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {33730#false} is VALID [2022-04-27 15:29:25,941 INFO L290 TraceCheckUtils]: 100: Hoare triple {33730#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {33730#false} is VALID [2022-04-27 15:29:25,941 INFO L290 TraceCheckUtils]: 101: Hoare triple {33730#false} assume 8544 == #t~mem64;havoc #t~mem64; {33730#false} is VALID [2022-04-27 15:29:25,941 INFO L290 TraceCheckUtils]: 102: Hoare triple {33730#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {33730#false} is VALID [2022-04-27 15:29:25,941 INFO L290 TraceCheckUtils]: 103: Hoare triple {33730#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); {33730#false} is VALID [2022-04-27 15:29:25,941 INFO L290 TraceCheckUtils]: 104: Hoare triple {33730#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {33730#false} is VALID [2022-04-27 15:29:25,941 INFO L290 TraceCheckUtils]: 105: Hoare triple {33730#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); {33730#false} is VALID [2022-04-27 15:29:25,941 INFO L290 TraceCheckUtils]: 106: Hoare triple {33730#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; {33730#false} is VALID [2022-04-27 15:29:25,941 INFO L290 TraceCheckUtils]: 107: Hoare triple {33730#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; {33730#false} is VALID [2022-04-27 15:29:25,941 INFO L290 TraceCheckUtils]: 108: Hoare triple {33730#false} assume 8 == ~blastFlag~0; {33730#false} is VALID [2022-04-27 15:29:25,941 INFO L290 TraceCheckUtils]: 109: Hoare triple {33730#false} assume !false; {33730#false} is VALID [2022-04-27 15:29:25,941 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-27 15:29:25,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:29:25,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510143368] [2022-04-27 15:29:25,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510143368] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:29:25,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:29:25,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:29:25,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372808060] [2022-04-27 15:29:25,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:29:25,942 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2022-04-27 15:29:25,942 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:29:25,943 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:26,022 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:29:26,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:29:26,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:29:26,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:29:26,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:29:26,024 INFO L87 Difference]: Start difference. First operand 325 states and 493 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:28,624 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:29:31,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:29:31,253 INFO L93 Difference]: Finished difference Result 709 states and 1079 transitions. [2022-04-27 15:29:31,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:29:31,253 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2022-04-27 15:29:31,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:29:31,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:31,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 534 transitions. [2022-04-27 15:29:31,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:31,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 534 transitions. [2022-04-27 15:29:31,257 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 534 transitions. [2022-04-27 15:29:31,569 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 534 edges. 534 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:29:31,575 INFO L225 Difference]: With dead ends: 709 [2022-04-27 15:29:31,575 INFO L226 Difference]: Without dead ends: 410 [2022-04-27 15:29:31,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:29:31,578 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 77 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:29:31,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 493 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-04-27 15:29:31,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2022-04-27 15:29:31,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 354. [2022-04-27 15:29:31,582 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:29:31,583 INFO L82 GeneralOperation]: Start isEquivalent. First operand 410 states. Second operand has 354 states, 349 states have (on average 1.524355300859599) internal successors, (532), 349 states have internal predecessors, (532), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:31,583 INFO L74 IsIncluded]: Start isIncluded. First operand 410 states. Second operand has 354 states, 349 states have (on average 1.524355300859599) internal successors, (532), 349 states have internal predecessors, (532), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:31,583 INFO L87 Difference]: Start difference. First operand 410 states. Second operand has 354 states, 349 states have (on average 1.524355300859599) internal successors, (532), 349 states have internal predecessors, (532), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:31,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:29:31,589 INFO L93 Difference]: Finished difference Result 410 states and 615 transitions. [2022-04-27 15:29:31,589 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 615 transitions. [2022-04-27 15:29:31,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:29:31,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:29:31,590 INFO L74 IsIncluded]: Start isIncluded. First operand has 354 states, 349 states have (on average 1.524355300859599) internal successors, (532), 349 states have internal predecessors, (532), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 410 states. [2022-04-27 15:29:31,590 INFO L87 Difference]: Start difference. First operand has 354 states, 349 states have (on average 1.524355300859599) internal successors, (532), 349 states have internal predecessors, (532), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 410 states. [2022-04-27 15:29:31,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:29:31,596 INFO L93 Difference]: Finished difference Result 410 states and 615 transitions. [2022-04-27 15:29:31,596 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 615 transitions. [2022-04-27 15:29:31,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:29:31,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:29:31,597 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:29:31,597 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:29:31,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 349 states have (on average 1.524355300859599) internal successors, (532), 349 states have internal predecessors, (532), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:31,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 536 transitions. [2022-04-27 15:29:31,601 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 536 transitions. Word has length 110 [2022-04-27 15:29:31,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:29:31,602 INFO L495 AbstractCegarLoop]: Abstraction has 354 states and 536 transitions. [2022-04-27 15:29:31,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:31,602 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 536 transitions. [2022-04-27 15:29:31,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-04-27 15:29:31,602 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:29:31,602 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:29:31,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-27 15:29:31,602 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:29:31,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:29:31,603 INFO L85 PathProgramCache]: Analyzing trace with hash 623048725, now seen corresponding path program 1 times [2022-04-27 15:29:31,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:29:31,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095735400] [2022-04-27 15:29:31,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:29:31,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:29:31,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:29:31,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:29:31,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:29:31,737 INFO L290 TraceCheckUtils]: 0: Hoare triple {35765#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {35758#true} is VALID [2022-04-27 15:29:31,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {35758#true} assume true; {35758#true} is VALID [2022-04-27 15:29:31,737 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35758#true} {35758#true} #689#return; {35758#true} is VALID [2022-04-27 15:29:31,737 INFO L272 TraceCheckUtils]: 0: Hoare triple {35758#true} call ULTIMATE.init(); {35765#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:29:31,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {35765#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {35758#true} is VALID [2022-04-27 15:29:31,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {35758#true} assume true; {35758#true} is VALID [2022-04-27 15:29:31,738 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35758#true} {35758#true} #689#return; {35758#true} is VALID [2022-04-27 15:29:31,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {35758#true} call #t~ret161 := main(); {35758#true} is VALID [2022-04-27 15:29:31,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {35758#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; {35758#true} is VALID [2022-04-27 15:29:31,738 INFO L290 TraceCheckUtils]: 6: Hoare triple {35758#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {35758#true} is VALID [2022-04-27 15:29:31,738 INFO L272 TraceCheckUtils]: 7: Hoare triple {35758#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {35758#true} is VALID [2022-04-27 15:29:31,738 INFO L290 TraceCheckUtils]: 8: Hoare triple {35758#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); {35758#true} is VALID [2022-04-27 15:29:31,738 INFO L290 TraceCheckUtils]: 9: Hoare triple {35758#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; {35758#true} is VALID [2022-04-27 15:29:31,738 INFO L290 TraceCheckUtils]: 10: Hoare triple {35758#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; {35758#true} is VALID [2022-04-27 15:29:31,738 INFO L290 TraceCheckUtils]: 11: Hoare triple {35758#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {35758#true} is VALID [2022-04-27 15:29:31,738 INFO L290 TraceCheckUtils]: 12: Hoare triple {35758#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {35758#true} is VALID [2022-04-27 15:29:31,738 INFO L290 TraceCheckUtils]: 13: Hoare triple {35758#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {35758#true} is VALID [2022-04-27 15:29:31,738 INFO L290 TraceCheckUtils]: 14: Hoare triple {35758#true} assume !false; {35758#true} is VALID [2022-04-27 15:29:31,738 INFO L290 TraceCheckUtils]: 15: Hoare triple {35758#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); {35758#true} is VALID [2022-04-27 15:29:31,738 INFO L290 TraceCheckUtils]: 16: Hoare triple {35758#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {35758#true} is VALID [2022-04-27 15:29:31,739 INFO L290 TraceCheckUtils]: 17: Hoare triple {35758#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {35758#true} is VALID [2022-04-27 15:29:31,739 INFO L290 TraceCheckUtils]: 18: Hoare triple {35758#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {35758#true} is VALID [2022-04-27 15:29:31,739 INFO L290 TraceCheckUtils]: 19: Hoare triple {35758#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {35758#true} is VALID [2022-04-27 15:29:31,739 INFO L290 TraceCheckUtils]: 20: Hoare triple {35758#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {35758#true} is VALID [2022-04-27 15:29:31,739 INFO L290 TraceCheckUtils]: 21: Hoare triple {35758#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {35758#true} is VALID [2022-04-27 15:29:31,739 INFO L290 TraceCheckUtils]: 22: Hoare triple {35758#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {35758#true} is VALID [2022-04-27 15:29:31,739 INFO L290 TraceCheckUtils]: 23: Hoare triple {35758#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {35758#true} is VALID [2022-04-27 15:29:31,739 INFO L290 TraceCheckUtils]: 24: Hoare triple {35758#true} assume 8464 == #t~mem55;havoc #t~mem55; {35758#true} is VALID [2022-04-27 15:29:31,739 INFO L290 TraceCheckUtils]: 25: Hoare triple {35758#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; {35758#true} is VALID [2022-04-27 15:29:31,739 INFO L290 TraceCheckUtils]: 26: Hoare triple {35758#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {35758#true} is VALID [2022-04-27 15:29:31,739 INFO L290 TraceCheckUtils]: 27: Hoare triple {35758#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); {35758#true} is VALID [2022-04-27 15:29:31,739 INFO L290 TraceCheckUtils]: 28: Hoare triple {35758#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); {35758#true} is VALID [2022-04-27 15:29:31,739 INFO L290 TraceCheckUtils]: 29: Hoare triple {35758#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {35758#true} is VALID [2022-04-27 15:29:31,739 INFO L290 TraceCheckUtils]: 30: Hoare triple {35758#true} ~skip~0 := 0; {35758#true} is VALID [2022-04-27 15:29:31,739 INFO L290 TraceCheckUtils]: 31: Hoare triple {35758#true} assume !false; {35758#true} is VALID [2022-04-27 15:29:31,739 INFO L290 TraceCheckUtils]: 32: Hoare triple {35758#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); {35758#true} is VALID [2022-04-27 15:29:31,740 INFO L290 TraceCheckUtils]: 33: Hoare triple {35758#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {35758#true} is VALID [2022-04-27 15:29:31,740 INFO L290 TraceCheckUtils]: 34: Hoare triple {35758#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {35758#true} is VALID [2022-04-27 15:29:31,740 INFO L290 TraceCheckUtils]: 35: Hoare triple {35758#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {35758#true} is VALID [2022-04-27 15:29:31,740 INFO L290 TraceCheckUtils]: 36: Hoare triple {35758#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {35758#true} is VALID [2022-04-27 15:29:31,740 INFO L290 TraceCheckUtils]: 37: Hoare triple {35758#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {35758#true} is VALID [2022-04-27 15:29:31,740 INFO L290 TraceCheckUtils]: 38: Hoare triple {35758#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {35758#true} is VALID [2022-04-27 15:29:31,740 INFO L290 TraceCheckUtils]: 39: Hoare triple {35758#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {35758#true} is VALID [2022-04-27 15:29:31,740 INFO L290 TraceCheckUtils]: 40: Hoare triple {35758#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {35758#true} is VALID [2022-04-27 15:29:31,740 INFO L290 TraceCheckUtils]: 41: Hoare triple {35758#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {35758#true} is VALID [2022-04-27 15:29:31,740 INFO L290 TraceCheckUtils]: 42: Hoare triple {35758#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {35758#true} is VALID [2022-04-27 15:29:31,740 INFO L290 TraceCheckUtils]: 43: Hoare triple {35758#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {35758#true} is VALID [2022-04-27 15:29:31,740 INFO L290 TraceCheckUtils]: 44: Hoare triple {35758#true} assume 8496 == #t~mem58;havoc #t~mem58; {35758#true} is VALID [2022-04-27 15:29:31,740 INFO L290 TraceCheckUtils]: 45: Hoare triple {35758#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {35758#true} is VALID [2022-04-27 15:29:31,740 INFO L290 TraceCheckUtils]: 46: Hoare triple {35758#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {35758#true} is VALID [2022-04-27 15:29:31,740 INFO L290 TraceCheckUtils]: 47: Hoare triple {35758#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {35758#true} is VALID [2022-04-27 15:29:31,741 INFO L290 TraceCheckUtils]: 48: Hoare triple {35758#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {35763#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:31,742 INFO L290 TraceCheckUtils]: 49: Hoare triple {35763#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {35763#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:31,742 INFO L290 TraceCheckUtils]: 50: Hoare triple {35763#(= 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); {35763#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:31,742 INFO L290 TraceCheckUtils]: 51: Hoare triple {35763#(= 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; {35763#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:31,743 INFO L290 TraceCheckUtils]: 52: Hoare triple {35763#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {35763#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:31,743 INFO L290 TraceCheckUtils]: 53: Hoare triple {35763#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {35763#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:31,743 INFO L290 TraceCheckUtils]: 54: Hoare triple {35763#(= 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); {35763#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:31,744 INFO L290 TraceCheckUtils]: 55: Hoare triple {35763#(= 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); {35763#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:31,744 INFO L290 TraceCheckUtils]: 56: Hoare triple {35763#(= 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); {35763#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:31,744 INFO L290 TraceCheckUtils]: 57: Hoare triple {35763#(= 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); {35763#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:31,745 INFO L290 TraceCheckUtils]: 58: Hoare triple {35763#(= 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); {35763#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:31,745 INFO L290 TraceCheckUtils]: 59: Hoare triple {35763#(= 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); {35763#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:31,745 INFO L290 TraceCheckUtils]: 60: Hoare triple {35763#(= 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); {35763#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:31,746 INFO L290 TraceCheckUtils]: 61: Hoare triple {35763#(= 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); {35763#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:31,746 INFO L290 TraceCheckUtils]: 62: Hoare triple {35763#(= 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); {35763#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:31,746 INFO L290 TraceCheckUtils]: 63: Hoare triple {35763#(= 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); {35763#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:31,747 INFO L290 TraceCheckUtils]: 64: Hoare triple {35763#(= 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); {35763#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:31,747 INFO L290 TraceCheckUtils]: 65: Hoare triple {35763#(= 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); {35763#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:31,747 INFO L290 TraceCheckUtils]: 66: Hoare triple {35763#(= 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); {35763#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:31,748 INFO L290 TraceCheckUtils]: 67: Hoare triple {35763#(= 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); {35763#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:31,748 INFO L290 TraceCheckUtils]: 68: Hoare triple {35763#(= 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); {35763#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:31,748 INFO L290 TraceCheckUtils]: 69: Hoare triple {35763#(= 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); {35763#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:31,749 INFO L290 TraceCheckUtils]: 70: Hoare triple {35763#(= 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); {35763#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:31,749 INFO L290 TraceCheckUtils]: 71: Hoare triple {35763#(= 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); {35763#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:31,749 INFO L290 TraceCheckUtils]: 72: Hoare triple {35763#(= 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); {35763#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:31,750 INFO L290 TraceCheckUtils]: 73: Hoare triple {35763#(= 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); {35763#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:31,750 INFO L290 TraceCheckUtils]: 74: Hoare triple {35763#(= 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); {35763#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:31,750 INFO L290 TraceCheckUtils]: 75: Hoare triple {35763#(= 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); {35764#(= |ssl3_accept_#t~mem68| 8656)} is VALID [2022-04-27 15:29:31,751 INFO L290 TraceCheckUtils]: 76: Hoare triple {35764#(= |ssl3_accept_#t~mem68| 8656)} assume 8448 == #t~mem68;havoc #t~mem68; {35759#false} is VALID [2022-04-27 15:29:31,751 INFO L290 TraceCheckUtils]: 77: Hoare triple {35759#false} assume !(~num1~0 > 0); {35759#false} is VALID [2022-04-27 15:29:31,752 INFO L290 TraceCheckUtils]: 78: Hoare triple {35759#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; {35759#false} is VALID [2022-04-27 15:29:31,752 INFO L290 TraceCheckUtils]: 79: Hoare triple {35759#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); {35759#false} is VALID [2022-04-27 15:29:31,752 INFO L290 TraceCheckUtils]: 80: Hoare triple {35759#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {35759#false} is VALID [2022-04-27 15:29:31,752 INFO L290 TraceCheckUtils]: 81: Hoare triple {35759#false} ~skip~0 := 0; {35759#false} is VALID [2022-04-27 15:29:31,752 INFO L290 TraceCheckUtils]: 82: Hoare triple {35759#false} assume !false; {35759#false} is VALID [2022-04-27 15:29:31,752 INFO L290 TraceCheckUtils]: 83: Hoare triple {35759#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); {35759#false} is VALID [2022-04-27 15:29:31,752 INFO L290 TraceCheckUtils]: 84: Hoare triple {35759#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {35759#false} is VALID [2022-04-27 15:29:31,752 INFO L290 TraceCheckUtils]: 85: Hoare triple {35759#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {35759#false} is VALID [2022-04-27 15:29:31,752 INFO L290 TraceCheckUtils]: 86: Hoare triple {35759#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {35759#false} is VALID [2022-04-27 15:29:31,752 INFO L290 TraceCheckUtils]: 87: Hoare triple {35759#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {35759#false} is VALID [2022-04-27 15:29:31,752 INFO L290 TraceCheckUtils]: 88: Hoare triple {35759#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {35759#false} is VALID [2022-04-27 15:29:31,752 INFO L290 TraceCheckUtils]: 89: Hoare triple {35759#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {35759#false} is VALID [2022-04-27 15:29:31,752 INFO L290 TraceCheckUtils]: 90: Hoare triple {35759#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {35759#false} is VALID [2022-04-27 15:29:31,752 INFO L290 TraceCheckUtils]: 91: Hoare triple {35759#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {35759#false} is VALID [2022-04-27 15:29:31,752 INFO L290 TraceCheckUtils]: 92: Hoare triple {35759#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {35759#false} is VALID [2022-04-27 15:29:31,752 INFO L290 TraceCheckUtils]: 93: Hoare triple {35759#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {35759#false} is VALID [2022-04-27 15:29:31,753 INFO L290 TraceCheckUtils]: 94: Hoare triple {35759#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {35759#false} is VALID [2022-04-27 15:29:31,753 INFO L290 TraceCheckUtils]: 95: Hoare triple {35759#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {35759#false} is VALID [2022-04-27 15:29:31,753 INFO L290 TraceCheckUtils]: 96: Hoare triple {35759#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {35759#false} is VALID [2022-04-27 15:29:31,753 INFO L290 TraceCheckUtils]: 97: Hoare triple {35759#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {35759#false} is VALID [2022-04-27 15:29:31,753 INFO L290 TraceCheckUtils]: 98: Hoare triple {35759#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {35759#false} is VALID [2022-04-27 15:29:31,753 INFO L290 TraceCheckUtils]: 99: Hoare triple {35759#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {35759#false} is VALID [2022-04-27 15:29:31,753 INFO L290 TraceCheckUtils]: 100: Hoare triple {35759#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {35759#false} is VALID [2022-04-27 15:29:31,753 INFO L290 TraceCheckUtils]: 101: Hoare triple {35759#false} assume 8544 == #t~mem64;havoc #t~mem64; {35759#false} is VALID [2022-04-27 15:29:31,753 INFO L290 TraceCheckUtils]: 102: Hoare triple {35759#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {35759#false} is VALID [2022-04-27 15:29:31,753 INFO L290 TraceCheckUtils]: 103: Hoare triple {35759#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); {35759#false} is VALID [2022-04-27 15:29:31,753 INFO L290 TraceCheckUtils]: 104: Hoare triple {35759#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {35759#false} is VALID [2022-04-27 15:29:31,753 INFO L290 TraceCheckUtils]: 105: Hoare triple {35759#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); {35759#false} is VALID [2022-04-27 15:29:31,753 INFO L290 TraceCheckUtils]: 106: Hoare triple {35759#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; {35759#false} is VALID [2022-04-27 15:29:31,753 INFO L290 TraceCheckUtils]: 107: Hoare triple {35759#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; {35759#false} is VALID [2022-04-27 15:29:31,753 INFO L290 TraceCheckUtils]: 108: Hoare triple {35759#false} assume 8 == ~blastFlag~0; {35759#false} is VALID [2022-04-27 15:29:31,753 INFO L290 TraceCheckUtils]: 109: Hoare triple {35759#false} assume !false; {35759#false} is VALID [2022-04-27 15:29:31,754 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-27 15:29:31,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:29:31,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095735400] [2022-04-27 15:29:31,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095735400] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:29:31,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:29:31,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:29:31,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181976936] [2022-04-27 15:29:31,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:29:31,755 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2022-04-27 15:29:31,755 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:29:31,755 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:31,824 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:29:31,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:29:31,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:29:31,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:29:31,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:29:31,825 INFO L87 Difference]: Start difference. First operand 354 states and 536 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:37,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:29:37,666 INFO L93 Difference]: Finished difference Result 735 states and 1117 transitions. [2022-04-27 15:29:37,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:29:37,666 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2022-04-27 15:29:37,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:29:37,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:37,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 529 transitions. [2022-04-27 15:29:37,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:37,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 529 transitions. [2022-04-27 15:29:37,670 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 529 transitions. [2022-04-27 15:29:37,974 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 529 edges. 529 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:29:37,980 INFO L225 Difference]: With dead ends: 735 [2022-04-27 15:29:37,980 INFO L226 Difference]: Without dead ends: 407 [2022-04-27 15:29:37,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:29:37,996 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 70 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-27 15:29:37,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 499 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-04-27 15:29:37,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2022-04-27 15:29:38,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 359. [2022-04-27 15:29:38,014 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:29:38,014 INFO L82 GeneralOperation]: Start isEquivalent. First operand 407 states. Second operand has 359 states, 354 states have (on average 1.5225988700564972) internal successors, (539), 354 states have internal predecessors, (539), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:38,015 INFO L74 IsIncluded]: Start isIncluded. First operand 407 states. Second operand has 359 states, 354 states have (on average 1.5225988700564972) internal successors, (539), 354 states have internal predecessors, (539), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:38,015 INFO L87 Difference]: Start difference. First operand 407 states. Second operand has 359 states, 354 states have (on average 1.5225988700564972) internal successors, (539), 354 states have internal predecessors, (539), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:38,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:29:38,021 INFO L93 Difference]: Finished difference Result 407 states and 610 transitions. [2022-04-27 15:29:38,021 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 610 transitions. [2022-04-27 15:29:38,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:29:38,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:29:38,021 INFO L74 IsIncluded]: Start isIncluded. First operand has 359 states, 354 states have (on average 1.5225988700564972) internal successors, (539), 354 states have internal predecessors, (539), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 407 states. [2022-04-27 15:29:38,022 INFO L87 Difference]: Start difference. First operand has 359 states, 354 states have (on average 1.5225988700564972) internal successors, (539), 354 states have internal predecessors, (539), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 407 states. [2022-04-27 15:29:38,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:29:38,044 INFO L93 Difference]: Finished difference Result 407 states and 610 transitions. [2022-04-27 15:29:38,044 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 610 transitions. [2022-04-27 15:29:38,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:29:38,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:29:38,044 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:29:38,044 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:29:38,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 354 states have (on average 1.5225988700564972) internal successors, (539), 354 states have internal predecessors, (539), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:38,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 543 transitions. [2022-04-27 15:29:38,049 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 543 transitions. Word has length 110 [2022-04-27 15:29:38,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:29:38,050 INFO L495 AbstractCegarLoop]: Abstraction has 359 states and 543 transitions. [2022-04-27 15:29:38,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:38,050 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 543 transitions. [2022-04-27 15:29:38,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-04-27 15:29:38,050 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:29:38,050 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:29:38,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-27 15:29:38,051 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:29:38,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:29:38,051 INFO L85 PathProgramCache]: Analyzing trace with hash -343686549, now seen corresponding path program 1 times [2022-04-27 15:29:38,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:29:38,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87126526] [2022-04-27 15:29:38,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:29:38,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:29:38,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:29:38,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:29:38,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:29:38,168 INFO L290 TraceCheckUtils]: 0: Hoare triple {37820#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {37813#true} is VALID [2022-04-27 15:29:38,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {37813#true} assume true; {37813#true} is VALID [2022-04-27 15:29:38,168 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37813#true} {37813#true} #689#return; {37813#true} is VALID [2022-04-27 15:29:38,168 INFO L272 TraceCheckUtils]: 0: Hoare triple {37813#true} call ULTIMATE.init(); {37820#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:29:38,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {37820#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {37813#true} is VALID [2022-04-27 15:29:38,169 INFO L290 TraceCheckUtils]: 2: Hoare triple {37813#true} assume true; {37813#true} is VALID [2022-04-27 15:29:38,169 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37813#true} {37813#true} #689#return; {37813#true} is VALID [2022-04-27 15:29:38,169 INFO L272 TraceCheckUtils]: 4: Hoare triple {37813#true} call #t~ret161 := main(); {37813#true} is VALID [2022-04-27 15:29:38,169 INFO L290 TraceCheckUtils]: 5: Hoare triple {37813#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; {37813#true} is VALID [2022-04-27 15:29:38,169 INFO L290 TraceCheckUtils]: 6: Hoare triple {37813#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {37813#true} is VALID [2022-04-27 15:29:38,169 INFO L272 TraceCheckUtils]: 7: Hoare triple {37813#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {37813#true} is VALID [2022-04-27 15:29:38,169 INFO L290 TraceCheckUtils]: 8: Hoare triple {37813#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); {37813#true} is VALID [2022-04-27 15:29:38,169 INFO L290 TraceCheckUtils]: 9: Hoare triple {37813#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; {37813#true} is VALID [2022-04-27 15:29:38,169 INFO L290 TraceCheckUtils]: 10: Hoare triple {37813#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; {37813#true} is VALID [2022-04-27 15:29:38,169 INFO L290 TraceCheckUtils]: 11: Hoare triple {37813#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {37813#true} is VALID [2022-04-27 15:29:38,169 INFO L290 TraceCheckUtils]: 12: Hoare triple {37813#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {37813#true} is VALID [2022-04-27 15:29:38,169 INFO L290 TraceCheckUtils]: 13: Hoare triple {37813#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {37813#true} is VALID [2022-04-27 15:29:38,169 INFO L290 TraceCheckUtils]: 14: Hoare triple {37813#true} assume !false; {37813#true} is VALID [2022-04-27 15:29:38,169 INFO L290 TraceCheckUtils]: 15: Hoare triple {37813#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); {37813#true} is VALID [2022-04-27 15:29:38,169 INFO L290 TraceCheckUtils]: 16: Hoare triple {37813#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {37813#true} is VALID [2022-04-27 15:29:38,170 INFO L290 TraceCheckUtils]: 17: Hoare triple {37813#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {37813#true} is VALID [2022-04-27 15:29:38,170 INFO L290 TraceCheckUtils]: 18: Hoare triple {37813#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {37813#true} is VALID [2022-04-27 15:29:38,170 INFO L290 TraceCheckUtils]: 19: Hoare triple {37813#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {37813#true} is VALID [2022-04-27 15:29:38,170 INFO L290 TraceCheckUtils]: 20: Hoare triple {37813#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {37813#true} is VALID [2022-04-27 15:29:38,170 INFO L290 TraceCheckUtils]: 21: Hoare triple {37813#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {37813#true} is VALID [2022-04-27 15:29:38,170 INFO L290 TraceCheckUtils]: 22: Hoare triple {37813#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {37813#true} is VALID [2022-04-27 15:29:38,170 INFO L290 TraceCheckUtils]: 23: Hoare triple {37813#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {37813#true} is VALID [2022-04-27 15:29:38,170 INFO L290 TraceCheckUtils]: 24: Hoare triple {37813#true} assume 8464 == #t~mem55;havoc #t~mem55; {37813#true} is VALID [2022-04-27 15:29:38,170 INFO L290 TraceCheckUtils]: 25: Hoare triple {37813#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; {37813#true} is VALID [2022-04-27 15:29:38,170 INFO L290 TraceCheckUtils]: 26: Hoare triple {37813#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {37813#true} is VALID [2022-04-27 15:29:38,170 INFO L290 TraceCheckUtils]: 27: Hoare triple {37813#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); {37813#true} is VALID [2022-04-27 15:29:38,170 INFO L290 TraceCheckUtils]: 28: Hoare triple {37813#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); {37813#true} is VALID [2022-04-27 15:29:38,170 INFO L290 TraceCheckUtils]: 29: Hoare triple {37813#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {37813#true} is VALID [2022-04-27 15:29:38,170 INFO L290 TraceCheckUtils]: 30: Hoare triple {37813#true} ~skip~0 := 0; {37813#true} is VALID [2022-04-27 15:29:38,170 INFO L290 TraceCheckUtils]: 31: Hoare triple {37813#true} assume !false; {37813#true} is VALID [2022-04-27 15:29:38,170 INFO L290 TraceCheckUtils]: 32: Hoare triple {37813#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); {37813#true} is VALID [2022-04-27 15:29:38,170 INFO L290 TraceCheckUtils]: 33: Hoare triple {37813#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {37813#true} is VALID [2022-04-27 15:29:38,171 INFO L290 TraceCheckUtils]: 34: Hoare triple {37813#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {37813#true} is VALID [2022-04-27 15:29:38,171 INFO L290 TraceCheckUtils]: 35: Hoare triple {37813#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {37813#true} is VALID [2022-04-27 15:29:38,171 INFO L290 TraceCheckUtils]: 36: Hoare triple {37813#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {37813#true} is VALID [2022-04-27 15:29:38,171 INFO L290 TraceCheckUtils]: 37: Hoare triple {37813#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {37813#true} is VALID [2022-04-27 15:29:38,171 INFO L290 TraceCheckUtils]: 38: Hoare triple {37813#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {37813#true} is VALID [2022-04-27 15:29:38,171 INFO L290 TraceCheckUtils]: 39: Hoare triple {37813#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {37813#true} is VALID [2022-04-27 15:29:38,171 INFO L290 TraceCheckUtils]: 40: Hoare triple {37813#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {37813#true} is VALID [2022-04-27 15:29:38,171 INFO L290 TraceCheckUtils]: 41: Hoare triple {37813#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {37813#true} is VALID [2022-04-27 15:29:38,171 INFO L290 TraceCheckUtils]: 42: Hoare triple {37813#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {37813#true} is VALID [2022-04-27 15:29:38,171 INFO L290 TraceCheckUtils]: 43: Hoare triple {37813#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {37813#true} is VALID [2022-04-27 15:29:38,171 INFO L290 TraceCheckUtils]: 44: Hoare triple {37813#true} assume 8496 == #t~mem58;havoc #t~mem58; {37813#true} is VALID [2022-04-27 15:29:38,171 INFO L290 TraceCheckUtils]: 45: Hoare triple {37813#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {37813#true} is VALID [2022-04-27 15:29:38,171 INFO L290 TraceCheckUtils]: 46: Hoare triple {37813#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {37813#true} is VALID [2022-04-27 15:29:38,171 INFO L290 TraceCheckUtils]: 47: Hoare triple {37813#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {37813#true} is VALID [2022-04-27 15:29:38,172 INFO L290 TraceCheckUtils]: 48: Hoare triple {37813#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {37818#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:29:38,173 INFO L290 TraceCheckUtils]: 49: Hoare triple {37818#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {37818#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:29:38,173 INFO L290 TraceCheckUtils]: 50: Hoare triple {37818#(= (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); {37818#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:29:38,173 INFO L290 TraceCheckUtils]: 51: Hoare triple {37818#(= (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; {37818#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:29:38,174 INFO L290 TraceCheckUtils]: 52: Hoare triple {37818#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} ~skip~0 := 0; {37818#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:29:38,174 INFO L290 TraceCheckUtils]: 53: Hoare triple {37818#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !false; {37818#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:29:38,174 INFO L290 TraceCheckUtils]: 54: Hoare triple {37818#(= (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); {37818#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:29:38,175 INFO L290 TraceCheckUtils]: 55: Hoare triple {37818#(= (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); {37818#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:29:38,175 INFO L290 TraceCheckUtils]: 56: Hoare triple {37818#(= (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); {37818#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:29:38,175 INFO L290 TraceCheckUtils]: 57: Hoare triple {37818#(= (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); {37818#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:29:38,176 INFO L290 TraceCheckUtils]: 58: Hoare triple {37818#(= (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); {37818#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:29:38,176 INFO L290 TraceCheckUtils]: 59: Hoare triple {37818#(= (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); {37818#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:29:38,176 INFO L290 TraceCheckUtils]: 60: Hoare triple {37818#(= (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); {37818#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:29:38,177 INFO L290 TraceCheckUtils]: 61: Hoare triple {37818#(= (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); {37818#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:29:38,177 INFO L290 TraceCheckUtils]: 62: Hoare triple {37818#(= (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); {37818#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:29:38,177 INFO L290 TraceCheckUtils]: 63: Hoare triple {37818#(= (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); {37818#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:29:38,178 INFO L290 TraceCheckUtils]: 64: Hoare triple {37818#(= (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); {37818#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:29:38,178 INFO L290 TraceCheckUtils]: 65: Hoare triple {37818#(= (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); {37818#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:29:38,178 INFO L290 TraceCheckUtils]: 66: Hoare triple {37818#(= (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); {37818#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:29:38,179 INFO L290 TraceCheckUtils]: 67: Hoare triple {37818#(= (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); {37819#(= |ssl3_accept_#t~mem60| 8512)} is VALID [2022-04-27 15:29:38,179 INFO L290 TraceCheckUtils]: 68: Hoare triple {37819#(= |ssl3_accept_#t~mem60| 8512)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {37814#false} is VALID [2022-04-27 15:29:38,179 INFO L290 TraceCheckUtils]: 69: Hoare triple {37814#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {37814#false} is VALID [2022-04-27 15:29:38,179 INFO L290 TraceCheckUtils]: 70: Hoare triple {37814#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {37814#false} is VALID [2022-04-27 15:29:38,179 INFO L290 TraceCheckUtils]: 71: Hoare triple {37814#false} assume 8529 == #t~mem63;havoc #t~mem63; {37814#false} is VALID [2022-04-27 15:29:38,179 INFO L290 TraceCheckUtils]: 72: Hoare triple {37814#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); {37814#false} is VALID [2022-04-27 15:29:38,179 INFO L290 TraceCheckUtils]: 73: Hoare triple {37814#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; {37814#false} is VALID [2022-04-27 15:29:38,179 INFO L290 TraceCheckUtils]: 74: Hoare triple {37814#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); {37814#false} is VALID [2022-04-27 15:29:38,179 INFO L290 TraceCheckUtils]: 75: Hoare triple {37814#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {37814#false} is VALID [2022-04-27 15:29:38,180 INFO L290 TraceCheckUtils]: 76: Hoare triple {37814#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {37814#false} is VALID [2022-04-27 15:29:38,180 INFO L290 TraceCheckUtils]: 77: Hoare triple {37814#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {37814#false} is VALID [2022-04-27 15:29:38,180 INFO L290 TraceCheckUtils]: 78: Hoare triple {37814#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {37814#false} is VALID [2022-04-27 15:29:38,180 INFO L290 TraceCheckUtils]: 79: Hoare triple {37814#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); {37814#false} is VALID [2022-04-27 15:29:38,180 INFO L290 TraceCheckUtils]: 80: Hoare triple {37814#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {37814#false} is VALID [2022-04-27 15:29:38,180 INFO L290 TraceCheckUtils]: 81: Hoare triple {37814#false} ~skip~0 := 0; {37814#false} is VALID [2022-04-27 15:29:38,180 INFO L290 TraceCheckUtils]: 82: Hoare triple {37814#false} assume !false; {37814#false} is VALID [2022-04-27 15:29:38,180 INFO L290 TraceCheckUtils]: 83: Hoare triple {37814#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); {37814#false} is VALID [2022-04-27 15:29:38,180 INFO L290 TraceCheckUtils]: 84: Hoare triple {37814#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {37814#false} is VALID [2022-04-27 15:29:38,180 INFO L290 TraceCheckUtils]: 85: Hoare triple {37814#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {37814#false} is VALID [2022-04-27 15:29:38,180 INFO L290 TraceCheckUtils]: 86: Hoare triple {37814#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {37814#false} is VALID [2022-04-27 15:29:38,180 INFO L290 TraceCheckUtils]: 87: Hoare triple {37814#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {37814#false} is VALID [2022-04-27 15:29:38,180 INFO L290 TraceCheckUtils]: 88: Hoare triple {37814#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {37814#false} is VALID [2022-04-27 15:29:38,180 INFO L290 TraceCheckUtils]: 89: Hoare triple {37814#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {37814#false} is VALID [2022-04-27 15:29:38,180 INFO L290 TraceCheckUtils]: 90: Hoare triple {37814#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {37814#false} is VALID [2022-04-27 15:29:38,180 INFO L290 TraceCheckUtils]: 91: Hoare triple {37814#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {37814#false} is VALID [2022-04-27 15:29:38,180 INFO L290 TraceCheckUtils]: 92: Hoare triple {37814#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {37814#false} is VALID [2022-04-27 15:29:38,181 INFO L290 TraceCheckUtils]: 93: Hoare triple {37814#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {37814#false} is VALID [2022-04-27 15:29:38,181 INFO L290 TraceCheckUtils]: 94: Hoare triple {37814#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {37814#false} is VALID [2022-04-27 15:29:38,181 INFO L290 TraceCheckUtils]: 95: Hoare triple {37814#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {37814#false} is VALID [2022-04-27 15:29:38,181 INFO L290 TraceCheckUtils]: 96: Hoare triple {37814#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {37814#false} is VALID [2022-04-27 15:29:38,181 INFO L290 TraceCheckUtils]: 97: Hoare triple {37814#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {37814#false} is VALID [2022-04-27 15:29:38,181 INFO L290 TraceCheckUtils]: 98: Hoare triple {37814#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {37814#false} is VALID [2022-04-27 15:29:38,181 INFO L290 TraceCheckUtils]: 99: Hoare triple {37814#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {37814#false} is VALID [2022-04-27 15:29:38,181 INFO L290 TraceCheckUtils]: 100: Hoare triple {37814#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {37814#false} is VALID [2022-04-27 15:29:38,181 INFO L290 TraceCheckUtils]: 101: Hoare triple {37814#false} assume 8544 == #t~mem64;havoc #t~mem64; {37814#false} is VALID [2022-04-27 15:29:38,181 INFO L290 TraceCheckUtils]: 102: Hoare triple {37814#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {37814#false} is VALID [2022-04-27 15:29:38,181 INFO L290 TraceCheckUtils]: 103: Hoare triple {37814#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); {37814#false} is VALID [2022-04-27 15:29:38,181 INFO L290 TraceCheckUtils]: 104: Hoare triple {37814#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {37814#false} is VALID [2022-04-27 15:29:38,181 INFO L290 TraceCheckUtils]: 105: Hoare triple {37814#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); {37814#false} is VALID [2022-04-27 15:29:38,181 INFO L290 TraceCheckUtils]: 106: Hoare triple {37814#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; {37814#false} is VALID [2022-04-27 15:29:38,181 INFO L290 TraceCheckUtils]: 107: Hoare triple {37814#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; {37814#false} is VALID [2022-04-27 15:29:38,182 INFO L290 TraceCheckUtils]: 108: Hoare triple {37814#false} assume 8 == ~blastFlag~0; {37814#false} is VALID [2022-04-27 15:29:38,182 INFO L290 TraceCheckUtils]: 109: Hoare triple {37814#false} assume !false; {37814#false} is VALID [2022-04-27 15:29:38,182 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-27 15:29:38,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:29:38,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87126526] [2022-04-27 15:29:38,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87126526] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:29:38,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:29:38,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:29:38,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750669711] [2022-04-27 15:29:38,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:29:38,184 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2022-04-27 15:29:38,184 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:29:38,184 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:38,262 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:29:38,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:29:38,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:29:38,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:29:38,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:29:38,263 INFO L87 Difference]: Start difference. First operand 359 states and 543 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:41,572 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:29:44,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:29:44,777 INFO L93 Difference]: Finished difference Result 738 states and 1123 transitions. [2022-04-27 15:29:44,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:29:44,777 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2022-04-27 15:29:44,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:29:44,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:44,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 479 transitions. [2022-04-27 15:29:44,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:44,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 479 transitions. [2022-04-27 15:29:44,782 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 479 transitions. [2022-04-27 15:29:45,084 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 479 edges. 479 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:29:45,090 INFO L225 Difference]: With dead ends: 738 [2022-04-27 15:29:45,090 INFO L226 Difference]: Without dead ends: 405 [2022-04-27 15:29:45,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:29:45,092 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 36 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-04-27 15:29:45,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 603 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-04-27 15:29:45,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2022-04-27 15:29:45,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 383. [2022-04-27 15:29:45,108 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:29:45,108 INFO L82 GeneralOperation]: Start isEquivalent. First operand 405 states. Second operand has 383 states, 378 states have (on average 1.5211640211640212) internal successors, (575), 378 states have internal predecessors, (575), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:45,109 INFO L74 IsIncluded]: Start isIncluded. First operand 405 states. Second operand has 383 states, 378 states have (on average 1.5211640211640212) internal successors, (575), 378 states have internal predecessors, (575), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:45,109 INFO L87 Difference]: Start difference. First operand 405 states. Second operand has 383 states, 378 states have (on average 1.5211640211640212) internal successors, (575), 378 states have internal predecessors, (575), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:45,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:29:45,114 INFO L93 Difference]: Finished difference Result 405 states and 609 transitions. [2022-04-27 15:29:45,114 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 609 transitions. [2022-04-27 15:29:45,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:29:45,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:29:45,122 INFO L74 IsIncluded]: Start isIncluded. First operand has 383 states, 378 states have (on average 1.5211640211640212) internal successors, (575), 378 states have internal predecessors, (575), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 405 states. [2022-04-27 15:29:45,123 INFO L87 Difference]: Start difference. First operand has 383 states, 378 states have (on average 1.5211640211640212) internal successors, (575), 378 states have internal predecessors, (575), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 405 states. [2022-04-27 15:29:45,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:29:45,129 INFO L93 Difference]: Finished difference Result 405 states and 609 transitions. [2022-04-27 15:29:45,129 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 609 transitions. [2022-04-27 15:29:45,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:29:45,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:29:45,129 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:29:45,129 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:29:45,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 378 states have (on average 1.5211640211640212) internal successors, (575), 378 states have internal predecessors, (575), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:45,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 579 transitions. [2022-04-27 15:29:45,134 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 579 transitions. Word has length 110 [2022-04-27 15:29:45,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:29:45,135 INFO L495 AbstractCegarLoop]: Abstraction has 383 states and 579 transitions. [2022-04-27 15:29:45,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:45,135 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 579 transitions. [2022-04-27 15:29:45,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-04-27 15:29:45,135 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:29:45,136 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:29:45,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-27 15:29:45,136 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:29:45,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:29:45,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1495666253, now seen corresponding path program 1 times [2022-04-27 15:29:45,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:29:45,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997675954] [2022-04-27 15:29:45,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:29:45,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:29:45,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:29:45,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:29:45,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:29:45,256 INFO L290 TraceCheckUtils]: 0: Hoare triple {39896#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {39889#true} is VALID [2022-04-27 15:29:45,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {39889#true} assume true; {39889#true} is VALID [2022-04-27 15:29:45,256 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39889#true} {39889#true} #689#return; {39889#true} is VALID [2022-04-27 15:29:45,257 INFO L272 TraceCheckUtils]: 0: Hoare triple {39889#true} call ULTIMATE.init(); {39896#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:29:45,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {39896#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {39889#true} is VALID [2022-04-27 15:29:45,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {39889#true} assume true; {39889#true} is VALID [2022-04-27 15:29:45,257 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39889#true} {39889#true} #689#return; {39889#true} is VALID [2022-04-27 15:29:45,257 INFO L272 TraceCheckUtils]: 4: Hoare triple {39889#true} call #t~ret161 := main(); {39889#true} is VALID [2022-04-27 15:29:45,257 INFO L290 TraceCheckUtils]: 5: Hoare triple {39889#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; {39889#true} is VALID [2022-04-27 15:29:45,258 INFO L290 TraceCheckUtils]: 6: Hoare triple {39889#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {39889#true} is VALID [2022-04-27 15:29:45,258 INFO L272 TraceCheckUtils]: 7: Hoare triple {39889#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {39889#true} is VALID [2022-04-27 15:29:45,258 INFO L290 TraceCheckUtils]: 8: Hoare triple {39889#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); {39889#true} is VALID [2022-04-27 15:29:45,258 INFO L290 TraceCheckUtils]: 9: Hoare triple {39889#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; {39889#true} is VALID [2022-04-27 15:29:45,258 INFO L290 TraceCheckUtils]: 10: Hoare triple {39889#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; {39889#true} is VALID [2022-04-27 15:29:45,258 INFO L290 TraceCheckUtils]: 11: Hoare triple {39889#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {39889#true} is VALID [2022-04-27 15:29:45,258 INFO L290 TraceCheckUtils]: 12: Hoare triple {39889#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {39889#true} is VALID [2022-04-27 15:29:45,258 INFO L290 TraceCheckUtils]: 13: Hoare triple {39889#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {39889#true} is VALID [2022-04-27 15:29:45,258 INFO L290 TraceCheckUtils]: 14: Hoare triple {39889#true} assume !false; {39889#true} is VALID [2022-04-27 15:29:45,258 INFO L290 TraceCheckUtils]: 15: Hoare triple {39889#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); {39889#true} is VALID [2022-04-27 15:29:45,258 INFO L290 TraceCheckUtils]: 16: Hoare triple {39889#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {39889#true} is VALID [2022-04-27 15:29:45,258 INFO L290 TraceCheckUtils]: 17: Hoare triple {39889#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {39889#true} is VALID [2022-04-27 15:29:45,258 INFO L290 TraceCheckUtils]: 18: Hoare triple {39889#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {39889#true} is VALID [2022-04-27 15:29:45,258 INFO L290 TraceCheckUtils]: 19: Hoare triple {39889#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {39889#true} is VALID [2022-04-27 15:29:45,258 INFO L290 TraceCheckUtils]: 20: Hoare triple {39889#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {39889#true} is VALID [2022-04-27 15:29:45,258 INFO L290 TraceCheckUtils]: 21: Hoare triple {39889#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {39889#true} is VALID [2022-04-27 15:29:45,259 INFO L290 TraceCheckUtils]: 22: Hoare triple {39889#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {39889#true} is VALID [2022-04-27 15:29:45,259 INFO L290 TraceCheckUtils]: 23: Hoare triple {39889#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {39889#true} is VALID [2022-04-27 15:29:45,259 INFO L290 TraceCheckUtils]: 24: Hoare triple {39889#true} assume 8464 == #t~mem55;havoc #t~mem55; {39889#true} is VALID [2022-04-27 15:29:45,259 INFO L290 TraceCheckUtils]: 25: Hoare triple {39889#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; {39889#true} is VALID [2022-04-27 15:29:45,259 INFO L290 TraceCheckUtils]: 26: Hoare triple {39889#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {39889#true} is VALID [2022-04-27 15:29:45,259 INFO L290 TraceCheckUtils]: 27: Hoare triple {39889#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); {39889#true} is VALID [2022-04-27 15:29:45,259 INFO L290 TraceCheckUtils]: 28: Hoare triple {39889#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); {39889#true} is VALID [2022-04-27 15:29:45,259 INFO L290 TraceCheckUtils]: 29: Hoare triple {39889#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {39889#true} is VALID [2022-04-27 15:29:45,259 INFO L290 TraceCheckUtils]: 30: Hoare triple {39889#true} ~skip~0 := 0; {39889#true} is VALID [2022-04-27 15:29:45,259 INFO L290 TraceCheckUtils]: 31: Hoare triple {39889#true} assume !false; {39889#true} is VALID [2022-04-27 15:29:45,259 INFO L290 TraceCheckUtils]: 32: Hoare triple {39889#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); {39889#true} is VALID [2022-04-27 15:29:45,259 INFO L290 TraceCheckUtils]: 33: Hoare triple {39889#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {39889#true} is VALID [2022-04-27 15:29:45,259 INFO L290 TraceCheckUtils]: 34: Hoare triple {39889#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {39889#true} is VALID [2022-04-27 15:29:45,259 INFO L290 TraceCheckUtils]: 35: Hoare triple {39889#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {39889#true} is VALID [2022-04-27 15:29:45,259 INFO L290 TraceCheckUtils]: 36: Hoare triple {39889#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {39889#true} is VALID [2022-04-27 15:29:45,259 INFO L290 TraceCheckUtils]: 37: Hoare triple {39889#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {39889#true} is VALID [2022-04-27 15:29:45,259 INFO L290 TraceCheckUtils]: 38: Hoare triple {39889#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {39889#true} is VALID [2022-04-27 15:29:45,260 INFO L290 TraceCheckUtils]: 39: Hoare triple {39889#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {39889#true} is VALID [2022-04-27 15:29:45,260 INFO L290 TraceCheckUtils]: 40: Hoare triple {39889#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {39889#true} is VALID [2022-04-27 15:29:45,260 INFO L290 TraceCheckUtils]: 41: Hoare triple {39889#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {39889#true} is VALID [2022-04-27 15:29:45,260 INFO L290 TraceCheckUtils]: 42: Hoare triple {39889#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {39889#true} is VALID [2022-04-27 15:29:45,260 INFO L290 TraceCheckUtils]: 43: Hoare triple {39889#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {39889#true} is VALID [2022-04-27 15:29:45,260 INFO L290 TraceCheckUtils]: 44: Hoare triple {39889#true} assume 8496 == #t~mem58;havoc #t~mem58; {39889#true} is VALID [2022-04-27 15:29:45,260 INFO L290 TraceCheckUtils]: 45: Hoare triple {39889#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {39889#true} is VALID [2022-04-27 15:29:45,260 INFO L290 TraceCheckUtils]: 46: Hoare triple {39889#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {39889#true} is VALID [2022-04-27 15:29:45,260 INFO L290 TraceCheckUtils]: 47: Hoare triple {39889#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {39889#true} is VALID [2022-04-27 15:29:45,261 INFO L290 TraceCheckUtils]: 48: Hoare triple {39889#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {39894#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:45,261 INFO L290 TraceCheckUtils]: 49: Hoare triple {39894#(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); {39894#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:45,262 INFO L290 TraceCheckUtils]: 50: Hoare triple {39894#(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); {39894#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:45,262 INFO L290 TraceCheckUtils]: 51: Hoare triple {39894#(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; {39894#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:45,262 INFO L290 TraceCheckUtils]: 52: Hoare triple {39894#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {39894#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:45,263 INFO L290 TraceCheckUtils]: 53: Hoare triple {39894#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {39894#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:45,263 INFO L290 TraceCheckUtils]: 54: Hoare triple {39894#(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); {39894#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:45,263 INFO L290 TraceCheckUtils]: 55: Hoare triple {39894#(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); {39894#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:45,264 INFO L290 TraceCheckUtils]: 56: Hoare triple {39894#(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); {39894#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:45,264 INFO L290 TraceCheckUtils]: 57: Hoare triple {39894#(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); {39894#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:45,264 INFO L290 TraceCheckUtils]: 58: Hoare triple {39894#(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); {39894#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:45,264 INFO L290 TraceCheckUtils]: 59: Hoare triple {39894#(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); {39894#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:45,265 INFO L290 TraceCheckUtils]: 60: Hoare triple {39894#(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); {39894#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:45,265 INFO L290 TraceCheckUtils]: 61: Hoare triple {39894#(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); {39894#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:45,265 INFO L290 TraceCheckUtils]: 62: Hoare triple {39894#(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); {39894#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:45,266 INFO L290 TraceCheckUtils]: 63: Hoare triple {39894#(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); {39894#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:45,266 INFO L290 TraceCheckUtils]: 64: Hoare triple {39894#(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); {39894#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:45,266 INFO L290 TraceCheckUtils]: 65: Hoare triple {39894#(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); {39894#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:45,267 INFO L290 TraceCheckUtils]: 66: Hoare triple {39894#(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); {39894#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:45,267 INFO L290 TraceCheckUtils]: 67: Hoare triple {39894#(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); {39894#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:45,267 INFO L290 TraceCheckUtils]: 68: Hoare triple {39894#(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); {39894#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:45,268 INFO L290 TraceCheckUtils]: 69: Hoare triple {39894#(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); {39894#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:45,268 INFO L290 TraceCheckUtils]: 70: Hoare triple {39894#(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); {39894#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:45,268 INFO L290 TraceCheckUtils]: 71: Hoare triple {39894#(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); {39894#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:45,269 INFO L290 TraceCheckUtils]: 72: Hoare triple {39894#(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); {39894#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:45,269 INFO L290 TraceCheckUtils]: 73: Hoare triple {39894#(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); {39894#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:45,269 INFO L290 TraceCheckUtils]: 74: Hoare triple {39894#(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); {39894#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:45,270 INFO L290 TraceCheckUtils]: 75: Hoare triple {39894#(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); {39894#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:45,270 INFO L290 TraceCheckUtils]: 76: Hoare triple {39894#(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); {39894#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:45,270 INFO L290 TraceCheckUtils]: 77: Hoare triple {39894#(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); {39894#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:45,271 INFO L290 TraceCheckUtils]: 78: Hoare triple {39894#(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); {39894#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:45,271 INFO L290 TraceCheckUtils]: 79: Hoare triple {39894#(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); {39894#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:45,271 INFO L290 TraceCheckUtils]: 80: Hoare triple {39894#(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); {39895#(not (= |ssl3_accept_#t~mem73| 8608))} is VALID [2022-04-27 15:29:45,272 INFO L290 TraceCheckUtils]: 81: Hoare triple {39895#(not (= |ssl3_accept_#t~mem73| 8608))} assume 8608 == #t~mem73;havoc #t~mem73; {39890#false} is VALID [2022-04-27 15:29:45,272 INFO L290 TraceCheckUtils]: 82: Hoare triple {39890#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {39890#false} is VALID [2022-04-27 15:29:45,272 INFO L290 TraceCheckUtils]: 83: Hoare triple {39890#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); {39890#false} is VALID [2022-04-27 15:29:45,272 INFO L290 TraceCheckUtils]: 84: Hoare triple {39890#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); {39890#false} is VALID [2022-04-27 15:29:45,272 INFO L290 TraceCheckUtils]: 85: Hoare triple {39890#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {39890#false} is VALID [2022-04-27 15:29:45,272 INFO L290 TraceCheckUtils]: 86: Hoare triple {39890#false} ~skip~0 := 0; {39890#false} is VALID [2022-04-27 15:29:45,272 INFO L290 TraceCheckUtils]: 87: Hoare triple {39890#false} assume !false; {39890#false} is VALID [2022-04-27 15:29:45,272 INFO L290 TraceCheckUtils]: 88: Hoare triple {39890#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); {39890#false} is VALID [2022-04-27 15:29:45,272 INFO L290 TraceCheckUtils]: 89: Hoare triple {39890#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {39890#false} is VALID [2022-04-27 15:29:45,272 INFO L290 TraceCheckUtils]: 90: Hoare triple {39890#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {39890#false} is VALID [2022-04-27 15:29:45,272 INFO L290 TraceCheckUtils]: 91: Hoare triple {39890#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {39890#false} is VALID [2022-04-27 15:29:45,272 INFO L290 TraceCheckUtils]: 92: Hoare triple {39890#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {39890#false} is VALID [2022-04-27 15:29:45,272 INFO L290 TraceCheckUtils]: 93: Hoare triple {39890#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {39890#false} is VALID [2022-04-27 15:29:45,272 INFO L290 TraceCheckUtils]: 94: Hoare triple {39890#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {39890#false} is VALID [2022-04-27 15:29:45,273 INFO L290 TraceCheckUtils]: 95: Hoare triple {39890#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {39890#false} is VALID [2022-04-27 15:29:45,273 INFO L290 TraceCheckUtils]: 96: Hoare triple {39890#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {39890#false} is VALID [2022-04-27 15:29:45,273 INFO L290 TraceCheckUtils]: 97: Hoare triple {39890#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {39890#false} is VALID [2022-04-27 15:29:45,273 INFO L290 TraceCheckUtils]: 98: Hoare triple {39890#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {39890#false} is VALID [2022-04-27 15:29:45,273 INFO L290 TraceCheckUtils]: 99: Hoare triple {39890#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {39890#false} is VALID [2022-04-27 15:29:45,273 INFO L290 TraceCheckUtils]: 100: Hoare triple {39890#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {39890#false} is VALID [2022-04-27 15:29:45,273 INFO L290 TraceCheckUtils]: 101: Hoare triple {39890#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {39890#false} is VALID [2022-04-27 15:29:45,273 INFO L290 TraceCheckUtils]: 102: Hoare triple {39890#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {39890#false} is VALID [2022-04-27 15:29:45,273 INFO L290 TraceCheckUtils]: 103: Hoare triple {39890#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {39890#false} is VALID [2022-04-27 15:29:45,273 INFO L290 TraceCheckUtils]: 104: Hoare triple {39890#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {39890#false} is VALID [2022-04-27 15:29:45,273 INFO L290 TraceCheckUtils]: 105: Hoare triple {39890#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {39890#false} is VALID [2022-04-27 15:29:45,273 INFO L290 TraceCheckUtils]: 106: Hoare triple {39890#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {39890#false} is VALID [2022-04-27 15:29:45,273 INFO L290 TraceCheckUtils]: 107: Hoare triple {39890#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {39890#false} is VALID [2022-04-27 15:29:45,273 INFO L290 TraceCheckUtils]: 108: Hoare triple {39890#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {39890#false} is VALID [2022-04-27 15:29:45,273 INFO L290 TraceCheckUtils]: 109: Hoare triple {39890#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {39890#false} is VALID [2022-04-27 15:29:45,273 INFO L290 TraceCheckUtils]: 110: Hoare triple {39890#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {39890#false} is VALID [2022-04-27 15:29:45,273 INFO L290 TraceCheckUtils]: 111: Hoare triple {39890#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {39890#false} is VALID [2022-04-27 15:29:45,274 INFO L290 TraceCheckUtils]: 112: Hoare triple {39890#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {39890#false} is VALID [2022-04-27 15:29:45,274 INFO L290 TraceCheckUtils]: 113: Hoare triple {39890#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {39890#false} is VALID [2022-04-27 15:29:45,274 INFO L290 TraceCheckUtils]: 114: Hoare triple {39890#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {39890#false} is VALID [2022-04-27 15:29:45,274 INFO L290 TraceCheckUtils]: 115: Hoare triple {39890#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {39890#false} is VALID [2022-04-27 15:29:45,274 INFO L290 TraceCheckUtils]: 116: Hoare triple {39890#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {39890#false} is VALID [2022-04-27 15:29:45,274 INFO L290 TraceCheckUtils]: 117: Hoare triple {39890#false} assume 8640 == #t~mem75;havoc #t~mem75; {39890#false} is VALID [2022-04-27 15:29:45,274 INFO L290 TraceCheckUtils]: 118: Hoare triple {39890#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {39890#false} is VALID [2022-04-27 15:29:45,274 INFO L290 TraceCheckUtils]: 119: Hoare triple {39890#false} assume 4 == ~blastFlag~0; {39890#false} is VALID [2022-04-27 15:29:45,274 INFO L290 TraceCheckUtils]: 120: Hoare triple {39890#false} assume !false; {39890#false} is VALID [2022-04-27 15:29:45,274 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-27 15:29:45,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:29:45,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997675954] [2022-04-27 15:29:45,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997675954] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:29:45,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:29:45,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:29:45,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275118189] [2022-04-27 15:29:45,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:29:45,275 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 121 [2022-04-27 15:29:45,275 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:29:45,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:45,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:29:45,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:29:45,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:29:45,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:29:45,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:29:45,352 INFO L87 Difference]: Start difference. First operand 383 states and 579 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:50,590 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:29:52,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:29:52,480 INFO L93 Difference]: Finished difference Result 855 states and 1297 transitions. [2022-04-27 15:29:52,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:29:52,480 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 121 [2022-04-27 15:29:52,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:29:52,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:52,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 584 transitions. [2022-04-27 15:29:52,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:52,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 584 transitions. [2022-04-27 15:29:52,484 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 584 transitions. [2022-04-27 15:29:52,866 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 584 edges. 584 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:29:52,874 INFO L225 Difference]: With dead ends: 855 [2022-04-27 15:29:52,874 INFO L226 Difference]: Without dead ends: 498 [2022-04-27 15:29:52,875 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:29:52,875 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 116 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 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.7s IncrementalHoareTripleChecker+Time [2022-04-27 15:29:52,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 346 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-04-27 15:29:52,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2022-04-27 15:29:52,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 420. [2022-04-27 15:29:52,881 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:29:52,881 INFO L82 GeneralOperation]: Start isEquivalent. First operand 498 states. Second operand has 420 states, 415 states have (on average 1.5253012048192771) internal successors, (633), 415 states have internal predecessors, (633), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:52,882 INFO L74 IsIncluded]: Start isIncluded. First operand 498 states. Second operand has 420 states, 415 states have (on average 1.5253012048192771) internal successors, (633), 415 states have internal predecessors, (633), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:52,882 INFO L87 Difference]: Start difference. First operand 498 states. Second operand has 420 states, 415 states have (on average 1.5253012048192771) internal successors, (633), 415 states have internal predecessors, (633), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:52,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:29:52,889 INFO L93 Difference]: Finished difference Result 498 states and 746 transitions. [2022-04-27 15:29:52,889 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 746 transitions. [2022-04-27 15:29:52,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:29:52,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:29:52,890 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 498 states. [2022-04-27 15:29:52,891 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 498 states. [2022-04-27 15:29:52,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:29:52,898 INFO L93 Difference]: Finished difference Result 498 states and 746 transitions. [2022-04-27 15:29:52,898 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 746 transitions. [2022-04-27 15:29:52,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:29:52,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:29:52,899 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:29:52,899 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:29:52,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 415 states have (on average 1.5253012048192771) internal successors, (633), 415 states have internal predecessors, (633), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:52,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 637 transitions. [2022-04-27 15:29:52,905 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 637 transitions. Word has length 121 [2022-04-27 15:29:52,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:29:52,906 INFO L495 AbstractCegarLoop]: Abstraction has 420 states and 637 transitions. [2022-04-27 15:29:52,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:52,906 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 637 transitions. [2022-04-27 15:29:52,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-04-27 15:29:52,906 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:29:52,907 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:29:52,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-27 15:29:52,907 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:29:52,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:29:52,907 INFO L85 PathProgramCache]: Analyzing trace with hash 370746785, now seen corresponding path program 1 times [2022-04-27 15:29:52,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:29:52,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060980431] [2022-04-27 15:29:52,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:29:52,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:29:52,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:29:53,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:29:53,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:29:53,005 INFO L290 TraceCheckUtils]: 0: Hoare triple {42333#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {42326#true} is VALID [2022-04-27 15:29:53,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {42326#true} assume true; {42326#true} is VALID [2022-04-27 15:29:53,005 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42326#true} {42326#true} #689#return; {42326#true} is VALID [2022-04-27 15:29:53,005 INFO L272 TraceCheckUtils]: 0: Hoare triple {42326#true} call ULTIMATE.init(); {42333#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:29:53,006 INFO L290 TraceCheckUtils]: 1: Hoare triple {42333#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {42326#true} is VALID [2022-04-27 15:29:53,006 INFO L290 TraceCheckUtils]: 2: Hoare triple {42326#true} assume true; {42326#true} is VALID [2022-04-27 15:29:53,006 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42326#true} {42326#true} #689#return; {42326#true} is VALID [2022-04-27 15:29:53,006 INFO L272 TraceCheckUtils]: 4: Hoare triple {42326#true} call #t~ret161 := main(); {42326#true} is VALID [2022-04-27 15:29:53,006 INFO L290 TraceCheckUtils]: 5: Hoare triple {42326#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; {42326#true} is VALID [2022-04-27 15:29:53,006 INFO L290 TraceCheckUtils]: 6: Hoare triple {42326#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {42326#true} is VALID [2022-04-27 15:29:53,006 INFO L272 TraceCheckUtils]: 7: Hoare triple {42326#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {42326#true} is VALID [2022-04-27 15:29:53,006 INFO L290 TraceCheckUtils]: 8: Hoare triple {42326#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); {42326#true} is VALID [2022-04-27 15:29:53,006 INFO L290 TraceCheckUtils]: 9: Hoare triple {42326#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; {42326#true} is VALID [2022-04-27 15:29:53,006 INFO L290 TraceCheckUtils]: 10: Hoare triple {42326#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; {42326#true} is VALID [2022-04-27 15:29:53,006 INFO L290 TraceCheckUtils]: 11: Hoare triple {42326#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {42326#true} is VALID [2022-04-27 15:29:53,006 INFO L290 TraceCheckUtils]: 12: Hoare triple {42326#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {42326#true} is VALID [2022-04-27 15:29:53,006 INFO L290 TraceCheckUtils]: 13: Hoare triple {42326#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {42326#true} is VALID [2022-04-27 15:29:53,006 INFO L290 TraceCheckUtils]: 14: Hoare triple {42326#true} assume !false; {42326#true} is VALID [2022-04-27 15:29:53,006 INFO L290 TraceCheckUtils]: 15: Hoare triple {42326#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); {42326#true} is VALID [2022-04-27 15:29:53,006 INFO L290 TraceCheckUtils]: 16: Hoare triple {42326#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {42326#true} is VALID [2022-04-27 15:29:53,007 INFO L290 TraceCheckUtils]: 17: Hoare triple {42326#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {42326#true} is VALID [2022-04-27 15:29:53,007 INFO L290 TraceCheckUtils]: 18: Hoare triple {42326#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {42326#true} is VALID [2022-04-27 15:29:53,007 INFO L290 TraceCheckUtils]: 19: Hoare triple {42326#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {42326#true} is VALID [2022-04-27 15:29:53,007 INFO L290 TraceCheckUtils]: 20: Hoare triple {42326#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {42326#true} is VALID [2022-04-27 15:29:53,007 INFO L290 TraceCheckUtils]: 21: Hoare triple {42326#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {42326#true} is VALID [2022-04-27 15:29:53,007 INFO L290 TraceCheckUtils]: 22: Hoare triple {42326#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {42326#true} is VALID [2022-04-27 15:29:53,007 INFO L290 TraceCheckUtils]: 23: Hoare triple {42326#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {42326#true} is VALID [2022-04-27 15:29:53,007 INFO L290 TraceCheckUtils]: 24: Hoare triple {42326#true} assume 8464 == #t~mem55;havoc #t~mem55; {42326#true} is VALID [2022-04-27 15:29:53,007 INFO L290 TraceCheckUtils]: 25: Hoare triple {42326#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; {42326#true} is VALID [2022-04-27 15:29:53,007 INFO L290 TraceCheckUtils]: 26: Hoare triple {42326#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {42326#true} is VALID [2022-04-27 15:29:53,007 INFO L290 TraceCheckUtils]: 27: Hoare triple {42326#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); {42326#true} is VALID [2022-04-27 15:29:53,007 INFO L290 TraceCheckUtils]: 28: Hoare triple {42326#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); {42326#true} is VALID [2022-04-27 15:29:53,007 INFO L290 TraceCheckUtils]: 29: Hoare triple {42326#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {42326#true} is VALID [2022-04-27 15:29:53,007 INFO L290 TraceCheckUtils]: 30: Hoare triple {42326#true} ~skip~0 := 0; {42326#true} is VALID [2022-04-27 15:29:53,007 INFO L290 TraceCheckUtils]: 31: Hoare triple {42326#true} assume !false; {42326#true} is VALID [2022-04-27 15:29:53,007 INFO L290 TraceCheckUtils]: 32: Hoare triple {42326#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); {42326#true} is VALID [2022-04-27 15:29:53,008 INFO L290 TraceCheckUtils]: 33: Hoare triple {42326#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {42326#true} is VALID [2022-04-27 15:29:53,008 INFO L290 TraceCheckUtils]: 34: Hoare triple {42326#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {42326#true} is VALID [2022-04-27 15:29:53,008 INFO L290 TraceCheckUtils]: 35: Hoare triple {42326#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {42326#true} is VALID [2022-04-27 15:29:53,008 INFO L290 TraceCheckUtils]: 36: Hoare triple {42326#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {42326#true} is VALID [2022-04-27 15:29:53,008 INFO L290 TraceCheckUtils]: 37: Hoare triple {42326#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {42326#true} is VALID [2022-04-27 15:29:53,008 INFO L290 TraceCheckUtils]: 38: Hoare triple {42326#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {42326#true} is VALID [2022-04-27 15:29:53,008 INFO L290 TraceCheckUtils]: 39: Hoare triple {42326#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {42326#true} is VALID [2022-04-27 15:29:53,008 INFO L290 TraceCheckUtils]: 40: Hoare triple {42326#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {42326#true} is VALID [2022-04-27 15:29:53,008 INFO L290 TraceCheckUtils]: 41: Hoare triple {42326#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {42326#true} is VALID [2022-04-27 15:29:53,008 INFO L290 TraceCheckUtils]: 42: Hoare triple {42326#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {42326#true} is VALID [2022-04-27 15:29:53,008 INFO L290 TraceCheckUtils]: 43: Hoare triple {42326#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {42326#true} is VALID [2022-04-27 15:29:53,008 INFO L290 TraceCheckUtils]: 44: Hoare triple {42326#true} assume 8496 == #t~mem58;havoc #t~mem58; {42326#true} is VALID [2022-04-27 15:29:53,008 INFO L290 TraceCheckUtils]: 45: Hoare triple {42326#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {42326#true} is VALID [2022-04-27 15:29:53,008 INFO L290 TraceCheckUtils]: 46: Hoare triple {42326#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {42326#true} is VALID [2022-04-27 15:29:53,008 INFO L290 TraceCheckUtils]: 47: Hoare triple {42326#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {42326#true} is VALID [2022-04-27 15:29:53,009 INFO L290 TraceCheckUtils]: 48: Hoare triple {42326#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {42331#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:29:53,010 INFO L290 TraceCheckUtils]: 49: Hoare triple {42331#(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); {42331#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:29:53,010 INFO L290 TraceCheckUtils]: 50: Hoare triple {42331#(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); {42331#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:29:53,010 INFO L290 TraceCheckUtils]: 51: Hoare triple {42331#(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; {42331#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:29:53,011 INFO L290 TraceCheckUtils]: 52: Hoare triple {42331#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} ~skip~0 := 0; {42331#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:29:53,011 INFO L290 TraceCheckUtils]: 53: Hoare triple {42331#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !false; {42331#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:29:53,011 INFO L290 TraceCheckUtils]: 54: Hoare triple {42331#(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); {42331#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:29:53,012 INFO L290 TraceCheckUtils]: 55: Hoare triple {42331#(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); {42331#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:29:53,012 INFO L290 TraceCheckUtils]: 56: Hoare triple {42331#(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); {42331#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:29:53,012 INFO L290 TraceCheckUtils]: 57: Hoare triple {42331#(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); {42331#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:29:53,013 INFO L290 TraceCheckUtils]: 58: Hoare triple {42331#(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); {42331#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:29:53,013 INFO L290 TraceCheckUtils]: 59: Hoare triple {42331#(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); {42331#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:29:53,013 INFO L290 TraceCheckUtils]: 60: Hoare triple {42331#(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); {42331#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:29:53,014 INFO L290 TraceCheckUtils]: 61: Hoare triple {42331#(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); {42331#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:29:53,014 INFO L290 TraceCheckUtils]: 62: Hoare triple {42331#(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); {42331#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:29:53,014 INFO L290 TraceCheckUtils]: 63: Hoare triple {42331#(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); {42331#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:29:53,014 INFO L290 TraceCheckUtils]: 64: Hoare triple {42331#(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); {42331#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:29:53,015 INFO L290 TraceCheckUtils]: 65: Hoare triple {42331#(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); {42331#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:29:53,015 INFO L290 TraceCheckUtils]: 66: Hoare triple {42331#(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); {42331#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:29:53,015 INFO L290 TraceCheckUtils]: 67: Hoare triple {42331#(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); {42331#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:29:53,016 INFO L290 TraceCheckUtils]: 68: Hoare triple {42331#(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); {42331#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:29:53,016 INFO L290 TraceCheckUtils]: 69: Hoare triple {42331#(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); {42331#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:29:53,016 INFO L290 TraceCheckUtils]: 70: Hoare triple {42331#(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); {42331#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:29:53,017 INFO L290 TraceCheckUtils]: 71: Hoare triple {42331#(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); {42331#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:29:53,017 INFO L290 TraceCheckUtils]: 72: Hoare triple {42331#(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); {42331#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:29:53,017 INFO L290 TraceCheckUtils]: 73: Hoare triple {42331#(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); {42331#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:29:53,018 INFO L290 TraceCheckUtils]: 74: Hoare triple {42331#(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); {42331#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:29:53,018 INFO L290 TraceCheckUtils]: 75: Hoare triple {42331#(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); {42331#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:29:53,018 INFO L290 TraceCheckUtils]: 76: Hoare triple {42331#(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); {42331#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:29:53,019 INFO L290 TraceCheckUtils]: 77: Hoare triple {42331#(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); {42331#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:29:53,019 INFO L290 TraceCheckUtils]: 78: Hoare triple {42331#(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); {42331#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:29:53,019 INFO L290 TraceCheckUtils]: 79: Hoare triple {42331#(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); {42331#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:29:53,020 INFO L290 TraceCheckUtils]: 80: Hoare triple {42331#(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); {42331#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:29:53,020 INFO L290 TraceCheckUtils]: 81: Hoare triple {42331#(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); {42332#(not (= |ssl3_accept_#t~mem74| 8609))} is VALID [2022-04-27 15:29:53,020 INFO L290 TraceCheckUtils]: 82: Hoare triple {42332#(not (= |ssl3_accept_#t~mem74| 8609))} assume 8609 == #t~mem74;havoc #t~mem74; {42327#false} is VALID [2022-04-27 15:29:53,020 INFO L290 TraceCheckUtils]: 83: Hoare triple {42327#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {42327#false} is VALID [2022-04-27 15:29:53,020 INFO L290 TraceCheckUtils]: 84: Hoare triple {42327#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); {42327#false} is VALID [2022-04-27 15:29:53,020 INFO L290 TraceCheckUtils]: 85: Hoare triple {42327#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); {42327#false} is VALID [2022-04-27 15:29:53,021 INFO L290 TraceCheckUtils]: 86: Hoare triple {42327#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {42327#false} is VALID [2022-04-27 15:29:53,021 INFO L290 TraceCheckUtils]: 87: Hoare triple {42327#false} ~skip~0 := 0; {42327#false} is VALID [2022-04-27 15:29:53,021 INFO L290 TraceCheckUtils]: 88: Hoare triple {42327#false} assume !false; {42327#false} is VALID [2022-04-27 15:29:53,021 INFO L290 TraceCheckUtils]: 89: Hoare triple {42327#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); {42327#false} is VALID [2022-04-27 15:29:53,021 INFO L290 TraceCheckUtils]: 90: Hoare triple {42327#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {42327#false} is VALID [2022-04-27 15:29:53,021 INFO L290 TraceCheckUtils]: 91: Hoare triple {42327#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {42327#false} is VALID [2022-04-27 15:29:53,021 INFO L290 TraceCheckUtils]: 92: Hoare triple {42327#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {42327#false} is VALID [2022-04-27 15:29:53,021 INFO L290 TraceCheckUtils]: 93: Hoare triple {42327#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {42327#false} is VALID [2022-04-27 15:29:53,021 INFO L290 TraceCheckUtils]: 94: Hoare triple {42327#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {42327#false} is VALID [2022-04-27 15:29:53,021 INFO L290 TraceCheckUtils]: 95: Hoare triple {42327#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {42327#false} is VALID [2022-04-27 15:29:53,021 INFO L290 TraceCheckUtils]: 96: Hoare triple {42327#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {42327#false} is VALID [2022-04-27 15:29:53,021 INFO L290 TraceCheckUtils]: 97: Hoare triple {42327#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {42327#false} is VALID [2022-04-27 15:29:53,021 INFO L290 TraceCheckUtils]: 98: Hoare triple {42327#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {42327#false} is VALID [2022-04-27 15:29:53,021 INFO L290 TraceCheckUtils]: 99: Hoare triple {42327#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {42327#false} is VALID [2022-04-27 15:29:53,021 INFO L290 TraceCheckUtils]: 100: Hoare triple {42327#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {42327#false} is VALID [2022-04-27 15:29:53,021 INFO L290 TraceCheckUtils]: 101: Hoare triple {42327#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {42327#false} is VALID [2022-04-27 15:29:53,021 INFO L290 TraceCheckUtils]: 102: Hoare triple {42327#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {42327#false} is VALID [2022-04-27 15:29:53,022 INFO L290 TraceCheckUtils]: 103: Hoare triple {42327#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {42327#false} is VALID [2022-04-27 15:29:53,022 INFO L290 TraceCheckUtils]: 104: Hoare triple {42327#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {42327#false} is VALID [2022-04-27 15:29:53,022 INFO L290 TraceCheckUtils]: 105: Hoare triple {42327#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {42327#false} is VALID [2022-04-27 15:29:53,022 INFO L290 TraceCheckUtils]: 106: Hoare triple {42327#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {42327#false} is VALID [2022-04-27 15:29:53,022 INFO L290 TraceCheckUtils]: 107: Hoare triple {42327#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {42327#false} is VALID [2022-04-27 15:29:53,022 INFO L290 TraceCheckUtils]: 108: Hoare triple {42327#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {42327#false} is VALID [2022-04-27 15:29:53,022 INFO L290 TraceCheckUtils]: 109: Hoare triple {42327#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {42327#false} is VALID [2022-04-27 15:29:53,022 INFO L290 TraceCheckUtils]: 110: Hoare triple {42327#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {42327#false} is VALID [2022-04-27 15:29:53,022 INFO L290 TraceCheckUtils]: 111: Hoare triple {42327#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {42327#false} is VALID [2022-04-27 15:29:53,022 INFO L290 TraceCheckUtils]: 112: Hoare triple {42327#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {42327#false} is VALID [2022-04-27 15:29:53,022 INFO L290 TraceCheckUtils]: 113: Hoare triple {42327#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {42327#false} is VALID [2022-04-27 15:29:53,022 INFO L290 TraceCheckUtils]: 114: Hoare triple {42327#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {42327#false} is VALID [2022-04-27 15:29:53,022 INFO L290 TraceCheckUtils]: 115: Hoare triple {42327#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {42327#false} is VALID [2022-04-27 15:29:53,022 INFO L290 TraceCheckUtils]: 116: Hoare triple {42327#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {42327#false} is VALID [2022-04-27 15:29:53,022 INFO L290 TraceCheckUtils]: 117: Hoare triple {42327#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {42327#false} is VALID [2022-04-27 15:29:53,022 INFO L290 TraceCheckUtils]: 118: Hoare triple {42327#false} assume 8640 == #t~mem75;havoc #t~mem75; {42327#false} is VALID [2022-04-27 15:29:53,022 INFO L290 TraceCheckUtils]: 119: Hoare triple {42327#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {42327#false} is VALID [2022-04-27 15:29:53,023 INFO L290 TraceCheckUtils]: 120: Hoare triple {42327#false} assume 4 == ~blastFlag~0; {42327#false} is VALID [2022-04-27 15:29:53,023 INFO L290 TraceCheckUtils]: 121: Hoare triple {42327#false} assume !false; {42327#false} is VALID [2022-04-27 15:29:53,023 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-27 15:29:53,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:29:53,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060980431] [2022-04-27 15:29:53,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060980431] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:29:53,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:29:53,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:29:53,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478919955] [2022-04-27 15:29:53,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:29:53,024 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 122 [2022-04-27 15:29:53,024 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:29:53,024 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:53,097 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:29:53,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:29:53,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:29:53,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:29:53,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:29:53,098 INFO L87 Difference]: Start difference. First operand 420 states and 637 transitions. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:57,288 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:29:58,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:29:58,356 INFO L93 Difference]: Finished difference Result 889 states and 1349 transitions. [2022-04-27 15:29:58,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:29:58,356 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 122 [2022-04-27 15:29:58,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:29:58,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:58,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 584 transitions. [2022-04-27 15:29:58,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:58,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 584 transitions. [2022-04-27 15:29:58,360 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 584 transitions. [2022-04-27 15:29:58,749 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 584 edges. 584 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:29:58,758 INFO L225 Difference]: With dead ends: 889 [2022-04-27 15:29:58,758 INFO L226 Difference]: Without dead ends: 495 [2022-04-27 15:29:58,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:29:58,759 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 115 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 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.7s IncrementalHoareTripleChecker+Time [2022-04-27 15:29:58,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 346 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-04-27 15:29:58,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2022-04-27 15:29:58,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 420. [2022-04-27 15:29:58,764 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:29:58,779 INFO L82 GeneralOperation]: Start isEquivalent. First operand 495 states. Second operand has 420 states, 415 states have (on average 1.5204819277108435) internal successors, (631), 415 states have internal predecessors, (631), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:58,780 INFO L74 IsIncluded]: Start isIncluded. First operand 495 states. Second operand has 420 states, 415 states have (on average 1.5204819277108435) internal successors, (631), 415 states have internal predecessors, (631), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:58,780 INFO L87 Difference]: Start difference. First operand 495 states. Second operand has 420 states, 415 states have (on average 1.5204819277108435) internal successors, (631), 415 states have internal predecessors, (631), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:58,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:29:58,788 INFO L93 Difference]: Finished difference Result 495 states and 740 transitions. [2022-04-27 15:29:58,788 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 740 transitions. [2022-04-27 15:29:58,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:29:58,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:29:58,789 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 495 states. [2022-04-27 15:29:58,789 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 495 states. [2022-04-27 15:29:58,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:29:58,797 INFO L93 Difference]: Finished difference Result 495 states and 740 transitions. [2022-04-27 15:29:58,797 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 740 transitions. [2022-04-27 15:29:58,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:29:58,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:29:58,797 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:29:58,797 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:29:58,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 415 states have (on average 1.5204819277108435) internal successors, (631), 415 states have internal predecessors, (631), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:58,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 635 transitions. [2022-04-27 15:29:58,804 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 635 transitions. Word has length 122 [2022-04-27 15:29:58,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:29:58,804 INFO L495 AbstractCegarLoop]: Abstraction has 420 states and 635 transitions. [2022-04-27 15:29:58,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:58,804 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 635 transitions. [2022-04-27 15:29:58,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-04-27 15:29:58,805 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:29:58,805 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:29:58,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-27 15:29:58,805 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:29:58,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:29:58,806 INFO L85 PathProgramCache]: Analyzing trace with hash 949148907, now seen corresponding path program 1 times [2022-04-27 15:29:58,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:29:58,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654275676] [2022-04-27 15:29:58,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:29:58,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:29:58,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:29:58,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:29:58,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:29:58,912 INFO L290 TraceCheckUtils]: 0: Hoare triple {44800#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {44793#true} is VALID [2022-04-27 15:29:58,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {44793#true} assume true; {44793#true} is VALID [2022-04-27 15:29:58,912 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {44793#true} {44793#true} #689#return; {44793#true} is VALID [2022-04-27 15:29:58,913 INFO L272 TraceCheckUtils]: 0: Hoare triple {44793#true} call ULTIMATE.init(); {44800#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:29:58,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {44800#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {44793#true} is VALID [2022-04-27 15:29:58,913 INFO L290 TraceCheckUtils]: 2: Hoare triple {44793#true} assume true; {44793#true} is VALID [2022-04-27 15:29:58,913 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44793#true} {44793#true} #689#return; {44793#true} is VALID [2022-04-27 15:29:58,913 INFO L272 TraceCheckUtils]: 4: Hoare triple {44793#true} call #t~ret161 := main(); {44793#true} is VALID [2022-04-27 15:29:58,913 INFO L290 TraceCheckUtils]: 5: Hoare triple {44793#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; {44793#true} is VALID [2022-04-27 15:29:58,913 INFO L290 TraceCheckUtils]: 6: Hoare triple {44793#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {44793#true} is VALID [2022-04-27 15:29:58,913 INFO L272 TraceCheckUtils]: 7: Hoare triple {44793#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {44793#true} is VALID [2022-04-27 15:29:58,913 INFO L290 TraceCheckUtils]: 8: Hoare triple {44793#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); {44793#true} is VALID [2022-04-27 15:29:58,913 INFO L290 TraceCheckUtils]: 9: Hoare triple {44793#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; {44793#true} is VALID [2022-04-27 15:29:58,913 INFO L290 TraceCheckUtils]: 10: Hoare triple {44793#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; {44793#true} is VALID [2022-04-27 15:29:58,913 INFO L290 TraceCheckUtils]: 11: Hoare triple {44793#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {44793#true} is VALID [2022-04-27 15:29:58,913 INFO L290 TraceCheckUtils]: 12: Hoare triple {44793#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {44793#true} is VALID [2022-04-27 15:29:58,913 INFO L290 TraceCheckUtils]: 13: Hoare triple {44793#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {44793#true} is VALID [2022-04-27 15:29:58,913 INFO L290 TraceCheckUtils]: 14: Hoare triple {44793#true} assume !false; {44793#true} is VALID [2022-04-27 15:29:58,913 INFO L290 TraceCheckUtils]: 15: Hoare triple {44793#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); {44793#true} is VALID [2022-04-27 15:29:58,914 INFO L290 TraceCheckUtils]: 16: Hoare triple {44793#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {44793#true} is VALID [2022-04-27 15:29:58,914 INFO L290 TraceCheckUtils]: 17: Hoare triple {44793#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {44793#true} is VALID [2022-04-27 15:29:58,914 INFO L290 TraceCheckUtils]: 18: Hoare triple {44793#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {44793#true} is VALID [2022-04-27 15:29:58,914 INFO L290 TraceCheckUtils]: 19: Hoare triple {44793#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {44793#true} is VALID [2022-04-27 15:29:58,914 INFO L290 TraceCheckUtils]: 20: Hoare triple {44793#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {44793#true} is VALID [2022-04-27 15:29:58,914 INFO L290 TraceCheckUtils]: 21: Hoare triple {44793#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {44793#true} is VALID [2022-04-27 15:29:58,914 INFO L290 TraceCheckUtils]: 22: Hoare triple {44793#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {44793#true} is VALID [2022-04-27 15:29:58,914 INFO L290 TraceCheckUtils]: 23: Hoare triple {44793#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {44793#true} is VALID [2022-04-27 15:29:58,914 INFO L290 TraceCheckUtils]: 24: Hoare triple {44793#true} assume 8464 == #t~mem55;havoc #t~mem55; {44793#true} is VALID [2022-04-27 15:29:58,914 INFO L290 TraceCheckUtils]: 25: Hoare triple {44793#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; {44793#true} is VALID [2022-04-27 15:29:58,914 INFO L290 TraceCheckUtils]: 26: Hoare triple {44793#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {44793#true} is VALID [2022-04-27 15:29:58,914 INFO L290 TraceCheckUtils]: 27: Hoare triple {44793#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); {44793#true} is VALID [2022-04-27 15:29:58,914 INFO L290 TraceCheckUtils]: 28: Hoare triple {44793#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); {44793#true} is VALID [2022-04-27 15:29:58,914 INFO L290 TraceCheckUtils]: 29: Hoare triple {44793#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {44793#true} is VALID [2022-04-27 15:29:58,914 INFO L290 TraceCheckUtils]: 30: Hoare triple {44793#true} ~skip~0 := 0; {44793#true} is VALID [2022-04-27 15:29:58,914 INFO L290 TraceCheckUtils]: 31: Hoare triple {44793#true} assume !false; {44793#true} is VALID [2022-04-27 15:29:58,915 INFO L290 TraceCheckUtils]: 32: Hoare triple {44793#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); {44793#true} is VALID [2022-04-27 15:29:58,915 INFO L290 TraceCheckUtils]: 33: Hoare triple {44793#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {44793#true} is VALID [2022-04-27 15:29:58,915 INFO L290 TraceCheckUtils]: 34: Hoare triple {44793#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {44793#true} is VALID [2022-04-27 15:29:58,915 INFO L290 TraceCheckUtils]: 35: Hoare triple {44793#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {44793#true} is VALID [2022-04-27 15:29:58,915 INFO L290 TraceCheckUtils]: 36: Hoare triple {44793#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {44793#true} is VALID [2022-04-27 15:29:58,915 INFO L290 TraceCheckUtils]: 37: Hoare triple {44793#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {44793#true} is VALID [2022-04-27 15:29:58,915 INFO L290 TraceCheckUtils]: 38: Hoare triple {44793#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {44793#true} is VALID [2022-04-27 15:29:58,915 INFO L290 TraceCheckUtils]: 39: Hoare triple {44793#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {44793#true} is VALID [2022-04-27 15:29:58,915 INFO L290 TraceCheckUtils]: 40: Hoare triple {44793#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {44793#true} is VALID [2022-04-27 15:29:58,915 INFO L290 TraceCheckUtils]: 41: Hoare triple {44793#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {44793#true} is VALID [2022-04-27 15:29:58,915 INFO L290 TraceCheckUtils]: 42: Hoare triple {44793#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {44793#true} is VALID [2022-04-27 15:29:58,915 INFO L290 TraceCheckUtils]: 43: Hoare triple {44793#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {44793#true} is VALID [2022-04-27 15:29:58,915 INFO L290 TraceCheckUtils]: 44: Hoare triple {44793#true} assume 8496 == #t~mem58;havoc #t~mem58; {44793#true} is VALID [2022-04-27 15:29:58,915 INFO L290 TraceCheckUtils]: 45: Hoare triple {44793#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {44793#true} is VALID [2022-04-27 15:29:58,915 INFO L290 TraceCheckUtils]: 46: Hoare triple {44793#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {44793#true} is VALID [2022-04-27 15:29:58,915 INFO L290 TraceCheckUtils]: 47: Hoare triple {44793#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {44793#true} is VALID [2022-04-27 15:29:58,916 INFO L290 TraceCheckUtils]: 48: Hoare triple {44793#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {44798#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:58,916 INFO L290 TraceCheckUtils]: 49: Hoare triple {44798#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {44798#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:58,917 INFO L290 TraceCheckUtils]: 50: Hoare triple {44798#(= 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); {44798#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:58,917 INFO L290 TraceCheckUtils]: 51: Hoare triple {44798#(= 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; {44798#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:58,917 INFO L290 TraceCheckUtils]: 52: Hoare triple {44798#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {44798#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:58,918 INFO L290 TraceCheckUtils]: 53: Hoare triple {44798#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {44798#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:58,918 INFO L290 TraceCheckUtils]: 54: Hoare triple {44798#(= 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); {44798#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:58,918 INFO L290 TraceCheckUtils]: 55: Hoare triple {44798#(= 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); {44798#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:29:58,919 INFO L290 TraceCheckUtils]: 56: Hoare triple {44798#(= 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); {44799#(= |ssl3_accept_#t~mem49| 8656)} is VALID [2022-04-27 15:29:58,919 INFO L290 TraceCheckUtils]: 57: Hoare triple {44799#(= |ssl3_accept_#t~mem49| 8656)} assume 8192 == #t~mem49;havoc #t~mem49; {44794#false} is VALID [2022-04-27 15:29:58,919 INFO L290 TraceCheckUtils]: 58: Hoare triple {44794#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {44794#false} is VALID [2022-04-27 15:29:58,919 INFO L290 TraceCheckUtils]: 59: Hoare triple {44794#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {44794#false} is VALID [2022-04-27 15:29:58,919 INFO L290 TraceCheckUtils]: 60: Hoare triple {44794#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {44794#false} is VALID [2022-04-27 15:29:58,919 INFO L290 TraceCheckUtils]: 61: Hoare triple {44794#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); {44794#false} is VALID [2022-04-27 15:29:58,919 INFO L290 TraceCheckUtils]: 62: Hoare triple {44794#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {44794#false} is VALID [2022-04-27 15:29:58,919 INFO L290 TraceCheckUtils]: 63: Hoare triple {44794#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); {44794#false} is VALID [2022-04-27 15:29:58,919 INFO L290 TraceCheckUtils]: 64: Hoare triple {44794#false} assume 12292 != #t~mem85;havoc #t~mem85; {44794#false} is VALID [2022-04-27 15:29:58,919 INFO L290 TraceCheckUtils]: 65: Hoare triple {44794#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; {44794#false} is VALID [2022-04-27 15:29:58,919 INFO L290 TraceCheckUtils]: 66: Hoare triple {44794#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); {44794#false} is VALID [2022-04-27 15:29:58,920 INFO L290 TraceCheckUtils]: 67: Hoare triple {44794#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {44794#false} is VALID [2022-04-27 15:29:58,920 INFO L290 TraceCheckUtils]: 68: Hoare triple {44794#false} ~skip~0 := 0; {44794#false} is VALID [2022-04-27 15:29:58,920 INFO L290 TraceCheckUtils]: 69: Hoare triple {44794#false} assume !false; {44794#false} is VALID [2022-04-27 15:29:58,920 INFO L290 TraceCheckUtils]: 70: Hoare triple {44794#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); {44794#false} is VALID [2022-04-27 15:29:58,920 INFO L290 TraceCheckUtils]: 71: Hoare triple {44794#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {44794#false} is VALID [2022-04-27 15:29:58,920 INFO L290 TraceCheckUtils]: 72: Hoare triple {44794#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {44794#false} is VALID [2022-04-27 15:29:58,920 INFO L290 TraceCheckUtils]: 73: Hoare triple {44794#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {44794#false} is VALID [2022-04-27 15:29:58,920 INFO L290 TraceCheckUtils]: 74: Hoare triple {44794#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {44794#false} is VALID [2022-04-27 15:29:58,920 INFO L290 TraceCheckUtils]: 75: Hoare triple {44794#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {44794#false} is VALID [2022-04-27 15:29:58,920 INFO L290 TraceCheckUtils]: 76: Hoare triple {44794#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {44794#false} is VALID [2022-04-27 15:29:58,920 INFO L290 TraceCheckUtils]: 77: Hoare triple {44794#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {44794#false} is VALID [2022-04-27 15:29:58,920 INFO L290 TraceCheckUtils]: 78: Hoare triple {44794#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {44794#false} is VALID [2022-04-27 15:29:58,920 INFO L290 TraceCheckUtils]: 79: Hoare triple {44794#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {44794#false} is VALID [2022-04-27 15:29:58,920 INFO L290 TraceCheckUtils]: 80: Hoare triple {44794#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {44794#false} is VALID [2022-04-27 15:29:58,920 INFO L290 TraceCheckUtils]: 81: Hoare triple {44794#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {44794#false} is VALID [2022-04-27 15:29:58,920 INFO L290 TraceCheckUtils]: 82: Hoare triple {44794#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {44794#false} is VALID [2022-04-27 15:29:58,920 INFO L290 TraceCheckUtils]: 83: Hoare triple {44794#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {44794#false} is VALID [2022-04-27 15:29:58,921 INFO L290 TraceCheckUtils]: 84: Hoare triple {44794#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {44794#false} is VALID [2022-04-27 15:29:58,921 INFO L290 TraceCheckUtils]: 85: Hoare triple {44794#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {44794#false} is VALID [2022-04-27 15:29:58,921 INFO L290 TraceCheckUtils]: 86: Hoare triple {44794#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {44794#false} is VALID [2022-04-27 15:29:58,921 INFO L290 TraceCheckUtils]: 87: Hoare triple {44794#false} assume 8529 == #t~mem63;havoc #t~mem63; {44794#false} is VALID [2022-04-27 15:29:58,921 INFO L290 TraceCheckUtils]: 88: Hoare triple {44794#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); {44794#false} is VALID [2022-04-27 15:29:58,921 INFO L290 TraceCheckUtils]: 89: Hoare triple {44794#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; {44794#false} is VALID [2022-04-27 15:29:58,921 INFO L290 TraceCheckUtils]: 90: Hoare triple {44794#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); {44794#false} is VALID [2022-04-27 15:29:58,921 INFO L290 TraceCheckUtils]: 91: Hoare triple {44794#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {44794#false} is VALID [2022-04-27 15:29:58,921 INFO L290 TraceCheckUtils]: 92: Hoare triple {44794#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {44794#false} is VALID [2022-04-27 15:29:58,921 INFO L290 TraceCheckUtils]: 93: Hoare triple {44794#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {44794#false} is VALID [2022-04-27 15:29:58,921 INFO L290 TraceCheckUtils]: 94: Hoare triple {44794#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {44794#false} is VALID [2022-04-27 15:29:58,921 INFO L290 TraceCheckUtils]: 95: Hoare triple {44794#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); {44794#false} is VALID [2022-04-27 15:29:58,921 INFO L290 TraceCheckUtils]: 96: Hoare triple {44794#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {44794#false} is VALID [2022-04-27 15:29:58,921 INFO L290 TraceCheckUtils]: 97: Hoare triple {44794#false} ~skip~0 := 0; {44794#false} is VALID [2022-04-27 15:29:58,921 INFO L290 TraceCheckUtils]: 98: Hoare triple {44794#false} assume !false; {44794#false} is VALID [2022-04-27 15:29:58,921 INFO L290 TraceCheckUtils]: 99: Hoare triple {44794#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); {44794#false} is VALID [2022-04-27 15:29:58,921 INFO L290 TraceCheckUtils]: 100: Hoare triple {44794#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {44794#false} is VALID [2022-04-27 15:29:58,922 INFO L290 TraceCheckUtils]: 101: Hoare triple {44794#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {44794#false} is VALID [2022-04-27 15:29:58,922 INFO L290 TraceCheckUtils]: 102: Hoare triple {44794#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {44794#false} is VALID [2022-04-27 15:29:58,922 INFO L290 TraceCheckUtils]: 103: Hoare triple {44794#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {44794#false} is VALID [2022-04-27 15:29:58,922 INFO L290 TraceCheckUtils]: 104: Hoare triple {44794#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {44794#false} is VALID [2022-04-27 15:29:58,922 INFO L290 TraceCheckUtils]: 105: Hoare triple {44794#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {44794#false} is VALID [2022-04-27 15:29:58,922 INFO L290 TraceCheckUtils]: 106: Hoare triple {44794#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {44794#false} is VALID [2022-04-27 15:29:58,922 INFO L290 TraceCheckUtils]: 107: Hoare triple {44794#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {44794#false} is VALID [2022-04-27 15:29:58,922 INFO L290 TraceCheckUtils]: 108: Hoare triple {44794#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {44794#false} is VALID [2022-04-27 15:29:58,922 INFO L290 TraceCheckUtils]: 109: Hoare triple {44794#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {44794#false} is VALID [2022-04-27 15:29:58,922 INFO L290 TraceCheckUtils]: 110: Hoare triple {44794#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {44794#false} is VALID [2022-04-27 15:29:58,922 INFO L290 TraceCheckUtils]: 111: Hoare triple {44794#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {44794#false} is VALID [2022-04-27 15:29:58,922 INFO L290 TraceCheckUtils]: 112: Hoare triple {44794#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {44794#false} is VALID [2022-04-27 15:29:58,922 INFO L290 TraceCheckUtils]: 113: Hoare triple {44794#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {44794#false} is VALID [2022-04-27 15:29:58,922 INFO L290 TraceCheckUtils]: 114: Hoare triple {44794#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {44794#false} is VALID [2022-04-27 15:29:58,922 INFO L290 TraceCheckUtils]: 115: Hoare triple {44794#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {44794#false} is VALID [2022-04-27 15:29:58,922 INFO L290 TraceCheckUtils]: 116: Hoare triple {44794#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {44794#false} is VALID [2022-04-27 15:29:58,922 INFO L290 TraceCheckUtils]: 117: Hoare triple {44794#false} assume 8544 == #t~mem64;havoc #t~mem64; {44794#false} is VALID [2022-04-27 15:29:58,922 INFO L290 TraceCheckUtils]: 118: Hoare triple {44794#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {44794#false} is VALID [2022-04-27 15:29:58,923 INFO L290 TraceCheckUtils]: 119: Hoare triple {44794#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); {44794#false} is VALID [2022-04-27 15:29:58,923 INFO L290 TraceCheckUtils]: 120: Hoare triple {44794#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {44794#false} is VALID [2022-04-27 15:29:58,923 INFO L290 TraceCheckUtils]: 121: Hoare triple {44794#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); {44794#false} is VALID [2022-04-27 15:29:58,923 INFO L290 TraceCheckUtils]: 122: Hoare triple {44794#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; {44794#false} is VALID [2022-04-27 15:29:58,923 INFO L290 TraceCheckUtils]: 123: Hoare triple {44794#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; {44794#false} is VALID [2022-04-27 15:29:58,923 INFO L290 TraceCheckUtils]: 124: Hoare triple {44794#false} assume 8 == ~blastFlag~0; {44794#false} is VALID [2022-04-27 15:29:58,923 INFO L290 TraceCheckUtils]: 125: Hoare triple {44794#false} assume !false; {44794#false} is VALID [2022-04-27 15:29:58,923 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-04-27 15:29:58,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:29:58,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654275676] [2022-04-27 15:29:58,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654275676] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:29:58,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:29:58,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:29:58,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125020523] [2022-04-27 15:29:58,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:29:58,924 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 126 [2022-04-27 15:29:58,924 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:29:58,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:29:58,997 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:29:58,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:29:58,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:29:58,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:29:58,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:29:58,998 INFO L87 Difference]: Start difference. First operand 420 states and 635 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:03,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:30:03,891 INFO L93 Difference]: Finished difference Result 860 states and 1303 transitions. [2022-04-27 15:30:03,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:30:03,891 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 126 [2022-04-27 15:30:03,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:30:03,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:03,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 524 transitions. [2022-04-27 15:30:03,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:03,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 524 transitions. [2022-04-27 15:30:03,895 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 524 transitions. [2022-04-27 15:30:04,236 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 524 edges. 524 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:30:04,244 INFO L225 Difference]: With dead ends: 860 [2022-04-27 15:30:04,244 INFO L226 Difference]: Without dead ends: 466 [2022-04-27 15:30:04,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:30:04,245 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 85 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-27 15:30:04,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 525 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-27 15:30:04,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2022-04-27 15:30:04,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 420. [2022-04-27 15:30:04,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:30:04,251 INFO L82 GeneralOperation]: Start isEquivalent. First operand 466 states. Second operand has 420 states, 415 states have (on average 1.5180722891566265) internal successors, (630), 415 states have internal predecessors, (630), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:04,251 INFO L74 IsIncluded]: Start isIncluded. First operand 466 states. Second operand has 420 states, 415 states have (on average 1.5180722891566265) internal successors, (630), 415 states have internal predecessors, (630), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:04,252 INFO L87 Difference]: Start difference. First operand 466 states. Second operand has 420 states, 415 states have (on average 1.5180722891566265) internal successors, (630), 415 states have internal predecessors, (630), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:04,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:30:04,258 INFO L93 Difference]: Finished difference Result 466 states and 697 transitions. [2022-04-27 15:30:04,259 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 697 transitions. [2022-04-27 15:30:04,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:30:04,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:30:04,259 INFO L74 IsIncluded]: Start isIncluded. First operand has 420 states, 415 states have (on average 1.5180722891566265) internal successors, (630), 415 states have internal predecessors, (630), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 466 states. [2022-04-27 15:30:04,260 INFO L87 Difference]: Start difference. First operand has 420 states, 415 states have (on average 1.5180722891566265) internal successors, (630), 415 states have internal predecessors, (630), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 466 states. [2022-04-27 15:30:04,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:30:04,267 INFO L93 Difference]: Finished difference Result 466 states and 697 transitions. [2022-04-27 15:30:04,267 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 697 transitions. [2022-04-27 15:30:04,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:30:04,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:30:04,267 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:30:04,267 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:30:04,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 415 states have (on average 1.5180722891566265) internal successors, (630), 415 states have internal predecessors, (630), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:04,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 634 transitions. [2022-04-27 15:30:04,274 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 634 transitions. Word has length 126 [2022-04-27 15:30:04,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:30:04,274 INFO L495 AbstractCegarLoop]: Abstraction has 420 states and 634 transitions. [2022-04-27 15:30:04,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:04,274 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 634 transitions. [2022-04-27 15:30:04,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-04-27 15:30:04,275 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:30:04,275 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:30:04,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-27 15:30:04,275 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:30:04,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:30:04,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1788182569, now seen corresponding path program 1 times [2022-04-27 15:30:04,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:30:04,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062638836] [2022-04-27 15:30:04,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:30:04,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:30:04,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:30:04,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:30:04,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:30:04,376 INFO L290 TraceCheckUtils]: 0: Hoare triple {47170#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {47163#true} is VALID [2022-04-27 15:30:04,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {47163#true} assume true; {47163#true} is VALID [2022-04-27 15:30:04,376 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {47163#true} {47163#true} #689#return; {47163#true} is VALID [2022-04-27 15:30:04,376 INFO L272 TraceCheckUtils]: 0: Hoare triple {47163#true} call ULTIMATE.init(); {47170#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:30:04,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {47170#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {47163#true} is VALID [2022-04-27 15:30:04,377 INFO L290 TraceCheckUtils]: 2: Hoare triple {47163#true} assume true; {47163#true} is VALID [2022-04-27 15:30:04,377 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47163#true} {47163#true} #689#return; {47163#true} is VALID [2022-04-27 15:30:04,377 INFO L272 TraceCheckUtils]: 4: Hoare triple {47163#true} call #t~ret161 := main(); {47163#true} is VALID [2022-04-27 15:30:04,377 INFO L290 TraceCheckUtils]: 5: Hoare triple {47163#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; {47163#true} is VALID [2022-04-27 15:30:04,377 INFO L290 TraceCheckUtils]: 6: Hoare triple {47163#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {47163#true} is VALID [2022-04-27 15:30:04,377 INFO L272 TraceCheckUtils]: 7: Hoare triple {47163#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {47163#true} is VALID [2022-04-27 15:30:04,377 INFO L290 TraceCheckUtils]: 8: Hoare triple {47163#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); {47163#true} is VALID [2022-04-27 15:30:04,377 INFO L290 TraceCheckUtils]: 9: Hoare triple {47163#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; {47163#true} is VALID [2022-04-27 15:30:04,377 INFO L290 TraceCheckUtils]: 10: Hoare triple {47163#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; {47163#true} is VALID [2022-04-27 15:30:04,377 INFO L290 TraceCheckUtils]: 11: Hoare triple {47163#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {47163#true} is VALID [2022-04-27 15:30:04,377 INFO L290 TraceCheckUtils]: 12: Hoare triple {47163#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {47163#true} is VALID [2022-04-27 15:30:04,377 INFO L290 TraceCheckUtils]: 13: Hoare triple {47163#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {47163#true} is VALID [2022-04-27 15:30:04,377 INFO L290 TraceCheckUtils]: 14: Hoare triple {47163#true} assume !false; {47163#true} is VALID [2022-04-27 15:30:04,377 INFO L290 TraceCheckUtils]: 15: Hoare triple {47163#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); {47163#true} is VALID [2022-04-27 15:30:04,378 INFO L290 TraceCheckUtils]: 16: Hoare triple {47163#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {47163#true} is VALID [2022-04-27 15:30:04,378 INFO L290 TraceCheckUtils]: 17: Hoare triple {47163#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {47163#true} is VALID [2022-04-27 15:30:04,378 INFO L290 TraceCheckUtils]: 18: Hoare triple {47163#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {47163#true} is VALID [2022-04-27 15:30:04,378 INFO L290 TraceCheckUtils]: 19: Hoare triple {47163#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {47163#true} is VALID [2022-04-27 15:30:04,378 INFO L290 TraceCheckUtils]: 20: Hoare triple {47163#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {47163#true} is VALID [2022-04-27 15:30:04,378 INFO L290 TraceCheckUtils]: 21: Hoare triple {47163#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {47163#true} is VALID [2022-04-27 15:30:04,378 INFO L290 TraceCheckUtils]: 22: Hoare triple {47163#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {47163#true} is VALID [2022-04-27 15:30:04,378 INFO L290 TraceCheckUtils]: 23: Hoare triple {47163#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {47163#true} is VALID [2022-04-27 15:30:04,378 INFO L290 TraceCheckUtils]: 24: Hoare triple {47163#true} assume 8464 == #t~mem55;havoc #t~mem55; {47163#true} is VALID [2022-04-27 15:30:04,378 INFO L290 TraceCheckUtils]: 25: Hoare triple {47163#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; {47163#true} is VALID [2022-04-27 15:30:04,378 INFO L290 TraceCheckUtils]: 26: Hoare triple {47163#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {47163#true} is VALID [2022-04-27 15:30:04,378 INFO L290 TraceCheckUtils]: 27: Hoare triple {47163#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); {47163#true} is VALID [2022-04-27 15:30:04,378 INFO L290 TraceCheckUtils]: 28: Hoare triple {47163#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); {47163#true} is VALID [2022-04-27 15:30:04,378 INFO L290 TraceCheckUtils]: 29: Hoare triple {47163#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {47163#true} is VALID [2022-04-27 15:30:04,378 INFO L290 TraceCheckUtils]: 30: Hoare triple {47163#true} ~skip~0 := 0; {47163#true} is VALID [2022-04-27 15:30:04,378 INFO L290 TraceCheckUtils]: 31: Hoare triple {47163#true} assume !false; {47163#true} is VALID [2022-04-27 15:30:04,378 INFO L290 TraceCheckUtils]: 32: Hoare triple {47163#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); {47163#true} is VALID [2022-04-27 15:30:04,379 INFO L290 TraceCheckUtils]: 33: Hoare triple {47163#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {47163#true} is VALID [2022-04-27 15:30:04,379 INFO L290 TraceCheckUtils]: 34: Hoare triple {47163#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {47163#true} is VALID [2022-04-27 15:30:04,379 INFO L290 TraceCheckUtils]: 35: Hoare triple {47163#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {47163#true} is VALID [2022-04-27 15:30:04,379 INFO L290 TraceCheckUtils]: 36: Hoare triple {47163#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {47163#true} is VALID [2022-04-27 15:30:04,379 INFO L290 TraceCheckUtils]: 37: Hoare triple {47163#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {47163#true} is VALID [2022-04-27 15:30:04,379 INFO L290 TraceCheckUtils]: 38: Hoare triple {47163#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {47163#true} is VALID [2022-04-27 15:30:04,379 INFO L290 TraceCheckUtils]: 39: Hoare triple {47163#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {47163#true} is VALID [2022-04-27 15:30:04,379 INFO L290 TraceCheckUtils]: 40: Hoare triple {47163#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {47163#true} is VALID [2022-04-27 15:30:04,379 INFO L290 TraceCheckUtils]: 41: Hoare triple {47163#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {47163#true} is VALID [2022-04-27 15:30:04,379 INFO L290 TraceCheckUtils]: 42: Hoare triple {47163#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {47163#true} is VALID [2022-04-27 15:30:04,379 INFO L290 TraceCheckUtils]: 43: Hoare triple {47163#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {47163#true} is VALID [2022-04-27 15:30:04,379 INFO L290 TraceCheckUtils]: 44: Hoare triple {47163#true} assume 8496 == #t~mem58;havoc #t~mem58; {47163#true} is VALID [2022-04-27 15:30:04,379 INFO L290 TraceCheckUtils]: 45: Hoare triple {47163#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {47163#true} is VALID [2022-04-27 15:30:04,379 INFO L290 TraceCheckUtils]: 46: Hoare triple {47163#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {47163#true} is VALID [2022-04-27 15:30:04,379 INFO L290 TraceCheckUtils]: 47: Hoare triple {47163#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {47163#true} is VALID [2022-04-27 15:30:04,380 INFO L290 TraceCheckUtils]: 48: Hoare triple {47163#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {47168#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:30:04,381 INFO L290 TraceCheckUtils]: 49: Hoare triple {47168#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {47168#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:30:04,381 INFO L290 TraceCheckUtils]: 50: Hoare triple {47168#(= (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); {47168#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:30:04,381 INFO L290 TraceCheckUtils]: 51: Hoare triple {47168#(= (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; {47168#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:30:04,382 INFO L290 TraceCheckUtils]: 52: Hoare triple {47168#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} ~skip~0 := 0; {47168#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:30:04,382 INFO L290 TraceCheckUtils]: 53: Hoare triple {47168#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !false; {47168#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:30:04,382 INFO L290 TraceCheckUtils]: 54: Hoare triple {47168#(= (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); {47168#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:30:04,383 INFO L290 TraceCheckUtils]: 55: Hoare triple {47168#(= (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); {47168#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:30:04,383 INFO L290 TraceCheckUtils]: 56: Hoare triple {47168#(= (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); {47169#(= |ssl3_accept_#t~mem49| 8512)} is VALID [2022-04-27 15:30:04,383 INFO L290 TraceCheckUtils]: 57: Hoare triple {47169#(= |ssl3_accept_#t~mem49| 8512)} assume 8192 == #t~mem49;havoc #t~mem49; {47164#false} is VALID [2022-04-27 15:30:04,383 INFO L290 TraceCheckUtils]: 58: Hoare triple {47164#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {47164#false} is VALID [2022-04-27 15:30:04,383 INFO L290 TraceCheckUtils]: 59: Hoare triple {47164#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {47164#false} is VALID [2022-04-27 15:30:04,383 INFO L290 TraceCheckUtils]: 60: Hoare triple {47164#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {47164#false} is VALID [2022-04-27 15:30:04,383 INFO L290 TraceCheckUtils]: 61: Hoare triple {47164#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); {47164#false} is VALID [2022-04-27 15:30:04,383 INFO L290 TraceCheckUtils]: 62: Hoare triple {47164#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {47164#false} is VALID [2022-04-27 15:30:04,384 INFO L290 TraceCheckUtils]: 63: Hoare triple {47164#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); {47164#false} is VALID [2022-04-27 15:30:04,384 INFO L290 TraceCheckUtils]: 64: Hoare triple {47164#false} assume 12292 != #t~mem85;havoc #t~mem85; {47164#false} is VALID [2022-04-27 15:30:04,384 INFO L290 TraceCheckUtils]: 65: Hoare triple {47164#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; {47164#false} is VALID [2022-04-27 15:30:04,384 INFO L290 TraceCheckUtils]: 66: Hoare triple {47164#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); {47164#false} is VALID [2022-04-27 15:30:04,384 INFO L290 TraceCheckUtils]: 67: Hoare triple {47164#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {47164#false} is VALID [2022-04-27 15:30:04,384 INFO L290 TraceCheckUtils]: 68: Hoare triple {47164#false} ~skip~0 := 0; {47164#false} is VALID [2022-04-27 15:30:04,384 INFO L290 TraceCheckUtils]: 69: Hoare triple {47164#false} assume !false; {47164#false} is VALID [2022-04-27 15:30:04,384 INFO L290 TraceCheckUtils]: 70: Hoare triple {47164#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); {47164#false} is VALID [2022-04-27 15:30:04,384 INFO L290 TraceCheckUtils]: 71: Hoare triple {47164#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {47164#false} is VALID [2022-04-27 15:30:04,384 INFO L290 TraceCheckUtils]: 72: Hoare triple {47164#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {47164#false} is VALID [2022-04-27 15:30:04,384 INFO L290 TraceCheckUtils]: 73: Hoare triple {47164#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {47164#false} is VALID [2022-04-27 15:30:04,384 INFO L290 TraceCheckUtils]: 74: Hoare triple {47164#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {47164#false} is VALID [2022-04-27 15:30:04,384 INFO L290 TraceCheckUtils]: 75: Hoare triple {47164#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {47164#false} is VALID [2022-04-27 15:30:04,384 INFO L290 TraceCheckUtils]: 76: Hoare triple {47164#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {47164#false} is VALID [2022-04-27 15:30:04,384 INFO L290 TraceCheckUtils]: 77: Hoare triple {47164#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {47164#false} is VALID [2022-04-27 15:30:04,384 INFO L290 TraceCheckUtils]: 78: Hoare triple {47164#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {47164#false} is VALID [2022-04-27 15:30:04,384 INFO L290 TraceCheckUtils]: 79: Hoare triple {47164#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {47164#false} is VALID [2022-04-27 15:30:04,385 INFO L290 TraceCheckUtils]: 80: Hoare triple {47164#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {47164#false} is VALID [2022-04-27 15:30:04,385 INFO L290 TraceCheckUtils]: 81: Hoare triple {47164#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {47164#false} is VALID [2022-04-27 15:30:04,385 INFO L290 TraceCheckUtils]: 82: Hoare triple {47164#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {47164#false} is VALID [2022-04-27 15:30:04,385 INFO L290 TraceCheckUtils]: 83: Hoare triple {47164#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {47164#false} is VALID [2022-04-27 15:30:04,385 INFO L290 TraceCheckUtils]: 84: Hoare triple {47164#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {47164#false} is VALID [2022-04-27 15:30:04,385 INFO L290 TraceCheckUtils]: 85: Hoare triple {47164#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {47164#false} is VALID [2022-04-27 15:30:04,385 INFO L290 TraceCheckUtils]: 86: Hoare triple {47164#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {47164#false} is VALID [2022-04-27 15:30:04,385 INFO L290 TraceCheckUtils]: 87: Hoare triple {47164#false} assume 8529 == #t~mem63;havoc #t~mem63; {47164#false} is VALID [2022-04-27 15:30:04,385 INFO L290 TraceCheckUtils]: 88: Hoare triple {47164#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); {47164#false} is VALID [2022-04-27 15:30:04,385 INFO L290 TraceCheckUtils]: 89: Hoare triple {47164#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; {47164#false} is VALID [2022-04-27 15:30:04,385 INFO L290 TraceCheckUtils]: 90: Hoare triple {47164#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); {47164#false} is VALID [2022-04-27 15:30:04,385 INFO L290 TraceCheckUtils]: 91: Hoare triple {47164#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {47164#false} is VALID [2022-04-27 15:30:04,385 INFO L290 TraceCheckUtils]: 92: Hoare triple {47164#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {47164#false} is VALID [2022-04-27 15:30:04,385 INFO L290 TraceCheckUtils]: 93: Hoare triple {47164#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {47164#false} is VALID [2022-04-27 15:30:04,385 INFO L290 TraceCheckUtils]: 94: Hoare triple {47164#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {47164#false} is VALID [2022-04-27 15:30:04,385 INFO L290 TraceCheckUtils]: 95: Hoare triple {47164#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); {47164#false} is VALID [2022-04-27 15:30:04,385 INFO L290 TraceCheckUtils]: 96: Hoare triple {47164#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {47164#false} is VALID [2022-04-27 15:30:04,386 INFO L290 TraceCheckUtils]: 97: Hoare triple {47164#false} ~skip~0 := 0; {47164#false} is VALID [2022-04-27 15:30:04,386 INFO L290 TraceCheckUtils]: 98: Hoare triple {47164#false} assume !false; {47164#false} is VALID [2022-04-27 15:30:04,386 INFO L290 TraceCheckUtils]: 99: Hoare triple {47164#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); {47164#false} is VALID [2022-04-27 15:30:04,386 INFO L290 TraceCheckUtils]: 100: Hoare triple {47164#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {47164#false} is VALID [2022-04-27 15:30:04,386 INFO L290 TraceCheckUtils]: 101: Hoare triple {47164#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {47164#false} is VALID [2022-04-27 15:30:04,386 INFO L290 TraceCheckUtils]: 102: Hoare triple {47164#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {47164#false} is VALID [2022-04-27 15:30:04,386 INFO L290 TraceCheckUtils]: 103: Hoare triple {47164#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {47164#false} is VALID [2022-04-27 15:30:04,386 INFO L290 TraceCheckUtils]: 104: Hoare triple {47164#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {47164#false} is VALID [2022-04-27 15:30:04,386 INFO L290 TraceCheckUtils]: 105: Hoare triple {47164#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {47164#false} is VALID [2022-04-27 15:30:04,386 INFO L290 TraceCheckUtils]: 106: Hoare triple {47164#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {47164#false} is VALID [2022-04-27 15:30:04,386 INFO L290 TraceCheckUtils]: 107: Hoare triple {47164#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {47164#false} is VALID [2022-04-27 15:30:04,386 INFO L290 TraceCheckUtils]: 108: Hoare triple {47164#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {47164#false} is VALID [2022-04-27 15:30:04,386 INFO L290 TraceCheckUtils]: 109: Hoare triple {47164#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {47164#false} is VALID [2022-04-27 15:30:04,386 INFO L290 TraceCheckUtils]: 110: Hoare triple {47164#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {47164#false} is VALID [2022-04-27 15:30:04,386 INFO L290 TraceCheckUtils]: 111: Hoare triple {47164#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {47164#false} is VALID [2022-04-27 15:30:04,386 INFO L290 TraceCheckUtils]: 112: Hoare triple {47164#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {47164#false} is VALID [2022-04-27 15:30:04,386 INFO L290 TraceCheckUtils]: 113: Hoare triple {47164#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {47164#false} is VALID [2022-04-27 15:30:04,387 INFO L290 TraceCheckUtils]: 114: Hoare triple {47164#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {47164#false} is VALID [2022-04-27 15:30:04,387 INFO L290 TraceCheckUtils]: 115: Hoare triple {47164#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {47164#false} is VALID [2022-04-27 15:30:04,387 INFO L290 TraceCheckUtils]: 116: Hoare triple {47164#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {47164#false} is VALID [2022-04-27 15:30:04,387 INFO L290 TraceCheckUtils]: 117: Hoare triple {47164#false} assume 8544 == #t~mem64;havoc #t~mem64; {47164#false} is VALID [2022-04-27 15:30:04,387 INFO L290 TraceCheckUtils]: 118: Hoare triple {47164#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {47164#false} is VALID [2022-04-27 15:30:04,387 INFO L290 TraceCheckUtils]: 119: Hoare triple {47164#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); {47164#false} is VALID [2022-04-27 15:30:04,387 INFO L290 TraceCheckUtils]: 120: Hoare triple {47164#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {47164#false} is VALID [2022-04-27 15:30:04,387 INFO L290 TraceCheckUtils]: 121: Hoare triple {47164#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); {47164#false} is VALID [2022-04-27 15:30:04,387 INFO L290 TraceCheckUtils]: 122: Hoare triple {47164#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; {47164#false} is VALID [2022-04-27 15:30:04,387 INFO L290 TraceCheckUtils]: 123: Hoare triple {47164#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; {47164#false} is VALID [2022-04-27 15:30:04,387 INFO L290 TraceCheckUtils]: 124: Hoare triple {47164#false} assume 8 == ~blastFlag~0; {47164#false} is VALID [2022-04-27 15:30:04,387 INFO L290 TraceCheckUtils]: 125: Hoare triple {47164#false} assume !false; {47164#false} is VALID [2022-04-27 15:30:04,388 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-04-27 15:30:04,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:30:04,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062638836] [2022-04-27 15:30:04,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062638836] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:30:04,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:30:04,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:30:04,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634270292] [2022-04-27 15:30:04,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:30:04,388 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 126 [2022-04-27 15:30:04,389 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:30:04,389 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:04,467 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:30:04,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:30:04,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:30:04,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:30:04,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:30:04,468 INFO L87 Difference]: Start difference. First operand 420 states and 634 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:10,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:30:10,832 INFO L93 Difference]: Finished difference Result 836 states and 1268 transitions. [2022-04-27 15:30:10,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:30:10,832 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 126 [2022-04-27 15:30:10,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:30:10,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:10,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 478 transitions. [2022-04-27 15:30:10,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:10,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 478 transitions. [2022-04-27 15:30:10,836 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 478 transitions. [2022-04-27 15:30:11,059 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 478 edges. 478 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:30:11,066 INFO L225 Difference]: With dead ends: 836 [2022-04-27 15:30:11,067 INFO L226 Difference]: Without dead ends: 442 [2022-04-27 15:30:11,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:30:11,067 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 46 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s 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.6s IncrementalHoareTripleChecker+Time [2022-04-27 15:30:11,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 603 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-04-27 15:30:11,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2022-04-27 15:30:11,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 420. [2022-04-27 15:30:11,073 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:30:11,074 INFO L82 GeneralOperation]: Start isEquivalent. First operand 442 states. Second operand has 420 states, 415 states have (on average 1.5156626506024096) internal successors, (629), 415 states have internal predecessors, (629), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:11,074 INFO L74 IsIncluded]: Start isIncluded. First operand 442 states. Second operand has 420 states, 415 states have (on average 1.5156626506024096) internal successors, (629), 415 states have internal predecessors, (629), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:11,074 INFO L87 Difference]: Start difference. First operand 442 states. Second operand has 420 states, 415 states have (on average 1.5156626506024096) internal successors, (629), 415 states have internal predecessors, (629), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:11,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:30:11,081 INFO L93 Difference]: Finished difference Result 442 states and 663 transitions. [2022-04-27 15:30:11,081 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 663 transitions. [2022-04-27 15:30:11,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:30:11,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:30:11,082 INFO L74 IsIncluded]: Start isIncluded. First operand has 420 states, 415 states have (on average 1.5156626506024096) internal successors, (629), 415 states have internal predecessors, (629), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 442 states. [2022-04-27 15:30:11,082 INFO L87 Difference]: Start difference. First operand has 420 states, 415 states have (on average 1.5156626506024096) internal successors, (629), 415 states have internal predecessors, (629), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 442 states. [2022-04-27 15:30:11,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:30:11,089 INFO L93 Difference]: Finished difference Result 442 states and 663 transitions. [2022-04-27 15:30:11,089 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 663 transitions. [2022-04-27 15:30:11,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:30:11,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:30:11,089 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:30:11,089 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:30:11,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 415 states have (on average 1.5156626506024096) internal successors, (629), 415 states have internal predecessors, (629), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:11,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 633 transitions. [2022-04-27 15:30:11,096 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 633 transitions. Word has length 126 [2022-04-27 15:30:11,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:30:11,096 INFO L495 AbstractCegarLoop]: Abstraction has 420 states and 633 transitions. [2022-04-27 15:30:11,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:11,097 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 633 transitions. [2022-04-27 15:30:11,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-04-27 15:30:11,097 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:30:11,097 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:30:11,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-27 15:30:11,097 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:30:11,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:30:11,098 INFO L85 PathProgramCache]: Analyzing trace with hash 46620656, now seen corresponding path program 1 times [2022-04-27 15:30:11,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:30:11,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371897176] [2022-04-27 15:30:11,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:30:11,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:30:11,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:30:11,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:30:11,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:30:11,203 INFO L290 TraceCheckUtils]: 0: Hoare triple {49463#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {49456#true} is VALID [2022-04-27 15:30:11,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {49456#true} assume true; {49456#true} is VALID [2022-04-27 15:30:11,203 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {49456#true} {49456#true} #689#return; {49456#true} is VALID [2022-04-27 15:30:11,204 INFO L272 TraceCheckUtils]: 0: Hoare triple {49456#true} call ULTIMATE.init(); {49463#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:30:11,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {49463#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {49456#true} is VALID [2022-04-27 15:30:11,204 INFO L290 TraceCheckUtils]: 2: Hoare triple {49456#true} assume true; {49456#true} is VALID [2022-04-27 15:30:11,204 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49456#true} {49456#true} #689#return; {49456#true} is VALID [2022-04-27 15:30:11,204 INFO L272 TraceCheckUtils]: 4: Hoare triple {49456#true} call #t~ret161 := main(); {49456#true} is VALID [2022-04-27 15:30:11,204 INFO L290 TraceCheckUtils]: 5: Hoare triple {49456#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; {49456#true} is VALID [2022-04-27 15:30:11,204 INFO L290 TraceCheckUtils]: 6: Hoare triple {49456#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {49456#true} is VALID [2022-04-27 15:30:11,204 INFO L272 TraceCheckUtils]: 7: Hoare triple {49456#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {49456#true} is VALID [2022-04-27 15:30:11,204 INFO L290 TraceCheckUtils]: 8: Hoare triple {49456#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); {49456#true} is VALID [2022-04-27 15:30:11,204 INFO L290 TraceCheckUtils]: 9: Hoare triple {49456#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; {49456#true} is VALID [2022-04-27 15:30:11,204 INFO L290 TraceCheckUtils]: 10: Hoare triple {49456#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; {49456#true} is VALID [2022-04-27 15:30:11,204 INFO L290 TraceCheckUtils]: 11: Hoare triple {49456#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {49456#true} is VALID [2022-04-27 15:30:11,205 INFO L290 TraceCheckUtils]: 12: Hoare triple {49456#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {49456#true} is VALID [2022-04-27 15:30:11,205 INFO L290 TraceCheckUtils]: 13: Hoare triple {49456#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {49456#true} is VALID [2022-04-27 15:30:11,205 INFO L290 TraceCheckUtils]: 14: Hoare triple {49456#true} assume !false; {49456#true} is VALID [2022-04-27 15:30:11,205 INFO L290 TraceCheckUtils]: 15: Hoare triple {49456#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); {49456#true} is VALID [2022-04-27 15:30:11,205 INFO L290 TraceCheckUtils]: 16: Hoare triple {49456#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {49456#true} is VALID [2022-04-27 15:30:11,205 INFO L290 TraceCheckUtils]: 17: Hoare triple {49456#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {49456#true} is VALID [2022-04-27 15:30:11,205 INFO L290 TraceCheckUtils]: 18: Hoare triple {49456#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {49456#true} is VALID [2022-04-27 15:30:11,205 INFO L290 TraceCheckUtils]: 19: Hoare triple {49456#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {49456#true} is VALID [2022-04-27 15:30:11,205 INFO L290 TraceCheckUtils]: 20: Hoare triple {49456#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {49456#true} is VALID [2022-04-27 15:30:11,205 INFO L290 TraceCheckUtils]: 21: Hoare triple {49456#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {49456#true} is VALID [2022-04-27 15:30:11,205 INFO L290 TraceCheckUtils]: 22: Hoare triple {49456#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {49456#true} is VALID [2022-04-27 15:30:11,205 INFO L290 TraceCheckUtils]: 23: Hoare triple {49456#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {49456#true} is VALID [2022-04-27 15:30:11,205 INFO L290 TraceCheckUtils]: 24: Hoare triple {49456#true} assume 8464 == #t~mem55;havoc #t~mem55; {49456#true} is VALID [2022-04-27 15:30:11,205 INFO L290 TraceCheckUtils]: 25: Hoare triple {49456#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; {49456#true} is VALID [2022-04-27 15:30:11,205 INFO L290 TraceCheckUtils]: 26: Hoare triple {49456#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {49456#true} is VALID [2022-04-27 15:30:11,205 INFO L290 TraceCheckUtils]: 27: Hoare triple {49456#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); {49456#true} is VALID [2022-04-27 15:30:11,206 INFO L290 TraceCheckUtils]: 28: Hoare triple {49456#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); {49456#true} is VALID [2022-04-27 15:30:11,206 INFO L290 TraceCheckUtils]: 29: Hoare triple {49456#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {49456#true} is VALID [2022-04-27 15:30:11,206 INFO L290 TraceCheckUtils]: 30: Hoare triple {49456#true} ~skip~0 := 0; {49456#true} is VALID [2022-04-27 15:30:11,206 INFO L290 TraceCheckUtils]: 31: Hoare triple {49456#true} assume !false; {49456#true} is VALID [2022-04-27 15:30:11,206 INFO L290 TraceCheckUtils]: 32: Hoare triple {49456#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); {49456#true} is VALID [2022-04-27 15:30:11,206 INFO L290 TraceCheckUtils]: 33: Hoare triple {49456#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {49456#true} is VALID [2022-04-27 15:30:11,206 INFO L290 TraceCheckUtils]: 34: Hoare triple {49456#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {49456#true} is VALID [2022-04-27 15:30:11,206 INFO L290 TraceCheckUtils]: 35: Hoare triple {49456#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {49456#true} is VALID [2022-04-27 15:30:11,206 INFO L290 TraceCheckUtils]: 36: Hoare triple {49456#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {49456#true} is VALID [2022-04-27 15:30:11,206 INFO L290 TraceCheckUtils]: 37: Hoare triple {49456#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {49456#true} is VALID [2022-04-27 15:30:11,206 INFO L290 TraceCheckUtils]: 38: Hoare triple {49456#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {49456#true} is VALID [2022-04-27 15:30:11,206 INFO L290 TraceCheckUtils]: 39: Hoare triple {49456#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {49456#true} is VALID [2022-04-27 15:30:11,206 INFO L290 TraceCheckUtils]: 40: Hoare triple {49456#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {49456#true} is VALID [2022-04-27 15:30:11,206 INFO L290 TraceCheckUtils]: 41: Hoare triple {49456#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {49456#true} is VALID [2022-04-27 15:30:11,206 INFO L290 TraceCheckUtils]: 42: Hoare triple {49456#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {49456#true} is VALID [2022-04-27 15:30:11,206 INFO L290 TraceCheckUtils]: 43: Hoare triple {49456#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {49456#true} is VALID [2022-04-27 15:30:11,206 INFO L290 TraceCheckUtils]: 44: Hoare triple {49456#true} assume 8496 == #t~mem58;havoc #t~mem58; {49456#true} is VALID [2022-04-27 15:30:11,207 INFO L290 TraceCheckUtils]: 45: Hoare triple {49456#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {49456#true} is VALID [2022-04-27 15:30:11,207 INFO L290 TraceCheckUtils]: 46: Hoare triple {49456#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {49456#true} is VALID [2022-04-27 15:30:11,207 INFO L290 TraceCheckUtils]: 47: Hoare triple {49456#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {49456#true} is VALID [2022-04-27 15:30:11,207 INFO L290 TraceCheckUtils]: 48: Hoare triple {49456#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {49461#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:11,208 INFO L290 TraceCheckUtils]: 49: Hoare triple {49461#(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); {49461#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:11,208 INFO L290 TraceCheckUtils]: 50: Hoare triple {49461#(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); {49461#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:11,209 INFO L290 TraceCheckUtils]: 51: Hoare triple {49461#(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; {49461#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:11,209 INFO L290 TraceCheckUtils]: 52: Hoare triple {49461#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {49461#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:11,209 INFO L290 TraceCheckUtils]: 53: Hoare triple {49461#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {49461#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:11,209 INFO L290 TraceCheckUtils]: 54: Hoare triple {49461#(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); {49461#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:11,210 INFO L290 TraceCheckUtils]: 55: Hoare triple {49461#(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); {49461#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:11,210 INFO L290 TraceCheckUtils]: 56: Hoare triple {49461#(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); {49461#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:11,210 INFO L290 TraceCheckUtils]: 57: Hoare triple {49461#(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); {49461#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:11,211 INFO L290 TraceCheckUtils]: 58: Hoare triple {49461#(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); {49462#(not (= |ssl3_accept_#t~mem51| 8195))} is VALID [2022-04-27 15:30:11,211 INFO L290 TraceCheckUtils]: 59: Hoare triple {49462#(not (= |ssl3_accept_#t~mem51| 8195))} assume 8195 == #t~mem51;havoc #t~mem51; {49457#false} is VALID [2022-04-27 15:30:11,211 INFO L290 TraceCheckUtils]: 60: Hoare triple {49457#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {49457#false} is VALID [2022-04-27 15:30:11,211 INFO L290 TraceCheckUtils]: 61: Hoare triple {49457#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {49457#false} is VALID [2022-04-27 15:30:11,211 INFO L290 TraceCheckUtils]: 62: Hoare triple {49457#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {49457#false} is VALID [2022-04-27 15:30:11,211 INFO L290 TraceCheckUtils]: 63: Hoare triple {49457#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); {49457#false} is VALID [2022-04-27 15:30:11,211 INFO L290 TraceCheckUtils]: 64: Hoare triple {49457#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {49457#false} is VALID [2022-04-27 15:30:11,211 INFO L290 TraceCheckUtils]: 65: Hoare triple {49457#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); {49457#false} is VALID [2022-04-27 15:30:11,211 INFO L290 TraceCheckUtils]: 66: Hoare triple {49457#false} assume 12292 != #t~mem85;havoc #t~mem85; {49457#false} is VALID [2022-04-27 15:30:11,212 INFO L290 TraceCheckUtils]: 67: Hoare triple {49457#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; {49457#false} is VALID [2022-04-27 15:30:11,212 INFO L290 TraceCheckUtils]: 68: Hoare triple {49457#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); {49457#false} is VALID [2022-04-27 15:30:11,212 INFO L290 TraceCheckUtils]: 69: Hoare triple {49457#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {49457#false} is VALID [2022-04-27 15:30:11,212 INFO L290 TraceCheckUtils]: 70: Hoare triple {49457#false} ~skip~0 := 0; {49457#false} is VALID [2022-04-27 15:30:11,212 INFO L290 TraceCheckUtils]: 71: Hoare triple {49457#false} assume !false; {49457#false} is VALID [2022-04-27 15:30:11,212 INFO L290 TraceCheckUtils]: 72: Hoare triple {49457#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); {49457#false} is VALID [2022-04-27 15:30:11,212 INFO L290 TraceCheckUtils]: 73: Hoare triple {49457#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {49457#false} is VALID [2022-04-27 15:30:11,212 INFO L290 TraceCheckUtils]: 74: Hoare triple {49457#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {49457#false} is VALID [2022-04-27 15:30:11,212 INFO L290 TraceCheckUtils]: 75: Hoare triple {49457#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {49457#false} is VALID [2022-04-27 15:30:11,212 INFO L290 TraceCheckUtils]: 76: Hoare triple {49457#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {49457#false} is VALID [2022-04-27 15:30:11,212 INFO L290 TraceCheckUtils]: 77: Hoare triple {49457#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {49457#false} is VALID [2022-04-27 15:30:11,212 INFO L290 TraceCheckUtils]: 78: Hoare triple {49457#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {49457#false} is VALID [2022-04-27 15:30:11,212 INFO L290 TraceCheckUtils]: 79: Hoare triple {49457#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {49457#false} is VALID [2022-04-27 15:30:11,212 INFO L290 TraceCheckUtils]: 80: Hoare triple {49457#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {49457#false} is VALID [2022-04-27 15:30:11,212 INFO L290 TraceCheckUtils]: 81: Hoare triple {49457#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {49457#false} is VALID [2022-04-27 15:30:11,212 INFO L290 TraceCheckUtils]: 82: Hoare triple {49457#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {49457#false} is VALID [2022-04-27 15:30:11,212 INFO L290 TraceCheckUtils]: 83: Hoare triple {49457#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {49457#false} is VALID [2022-04-27 15:30:11,213 INFO L290 TraceCheckUtils]: 84: Hoare triple {49457#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {49457#false} is VALID [2022-04-27 15:30:11,213 INFO L290 TraceCheckUtils]: 85: Hoare triple {49457#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {49457#false} is VALID [2022-04-27 15:30:11,213 INFO L290 TraceCheckUtils]: 86: Hoare triple {49457#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {49457#false} is VALID [2022-04-27 15:30:11,213 INFO L290 TraceCheckUtils]: 87: Hoare triple {49457#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {49457#false} is VALID [2022-04-27 15:30:11,213 INFO L290 TraceCheckUtils]: 88: Hoare triple {49457#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {49457#false} is VALID [2022-04-27 15:30:11,213 INFO L290 TraceCheckUtils]: 89: Hoare triple {49457#false} assume 8529 == #t~mem63;havoc #t~mem63; {49457#false} is VALID [2022-04-27 15:30:11,213 INFO L290 TraceCheckUtils]: 90: Hoare triple {49457#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); {49457#false} is VALID [2022-04-27 15:30:11,213 INFO L290 TraceCheckUtils]: 91: Hoare triple {49457#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; {49457#false} is VALID [2022-04-27 15:30:11,213 INFO L290 TraceCheckUtils]: 92: Hoare triple {49457#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); {49457#false} is VALID [2022-04-27 15:30:11,213 INFO L290 TraceCheckUtils]: 93: Hoare triple {49457#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {49457#false} is VALID [2022-04-27 15:30:11,213 INFO L290 TraceCheckUtils]: 94: Hoare triple {49457#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {49457#false} is VALID [2022-04-27 15:30:11,213 INFO L290 TraceCheckUtils]: 95: Hoare triple {49457#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {49457#false} is VALID [2022-04-27 15:30:11,213 INFO L290 TraceCheckUtils]: 96: Hoare triple {49457#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {49457#false} is VALID [2022-04-27 15:30:11,213 INFO L290 TraceCheckUtils]: 97: Hoare triple {49457#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); {49457#false} is VALID [2022-04-27 15:30:11,213 INFO L290 TraceCheckUtils]: 98: Hoare triple {49457#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {49457#false} is VALID [2022-04-27 15:30:11,213 INFO L290 TraceCheckUtils]: 99: Hoare triple {49457#false} ~skip~0 := 0; {49457#false} is VALID [2022-04-27 15:30:11,213 INFO L290 TraceCheckUtils]: 100: Hoare triple {49457#false} assume !false; {49457#false} is VALID [2022-04-27 15:30:11,214 INFO L290 TraceCheckUtils]: 101: Hoare triple {49457#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); {49457#false} is VALID [2022-04-27 15:30:11,214 INFO L290 TraceCheckUtils]: 102: Hoare triple {49457#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {49457#false} is VALID [2022-04-27 15:30:11,214 INFO L290 TraceCheckUtils]: 103: Hoare triple {49457#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {49457#false} is VALID [2022-04-27 15:30:11,214 INFO L290 TraceCheckUtils]: 104: Hoare triple {49457#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {49457#false} is VALID [2022-04-27 15:30:11,214 INFO L290 TraceCheckUtils]: 105: Hoare triple {49457#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {49457#false} is VALID [2022-04-27 15:30:11,214 INFO L290 TraceCheckUtils]: 106: Hoare triple {49457#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {49457#false} is VALID [2022-04-27 15:30:11,214 INFO L290 TraceCheckUtils]: 107: Hoare triple {49457#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {49457#false} is VALID [2022-04-27 15:30:11,214 INFO L290 TraceCheckUtils]: 108: Hoare triple {49457#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {49457#false} is VALID [2022-04-27 15:30:11,214 INFO L290 TraceCheckUtils]: 109: Hoare triple {49457#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {49457#false} is VALID [2022-04-27 15:30:11,214 INFO L290 TraceCheckUtils]: 110: Hoare triple {49457#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {49457#false} is VALID [2022-04-27 15:30:11,214 INFO L290 TraceCheckUtils]: 111: Hoare triple {49457#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {49457#false} is VALID [2022-04-27 15:30:11,214 INFO L290 TraceCheckUtils]: 112: Hoare triple {49457#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {49457#false} is VALID [2022-04-27 15:30:11,214 INFO L290 TraceCheckUtils]: 113: Hoare triple {49457#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {49457#false} is VALID [2022-04-27 15:30:11,214 INFO L290 TraceCheckUtils]: 114: Hoare triple {49457#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {49457#false} is VALID [2022-04-27 15:30:11,214 INFO L290 TraceCheckUtils]: 115: Hoare triple {49457#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {49457#false} is VALID [2022-04-27 15:30:11,214 INFO L290 TraceCheckUtils]: 116: Hoare triple {49457#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {49457#false} is VALID [2022-04-27 15:30:11,214 INFO L290 TraceCheckUtils]: 117: Hoare triple {49457#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {49457#false} is VALID [2022-04-27 15:30:11,215 INFO L290 TraceCheckUtils]: 118: Hoare triple {49457#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {49457#false} is VALID [2022-04-27 15:30:11,215 INFO L290 TraceCheckUtils]: 119: Hoare triple {49457#false} assume 8544 == #t~mem64;havoc #t~mem64; {49457#false} is VALID [2022-04-27 15:30:11,215 INFO L290 TraceCheckUtils]: 120: Hoare triple {49457#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {49457#false} is VALID [2022-04-27 15:30:11,215 INFO L290 TraceCheckUtils]: 121: Hoare triple {49457#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); {49457#false} is VALID [2022-04-27 15:30:11,215 INFO L290 TraceCheckUtils]: 122: Hoare triple {49457#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {49457#false} is VALID [2022-04-27 15:30:11,215 INFO L290 TraceCheckUtils]: 123: Hoare triple {49457#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); {49457#false} is VALID [2022-04-27 15:30:11,215 INFO L290 TraceCheckUtils]: 124: Hoare triple {49457#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; {49457#false} is VALID [2022-04-27 15:30:11,215 INFO L290 TraceCheckUtils]: 125: Hoare triple {49457#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; {49457#false} is VALID [2022-04-27 15:30:11,215 INFO L290 TraceCheckUtils]: 126: Hoare triple {49457#false} assume 8 == ~blastFlag~0; {49457#false} is VALID [2022-04-27 15:30:11,215 INFO L290 TraceCheckUtils]: 127: Hoare triple {49457#false} assume !false; {49457#false} is VALID [2022-04-27 15:30:11,215 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-04-27 15:30:11,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:30:11,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371897176] [2022-04-27 15:30:11,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371897176] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:30:11,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:30:11,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:30:11,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665908714] [2022-04-27 15:30:11,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:30:11,216 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 128 [2022-04-27 15:30:11,216 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:30:11,217 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:11,287 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:30:11,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:30:11,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:30:11,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:30:11,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:30:11,289 INFO L87 Difference]: Start difference. First operand 420 states and 633 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:18,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:30:18,143 INFO L93 Difference]: Finished difference Result 889 states and 1341 transitions. [2022-04-27 15:30:18,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:30:18,143 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 128 [2022-04-27 15:30:18,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:30:18,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:18,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 583 transitions. [2022-04-27 15:30:18,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:18,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 583 transitions. [2022-04-27 15:30:18,147 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 583 transitions. [2022-04-27 15:30:18,499 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 583 edges. 583 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:30:18,508 INFO L225 Difference]: With dead ends: 889 [2022-04-27 15:30:18,508 INFO L226 Difference]: Without dead ends: 495 [2022-04-27 15:30:18,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:30:18,509 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 137 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-04-27 15:30:18,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 346 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-27 15:30:18,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2022-04-27 15:30:18,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 420. [2022-04-27 15:30:18,515 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:30:18,516 INFO L82 GeneralOperation]: Start isEquivalent. First operand 495 states. Second operand has 420 states, 415 states have (on average 1.4963855421686747) internal successors, (621), 415 states have internal predecessors, (621), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:18,516 INFO L74 IsIncluded]: Start isIncluded. First operand 495 states. Second operand has 420 states, 415 states have (on average 1.4963855421686747) internal successors, (621), 415 states have internal predecessors, (621), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:18,516 INFO L87 Difference]: Start difference. First operand 495 states. Second operand has 420 states, 415 states have (on average 1.4963855421686747) internal successors, (621), 415 states have internal predecessors, (621), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:18,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:30:18,524 INFO L93 Difference]: Finished difference Result 495 states and 730 transitions. [2022-04-27 15:30:18,525 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 730 transitions. [2022-04-27 15:30:18,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:30:18,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:30:18,525 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 495 states. [2022-04-27 15:30:18,527 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 495 states. [2022-04-27 15:30:18,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:30:18,535 INFO L93 Difference]: Finished difference Result 495 states and 730 transitions. [2022-04-27 15:30:18,535 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 730 transitions. [2022-04-27 15:30:18,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:30:18,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:30:18,535 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:30:18,535 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:30:18,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 415 states have (on average 1.4963855421686747) internal successors, (621), 415 states have internal predecessors, (621), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:18,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 625 transitions. [2022-04-27 15:30:18,542 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 625 transitions. Word has length 128 [2022-04-27 15:30:18,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:30:18,542 INFO L495 AbstractCegarLoop]: Abstraction has 420 states and 625 transitions. [2022-04-27 15:30:18,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:18,544 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 625 transitions. [2022-04-27 15:30:18,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-04-27 15:30:18,546 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:30:18,546 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:30:18,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-04-27 15:30:18,546 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:30:18,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:30:18,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1085696608, now seen corresponding path program 1 times [2022-04-27 15:30:18,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:30:18,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500767550] [2022-04-27 15:30:18,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:30:18,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:30:18,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:30:18,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:30:18,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:30:18,669 INFO L290 TraceCheckUtils]: 0: Hoare triple {51930#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {51923#true} is VALID [2022-04-27 15:30:18,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {51923#true} assume true; {51923#true} is VALID [2022-04-27 15:30:18,669 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {51923#true} {51923#true} #689#return; {51923#true} is VALID [2022-04-27 15:30:18,669 INFO L272 TraceCheckUtils]: 0: Hoare triple {51923#true} call ULTIMATE.init(); {51930#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:30:18,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {51930#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {51923#true} is VALID [2022-04-27 15:30:18,670 INFO L290 TraceCheckUtils]: 2: Hoare triple {51923#true} assume true; {51923#true} is VALID [2022-04-27 15:30:18,670 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51923#true} {51923#true} #689#return; {51923#true} is VALID [2022-04-27 15:30:18,670 INFO L272 TraceCheckUtils]: 4: Hoare triple {51923#true} call #t~ret161 := main(); {51923#true} is VALID [2022-04-27 15:30:18,670 INFO L290 TraceCheckUtils]: 5: Hoare triple {51923#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; {51923#true} is VALID [2022-04-27 15:30:18,670 INFO L290 TraceCheckUtils]: 6: Hoare triple {51923#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {51923#true} is VALID [2022-04-27 15:30:18,670 INFO L272 TraceCheckUtils]: 7: Hoare triple {51923#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {51923#true} is VALID [2022-04-27 15:30:18,670 INFO L290 TraceCheckUtils]: 8: Hoare triple {51923#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); {51923#true} is VALID [2022-04-27 15:30:18,670 INFO L290 TraceCheckUtils]: 9: Hoare triple {51923#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; {51923#true} is VALID [2022-04-27 15:30:18,670 INFO L290 TraceCheckUtils]: 10: Hoare triple {51923#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; {51923#true} is VALID [2022-04-27 15:30:18,670 INFO L290 TraceCheckUtils]: 11: Hoare triple {51923#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {51923#true} is VALID [2022-04-27 15:30:18,670 INFO L290 TraceCheckUtils]: 12: Hoare triple {51923#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {51923#true} is VALID [2022-04-27 15:30:18,670 INFO L290 TraceCheckUtils]: 13: Hoare triple {51923#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {51923#true} is VALID [2022-04-27 15:30:18,670 INFO L290 TraceCheckUtils]: 14: Hoare triple {51923#true} assume !false; {51923#true} is VALID [2022-04-27 15:30:18,670 INFO L290 TraceCheckUtils]: 15: Hoare triple {51923#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); {51923#true} is VALID [2022-04-27 15:30:18,670 INFO L290 TraceCheckUtils]: 16: Hoare triple {51923#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {51923#true} is VALID [2022-04-27 15:30:18,671 INFO L290 TraceCheckUtils]: 17: Hoare triple {51923#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {51923#true} is VALID [2022-04-27 15:30:18,671 INFO L290 TraceCheckUtils]: 18: Hoare triple {51923#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {51923#true} is VALID [2022-04-27 15:30:18,671 INFO L290 TraceCheckUtils]: 19: Hoare triple {51923#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {51923#true} is VALID [2022-04-27 15:30:18,671 INFO L290 TraceCheckUtils]: 20: Hoare triple {51923#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {51923#true} is VALID [2022-04-27 15:30:18,671 INFO L290 TraceCheckUtils]: 21: Hoare triple {51923#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {51923#true} is VALID [2022-04-27 15:30:18,671 INFO L290 TraceCheckUtils]: 22: Hoare triple {51923#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {51923#true} is VALID [2022-04-27 15:30:18,671 INFO L290 TraceCheckUtils]: 23: Hoare triple {51923#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {51923#true} is VALID [2022-04-27 15:30:18,671 INFO L290 TraceCheckUtils]: 24: Hoare triple {51923#true} assume 8464 == #t~mem55;havoc #t~mem55; {51923#true} is VALID [2022-04-27 15:30:18,671 INFO L290 TraceCheckUtils]: 25: Hoare triple {51923#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; {51923#true} is VALID [2022-04-27 15:30:18,671 INFO L290 TraceCheckUtils]: 26: Hoare triple {51923#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {51923#true} is VALID [2022-04-27 15:30:18,671 INFO L290 TraceCheckUtils]: 27: Hoare triple {51923#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); {51923#true} is VALID [2022-04-27 15:30:18,671 INFO L290 TraceCheckUtils]: 28: Hoare triple {51923#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); {51923#true} is VALID [2022-04-27 15:30:18,671 INFO L290 TraceCheckUtils]: 29: Hoare triple {51923#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {51923#true} is VALID [2022-04-27 15:30:18,671 INFO L290 TraceCheckUtils]: 30: Hoare triple {51923#true} ~skip~0 := 0; {51923#true} is VALID [2022-04-27 15:30:18,671 INFO L290 TraceCheckUtils]: 31: Hoare triple {51923#true} assume !false; {51923#true} is VALID [2022-04-27 15:30:18,671 INFO L290 TraceCheckUtils]: 32: Hoare triple {51923#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); {51923#true} is VALID [2022-04-27 15:30:18,671 INFO L290 TraceCheckUtils]: 33: Hoare triple {51923#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {51923#true} is VALID [2022-04-27 15:30:18,672 INFO L290 TraceCheckUtils]: 34: Hoare triple {51923#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {51923#true} is VALID [2022-04-27 15:30:18,672 INFO L290 TraceCheckUtils]: 35: Hoare triple {51923#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {51923#true} is VALID [2022-04-27 15:30:18,672 INFO L290 TraceCheckUtils]: 36: Hoare triple {51923#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {51923#true} is VALID [2022-04-27 15:30:18,672 INFO L290 TraceCheckUtils]: 37: Hoare triple {51923#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {51923#true} is VALID [2022-04-27 15:30:18,672 INFO L290 TraceCheckUtils]: 38: Hoare triple {51923#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {51923#true} is VALID [2022-04-27 15:30:18,672 INFO L290 TraceCheckUtils]: 39: Hoare triple {51923#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {51923#true} is VALID [2022-04-27 15:30:18,672 INFO L290 TraceCheckUtils]: 40: Hoare triple {51923#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {51923#true} is VALID [2022-04-27 15:30:18,672 INFO L290 TraceCheckUtils]: 41: Hoare triple {51923#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {51923#true} is VALID [2022-04-27 15:30:18,672 INFO L290 TraceCheckUtils]: 42: Hoare triple {51923#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {51923#true} is VALID [2022-04-27 15:30:18,672 INFO L290 TraceCheckUtils]: 43: Hoare triple {51923#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {51923#true} is VALID [2022-04-27 15:30:18,672 INFO L290 TraceCheckUtils]: 44: Hoare triple {51923#true} assume 8496 == #t~mem58;havoc #t~mem58; {51923#true} is VALID [2022-04-27 15:30:18,672 INFO L290 TraceCheckUtils]: 45: Hoare triple {51923#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {51923#true} is VALID [2022-04-27 15:30:18,672 INFO L290 TraceCheckUtils]: 46: Hoare triple {51923#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {51923#true} is VALID [2022-04-27 15:30:18,672 INFO L290 TraceCheckUtils]: 47: Hoare triple {51923#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {51923#true} is VALID [2022-04-27 15:30:18,673 INFO L290 TraceCheckUtils]: 48: Hoare triple {51923#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {51928#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:18,674 INFO L290 TraceCheckUtils]: 49: Hoare triple {51928#(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); {51928#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:18,674 INFO L290 TraceCheckUtils]: 50: Hoare triple {51928#(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); {51928#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:18,674 INFO L290 TraceCheckUtils]: 51: Hoare triple {51928#(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; {51928#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:18,675 INFO L290 TraceCheckUtils]: 52: Hoare triple {51928#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {51928#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:18,675 INFO L290 TraceCheckUtils]: 53: Hoare triple {51928#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {51928#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:18,675 INFO L290 TraceCheckUtils]: 54: Hoare triple {51928#(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); {51928#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:18,676 INFO L290 TraceCheckUtils]: 55: Hoare triple {51928#(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); {51928#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:18,676 INFO L290 TraceCheckUtils]: 56: Hoare triple {51928#(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); {51928#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:18,676 INFO L290 TraceCheckUtils]: 57: Hoare triple {51928#(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); {51928#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:18,677 INFO L290 TraceCheckUtils]: 58: Hoare triple {51928#(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); {51928#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:18,677 INFO L290 TraceCheckUtils]: 59: Hoare triple {51928#(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); {51928#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:18,677 INFO L290 TraceCheckUtils]: 60: Hoare triple {51928#(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); {51928#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:18,678 INFO L290 TraceCheckUtils]: 61: Hoare triple {51928#(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); {51928#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:18,678 INFO L290 TraceCheckUtils]: 62: Hoare triple {51928#(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); {51928#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:18,678 INFO L290 TraceCheckUtils]: 63: Hoare triple {51928#(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); {51928#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:18,679 INFO L290 TraceCheckUtils]: 64: Hoare triple {51928#(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); {51928#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:18,679 INFO L290 TraceCheckUtils]: 65: Hoare triple {51928#(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); {51928#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:18,680 INFO L290 TraceCheckUtils]: 66: Hoare triple {51928#(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); {51928#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:18,680 INFO L290 TraceCheckUtils]: 67: Hoare triple {51928#(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); {51928#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:18,680 INFO L290 TraceCheckUtils]: 68: Hoare triple {51928#(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); {51928#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:18,681 INFO L290 TraceCheckUtils]: 69: Hoare triple {51928#(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); {51928#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:18,681 INFO L290 TraceCheckUtils]: 70: Hoare triple {51928#(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); {51928#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:18,681 INFO L290 TraceCheckUtils]: 71: Hoare triple {51928#(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); {51928#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:18,682 INFO L290 TraceCheckUtils]: 72: Hoare triple {51928#(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); {51928#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:18,682 INFO L290 TraceCheckUtils]: 73: Hoare triple {51928#(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); {51928#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:18,682 INFO L290 TraceCheckUtils]: 74: Hoare triple {51928#(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); {51928#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:18,683 INFO L290 TraceCheckUtils]: 75: Hoare triple {51928#(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); {51928#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:18,683 INFO L290 TraceCheckUtils]: 76: Hoare triple {51928#(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); {51928#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:18,683 INFO L290 TraceCheckUtils]: 77: Hoare triple {51928#(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); {51928#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:18,684 INFO L290 TraceCheckUtils]: 78: Hoare triple {51928#(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); {51928#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:18,684 INFO L290 TraceCheckUtils]: 79: Hoare triple {51928#(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); {51928#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:18,684 INFO L290 TraceCheckUtils]: 80: Hoare triple {51928#(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); {51928#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:18,685 INFO L290 TraceCheckUtils]: 81: Hoare triple {51928#(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); {51928#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:18,685 INFO L290 TraceCheckUtils]: 82: Hoare triple {51928#(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); {51928#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:18,685 INFO L290 TraceCheckUtils]: 83: Hoare triple {51928#(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); {51928#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:18,686 INFO L290 TraceCheckUtils]: 84: Hoare triple {51928#(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); {51928#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:18,686 INFO L290 TraceCheckUtils]: 85: Hoare triple {51928#(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); {51928#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:18,686 INFO L290 TraceCheckUtils]: 86: Hoare triple {51928#(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); {51929#(not (= |ssl3_accept_#t~mem79| 8672))} is VALID [2022-04-27 15:30:18,687 INFO L290 TraceCheckUtils]: 87: Hoare triple {51929#(not (= |ssl3_accept_#t~mem79| 8672))} assume 8672 == #t~mem79;havoc #t~mem79; {51924#false} is VALID [2022-04-27 15:30:18,687 INFO L290 TraceCheckUtils]: 88: Hoare triple {51924#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {51924#false} is VALID [2022-04-27 15:30:18,687 INFO L290 TraceCheckUtils]: 89: Hoare triple {51924#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {51924#false} is VALID [2022-04-27 15:30:18,687 INFO L290 TraceCheckUtils]: 90: Hoare triple {51924#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); {51924#false} is VALID [2022-04-27 15:30:18,688 INFO L290 TraceCheckUtils]: 91: Hoare triple {51924#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; {51924#false} is VALID [2022-04-27 15:30:18,688 INFO L290 TraceCheckUtils]: 92: Hoare triple {51924#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {51924#false} is VALID [2022-04-27 15:30:18,688 INFO L290 TraceCheckUtils]: 93: Hoare triple {51924#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); {51924#false} is VALID [2022-04-27 15:30:18,688 INFO L290 TraceCheckUtils]: 94: Hoare triple {51924#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {51924#false} is VALID [2022-04-27 15:30:18,688 INFO L290 TraceCheckUtils]: 95: Hoare triple {51924#false} ~skip~0 := 0; {51924#false} is VALID [2022-04-27 15:30:18,688 INFO L290 TraceCheckUtils]: 96: Hoare triple {51924#false} assume !false; {51924#false} is VALID [2022-04-27 15:30:18,688 INFO L290 TraceCheckUtils]: 97: Hoare triple {51924#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); {51924#false} is VALID [2022-04-27 15:30:18,688 INFO L290 TraceCheckUtils]: 98: Hoare triple {51924#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {51924#false} is VALID [2022-04-27 15:30:18,688 INFO L290 TraceCheckUtils]: 99: Hoare triple {51924#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {51924#false} is VALID [2022-04-27 15:30:18,688 INFO L290 TraceCheckUtils]: 100: Hoare triple {51924#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {51924#false} is VALID [2022-04-27 15:30:18,688 INFO L290 TraceCheckUtils]: 101: Hoare triple {51924#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {51924#false} is VALID [2022-04-27 15:30:18,688 INFO L290 TraceCheckUtils]: 102: Hoare triple {51924#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {51924#false} is VALID [2022-04-27 15:30:18,688 INFO L290 TraceCheckUtils]: 103: Hoare triple {51924#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {51924#false} is VALID [2022-04-27 15:30:18,688 INFO L290 TraceCheckUtils]: 104: Hoare triple {51924#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {51924#false} is VALID [2022-04-27 15:30:18,689 INFO L290 TraceCheckUtils]: 105: Hoare triple {51924#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {51924#false} is VALID [2022-04-27 15:30:18,689 INFO L290 TraceCheckUtils]: 106: Hoare triple {51924#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {51924#false} is VALID [2022-04-27 15:30:18,689 INFO L290 TraceCheckUtils]: 107: Hoare triple {51924#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {51924#false} is VALID [2022-04-27 15:30:18,689 INFO L290 TraceCheckUtils]: 108: Hoare triple {51924#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {51924#false} is VALID [2022-04-27 15:30:18,689 INFO L290 TraceCheckUtils]: 109: Hoare triple {51924#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {51924#false} is VALID [2022-04-27 15:30:18,689 INFO L290 TraceCheckUtils]: 110: Hoare triple {51924#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {51924#false} is VALID [2022-04-27 15:30:18,689 INFO L290 TraceCheckUtils]: 111: Hoare triple {51924#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {51924#false} is VALID [2022-04-27 15:30:18,689 INFO L290 TraceCheckUtils]: 112: Hoare triple {51924#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {51924#false} is VALID [2022-04-27 15:30:18,689 INFO L290 TraceCheckUtils]: 113: Hoare triple {51924#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {51924#false} is VALID [2022-04-27 15:30:18,689 INFO L290 TraceCheckUtils]: 114: Hoare triple {51924#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {51924#false} is VALID [2022-04-27 15:30:18,689 INFO L290 TraceCheckUtils]: 115: Hoare triple {51924#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {51924#false} is VALID [2022-04-27 15:30:18,689 INFO L290 TraceCheckUtils]: 116: Hoare triple {51924#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {51924#false} is VALID [2022-04-27 15:30:18,689 INFO L290 TraceCheckUtils]: 117: Hoare triple {51924#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {51924#false} is VALID [2022-04-27 15:30:18,689 INFO L290 TraceCheckUtils]: 118: Hoare triple {51924#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {51924#false} is VALID [2022-04-27 15:30:18,689 INFO L290 TraceCheckUtils]: 119: Hoare triple {51924#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {51924#false} is VALID [2022-04-27 15:30:18,689 INFO L290 TraceCheckUtils]: 120: Hoare triple {51924#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {51924#false} is VALID [2022-04-27 15:30:18,689 INFO L290 TraceCheckUtils]: 121: Hoare triple {51924#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {51924#false} is VALID [2022-04-27 15:30:18,690 INFO L290 TraceCheckUtils]: 122: Hoare triple {51924#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {51924#false} is VALID [2022-04-27 15:30:18,690 INFO L290 TraceCheckUtils]: 123: Hoare triple {51924#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {51924#false} is VALID [2022-04-27 15:30:18,690 INFO L290 TraceCheckUtils]: 124: Hoare triple {51924#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {51924#false} is VALID [2022-04-27 15:30:18,690 INFO L290 TraceCheckUtils]: 125: Hoare triple {51924#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {51924#false} is VALID [2022-04-27 15:30:18,690 INFO L290 TraceCheckUtils]: 126: Hoare triple {51924#false} assume 8640 == #t~mem75;havoc #t~mem75; {51924#false} is VALID [2022-04-27 15:30:18,690 INFO L290 TraceCheckUtils]: 127: Hoare triple {51924#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {51924#false} is VALID [2022-04-27 15:30:18,690 INFO L290 TraceCheckUtils]: 128: Hoare triple {51924#false} assume 4 == ~blastFlag~0; {51924#false} is VALID [2022-04-27 15:30:18,690 INFO L290 TraceCheckUtils]: 129: Hoare triple {51924#false} assume !false; {51924#false} is VALID [2022-04-27 15:30:18,690 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-27 15:30:18,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:30:18,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500767550] [2022-04-27 15:30:18,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500767550] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:30:18,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:30:18,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:30:18,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788352694] [2022-04-27 15:30:18,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:30:18,691 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-27 15:30:18,691 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:30:18,692 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-27 15:30:18,789 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-27 15:30:18,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:30:18,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:30:18,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:30:18,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:30:18,791 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-27 15:30:26,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:30:26,042 INFO L93 Difference]: Finished difference Result 929 states and 1386 transitions. [2022-04-27 15:30:26,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:30:26,043 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-27 15:30:26,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:30:26,043 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-27 15:30:26,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 582 transitions. [2022-04-27 15:30:26,045 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-27 15:30:26,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 582 transitions. [2022-04-27 15:30:26,046 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 582 transitions. [2022-04-27 15:30:26,443 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 582 edges. 582 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:30:26,452 INFO L225 Difference]: With dead ends: 929 [2022-04-27 15:30:26,453 INFO L226 Difference]: Without dead ends: 535 [2022-04-27 15:30:26,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:30:26,453 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 107 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 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, 3.3s IncrementalHoareTripleChecker+Time [2022-04-27 15:30:26,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 347 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-04-27 15:30:26,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2022-04-27 15:30:26,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 463. [2022-04-27 15:30:26,460 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:30:26,460 INFO L82 GeneralOperation]: Start isEquivalent. First operand 535 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-27 15:30:26,460 INFO L74 IsIncluded]: Start isIncluded. First operand 535 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-27 15:30:26,461 INFO L87 Difference]: Start difference. First operand 535 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-27 15:30:26,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:30:26,469 INFO L93 Difference]: Finished difference Result 535 states and 790 transitions. [2022-04-27 15:30:26,469 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 790 transitions. [2022-04-27 15:30:26,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:30:26,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:30:26,470 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 535 states. [2022-04-27 15:30:26,470 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 535 states. [2022-04-27 15:30:26,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:30:26,479 INFO L93 Difference]: Finished difference Result 535 states and 790 transitions. [2022-04-27 15:30:26,479 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 790 transitions. [2022-04-27 15:30:26,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:30:26,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:30:26,480 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:30:26,480 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:30:26,480 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-27 15:30:26,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 691 transitions. [2022-04-27 15:30:26,487 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 691 transitions. Word has length 130 [2022-04-27 15:30:26,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:30:26,487 INFO L495 AbstractCegarLoop]: Abstraction has 463 states and 691 transitions. [2022-04-27 15:30:26,488 INFO L496 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-27 15:30:26,488 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 691 transitions. [2022-04-27 15:30:26,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-27 15:30:26,488 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:30:26,488 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:30:26,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-04-27 15:30:26,489 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:30:26,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:30:26,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1183688361, now seen corresponding path program 1 times [2022-04-27 15:30:26,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:30:26,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688532584] [2022-04-27 15:30:26,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:30:26,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:30:26,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:30:26,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:30:26,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:30:26,587 INFO L290 TraceCheckUtils]: 0: Hoare triple {54564#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {54557#true} is VALID [2022-04-27 15:30:26,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {54557#true} assume true; {54557#true} is VALID [2022-04-27 15:30:26,587 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {54557#true} {54557#true} #689#return; {54557#true} is VALID [2022-04-27 15:30:26,588 INFO L272 TraceCheckUtils]: 0: Hoare triple {54557#true} call ULTIMATE.init(); {54564#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:30:26,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {54564#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {54557#true} is VALID [2022-04-27 15:30:26,588 INFO L290 TraceCheckUtils]: 2: Hoare triple {54557#true} assume true; {54557#true} is VALID [2022-04-27 15:30:26,588 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54557#true} {54557#true} #689#return; {54557#true} is VALID [2022-04-27 15:30:26,588 INFO L272 TraceCheckUtils]: 4: Hoare triple {54557#true} call #t~ret161 := main(); {54557#true} is VALID [2022-04-27 15:30:26,588 INFO L290 TraceCheckUtils]: 5: Hoare triple {54557#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; {54557#true} is VALID [2022-04-27 15:30:26,588 INFO L290 TraceCheckUtils]: 6: Hoare triple {54557#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {54557#true} is VALID [2022-04-27 15:30:26,588 INFO L272 TraceCheckUtils]: 7: Hoare triple {54557#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {54557#true} is VALID [2022-04-27 15:30:26,588 INFO L290 TraceCheckUtils]: 8: Hoare triple {54557#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); {54557#true} is VALID [2022-04-27 15:30:26,588 INFO L290 TraceCheckUtils]: 9: Hoare triple {54557#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; {54557#true} is VALID [2022-04-27 15:30:26,588 INFO L290 TraceCheckUtils]: 10: Hoare triple {54557#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; {54557#true} is VALID [2022-04-27 15:30:26,588 INFO L290 TraceCheckUtils]: 11: Hoare triple {54557#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {54557#true} is VALID [2022-04-27 15:30:26,588 INFO L290 TraceCheckUtils]: 12: Hoare triple {54557#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {54557#true} is VALID [2022-04-27 15:30:26,588 INFO L290 TraceCheckUtils]: 13: Hoare triple {54557#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {54557#true} is VALID [2022-04-27 15:30:26,588 INFO L290 TraceCheckUtils]: 14: Hoare triple {54557#true} assume !false; {54557#true} is VALID [2022-04-27 15:30:26,588 INFO L290 TraceCheckUtils]: 15: Hoare triple {54557#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); {54557#true} is VALID [2022-04-27 15:30:26,589 INFO L290 TraceCheckUtils]: 16: Hoare triple {54557#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {54557#true} is VALID [2022-04-27 15:30:26,589 INFO L290 TraceCheckUtils]: 17: Hoare triple {54557#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {54557#true} is VALID [2022-04-27 15:30:26,589 INFO L290 TraceCheckUtils]: 18: Hoare triple {54557#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {54557#true} is VALID [2022-04-27 15:30:26,589 INFO L290 TraceCheckUtils]: 19: Hoare triple {54557#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {54557#true} is VALID [2022-04-27 15:30:26,589 INFO L290 TraceCheckUtils]: 20: Hoare triple {54557#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {54557#true} is VALID [2022-04-27 15:30:26,589 INFO L290 TraceCheckUtils]: 21: Hoare triple {54557#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {54557#true} is VALID [2022-04-27 15:30:26,589 INFO L290 TraceCheckUtils]: 22: Hoare triple {54557#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {54557#true} is VALID [2022-04-27 15:30:26,589 INFO L290 TraceCheckUtils]: 23: Hoare triple {54557#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {54557#true} is VALID [2022-04-27 15:30:26,589 INFO L290 TraceCheckUtils]: 24: Hoare triple {54557#true} assume 8464 == #t~mem55;havoc #t~mem55; {54557#true} is VALID [2022-04-27 15:30:26,589 INFO L290 TraceCheckUtils]: 25: Hoare triple {54557#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; {54557#true} is VALID [2022-04-27 15:30:26,589 INFO L290 TraceCheckUtils]: 26: Hoare triple {54557#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {54557#true} is VALID [2022-04-27 15:30:26,589 INFO L290 TraceCheckUtils]: 27: Hoare triple {54557#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); {54557#true} is VALID [2022-04-27 15:30:26,589 INFO L290 TraceCheckUtils]: 28: Hoare triple {54557#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); {54557#true} is VALID [2022-04-27 15:30:26,589 INFO L290 TraceCheckUtils]: 29: Hoare triple {54557#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {54557#true} is VALID [2022-04-27 15:30:26,589 INFO L290 TraceCheckUtils]: 30: Hoare triple {54557#true} ~skip~0 := 0; {54557#true} is VALID [2022-04-27 15:30:26,589 INFO L290 TraceCheckUtils]: 31: Hoare triple {54557#true} assume !false; {54557#true} is VALID [2022-04-27 15:30:26,589 INFO L290 TraceCheckUtils]: 32: Hoare triple {54557#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); {54557#true} is VALID [2022-04-27 15:30:26,590 INFO L290 TraceCheckUtils]: 33: Hoare triple {54557#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {54557#true} is VALID [2022-04-27 15:30:26,590 INFO L290 TraceCheckUtils]: 34: Hoare triple {54557#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {54557#true} is VALID [2022-04-27 15:30:26,590 INFO L290 TraceCheckUtils]: 35: Hoare triple {54557#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {54557#true} is VALID [2022-04-27 15:30:26,590 INFO L290 TraceCheckUtils]: 36: Hoare triple {54557#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {54557#true} is VALID [2022-04-27 15:30:26,590 INFO L290 TraceCheckUtils]: 37: Hoare triple {54557#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {54557#true} is VALID [2022-04-27 15:30:26,590 INFO L290 TraceCheckUtils]: 38: Hoare triple {54557#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {54557#true} is VALID [2022-04-27 15:30:26,590 INFO L290 TraceCheckUtils]: 39: Hoare triple {54557#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {54557#true} is VALID [2022-04-27 15:30:26,590 INFO L290 TraceCheckUtils]: 40: Hoare triple {54557#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {54557#true} is VALID [2022-04-27 15:30:26,590 INFO L290 TraceCheckUtils]: 41: Hoare triple {54557#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {54557#true} is VALID [2022-04-27 15:30:26,590 INFO L290 TraceCheckUtils]: 42: Hoare triple {54557#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {54557#true} is VALID [2022-04-27 15:30:26,590 INFO L290 TraceCheckUtils]: 43: Hoare triple {54557#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {54557#true} is VALID [2022-04-27 15:30:26,590 INFO L290 TraceCheckUtils]: 44: Hoare triple {54557#true} assume 8496 == #t~mem58;havoc #t~mem58; {54557#true} is VALID [2022-04-27 15:30:26,590 INFO L290 TraceCheckUtils]: 45: Hoare triple {54557#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {54557#true} is VALID [2022-04-27 15:30:26,590 INFO L290 TraceCheckUtils]: 46: Hoare triple {54557#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {54557#true} is VALID [2022-04-27 15:30:26,590 INFO L290 TraceCheckUtils]: 47: Hoare triple {54557#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {54557#true} is VALID [2022-04-27 15:30:26,591 INFO L290 TraceCheckUtils]: 48: Hoare triple {54557#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {54562#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:26,592 INFO L290 TraceCheckUtils]: 49: Hoare triple {54562#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {54562#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:26,592 INFO L290 TraceCheckUtils]: 50: Hoare triple {54562#(= 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); {54562#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:26,592 INFO L290 TraceCheckUtils]: 51: Hoare triple {54562#(= 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; {54562#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:26,593 INFO L290 TraceCheckUtils]: 52: Hoare triple {54562#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {54562#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:26,593 INFO L290 TraceCheckUtils]: 53: Hoare triple {54562#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {54562#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:26,593 INFO L290 TraceCheckUtils]: 54: Hoare triple {54562#(= 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); {54562#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:26,594 INFO L290 TraceCheckUtils]: 55: Hoare triple {54562#(= 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); {54562#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:26,594 INFO L290 TraceCheckUtils]: 56: Hoare triple {54562#(= 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); {54562#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:26,594 INFO L290 TraceCheckUtils]: 57: Hoare triple {54562#(= 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); {54562#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:26,595 INFO L290 TraceCheckUtils]: 58: Hoare triple {54562#(= 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); {54562#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:26,595 INFO L290 TraceCheckUtils]: 59: Hoare triple {54562#(= 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); {54562#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:26,595 INFO L290 TraceCheckUtils]: 60: Hoare triple {54562#(= 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); {54562#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:26,596 INFO L290 TraceCheckUtils]: 61: Hoare triple {54562#(= 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); {54562#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:26,596 INFO L290 TraceCheckUtils]: 62: Hoare triple {54562#(= 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); {54562#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:26,596 INFO L290 TraceCheckUtils]: 63: Hoare triple {54562#(= 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); {54562#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:26,597 INFO L290 TraceCheckUtils]: 64: Hoare triple {54562#(= 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); {54562#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:26,597 INFO L290 TraceCheckUtils]: 65: Hoare triple {54562#(= 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); {54562#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:26,597 INFO L290 TraceCheckUtils]: 66: Hoare triple {54562#(= 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); {54562#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:26,598 INFO L290 TraceCheckUtils]: 67: Hoare triple {54562#(= 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); {54563#(= |ssl3_accept_#t~mem60| 8656)} is VALID [2022-04-27 15:30:26,598 INFO L290 TraceCheckUtils]: 68: Hoare triple {54563#(= |ssl3_accept_#t~mem60| 8656)} assume 8512 == #t~mem60;havoc #t~mem60; {54558#false} is VALID [2022-04-27 15:30:26,598 INFO L290 TraceCheckUtils]: 69: Hoare triple {54558#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); {54558#false} is VALID [2022-04-27 15:30:26,598 INFO L290 TraceCheckUtils]: 70: Hoare triple {54558#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; {54558#false} is VALID [2022-04-27 15:30:26,598 INFO L290 TraceCheckUtils]: 71: Hoare triple {54558#false} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {54558#false} is VALID [2022-04-27 15:30:26,598 INFO L290 TraceCheckUtils]: 72: Hoare triple {54558#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); {54558#false} is VALID [2022-04-27 15:30:26,598 INFO L290 TraceCheckUtils]: 73: Hoare triple {54558#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {54558#false} is VALID [2022-04-27 15:30:26,598 INFO L290 TraceCheckUtils]: 74: Hoare triple {54558#false} ~skip~0 := 0; {54558#false} is VALID [2022-04-27 15:30:26,598 INFO L290 TraceCheckUtils]: 75: Hoare triple {54558#false} assume !false; {54558#false} is VALID [2022-04-27 15:30:26,598 INFO L290 TraceCheckUtils]: 76: Hoare triple {54558#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); {54558#false} is VALID [2022-04-27 15:30:26,598 INFO L290 TraceCheckUtils]: 77: Hoare triple {54558#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {54558#false} is VALID [2022-04-27 15:30:26,599 INFO L290 TraceCheckUtils]: 78: Hoare triple {54558#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {54558#false} is VALID [2022-04-27 15:30:26,599 INFO L290 TraceCheckUtils]: 79: Hoare triple {54558#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {54558#false} is VALID [2022-04-27 15:30:26,599 INFO L290 TraceCheckUtils]: 80: Hoare triple {54558#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {54558#false} is VALID [2022-04-27 15:30:26,599 INFO L290 TraceCheckUtils]: 81: Hoare triple {54558#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {54558#false} is VALID [2022-04-27 15:30:26,599 INFO L290 TraceCheckUtils]: 82: Hoare triple {54558#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {54558#false} is VALID [2022-04-27 15:30:26,599 INFO L290 TraceCheckUtils]: 83: Hoare triple {54558#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {54558#false} is VALID [2022-04-27 15:30:26,599 INFO L290 TraceCheckUtils]: 84: Hoare triple {54558#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {54558#false} is VALID [2022-04-27 15:30:26,599 INFO L290 TraceCheckUtils]: 85: Hoare triple {54558#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {54558#false} is VALID [2022-04-27 15:30:26,599 INFO L290 TraceCheckUtils]: 86: Hoare triple {54558#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {54558#false} is VALID [2022-04-27 15:30:26,599 INFO L290 TraceCheckUtils]: 87: Hoare triple {54558#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {54558#false} is VALID [2022-04-27 15:30:26,599 INFO L290 TraceCheckUtils]: 88: Hoare triple {54558#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {54558#false} is VALID [2022-04-27 15:30:26,599 INFO L290 TraceCheckUtils]: 89: Hoare triple {54558#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {54558#false} is VALID [2022-04-27 15:30:26,599 INFO L290 TraceCheckUtils]: 90: Hoare triple {54558#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {54558#false} is VALID [2022-04-27 15:30:26,599 INFO L290 TraceCheckUtils]: 91: Hoare triple {54558#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {54558#false} is VALID [2022-04-27 15:30:26,599 INFO L290 TraceCheckUtils]: 92: Hoare triple {54558#false} assume 8528 == #t~mem62;havoc #t~mem62; {54558#false} is VALID [2022-04-27 15:30:26,599 INFO L290 TraceCheckUtils]: 93: Hoare triple {54558#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); {54558#false} is VALID [2022-04-27 15:30:26,599 INFO L290 TraceCheckUtils]: 94: Hoare triple {54558#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; {54558#false} is VALID [2022-04-27 15:30:26,600 INFO L290 TraceCheckUtils]: 95: Hoare triple {54558#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); {54558#false} is VALID [2022-04-27 15:30:26,600 INFO L290 TraceCheckUtils]: 96: Hoare triple {54558#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {54558#false} is VALID [2022-04-27 15:30:26,600 INFO L290 TraceCheckUtils]: 97: Hoare triple {54558#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {54558#false} is VALID [2022-04-27 15:30:26,600 INFO L290 TraceCheckUtils]: 98: Hoare triple {54558#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {54558#false} is VALID [2022-04-27 15:30:26,600 INFO L290 TraceCheckUtils]: 99: Hoare triple {54558#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {54558#false} is VALID [2022-04-27 15:30:26,600 INFO L290 TraceCheckUtils]: 100: Hoare triple {54558#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); {54558#false} is VALID [2022-04-27 15:30:26,600 INFO L290 TraceCheckUtils]: 101: Hoare triple {54558#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {54558#false} is VALID [2022-04-27 15:30:26,600 INFO L290 TraceCheckUtils]: 102: Hoare triple {54558#false} ~skip~0 := 0; {54558#false} is VALID [2022-04-27 15:30:26,600 INFO L290 TraceCheckUtils]: 103: Hoare triple {54558#false} assume !false; {54558#false} is VALID [2022-04-27 15:30:26,600 INFO L290 TraceCheckUtils]: 104: Hoare triple {54558#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); {54558#false} is VALID [2022-04-27 15:30:26,600 INFO L290 TraceCheckUtils]: 105: Hoare triple {54558#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {54558#false} is VALID [2022-04-27 15:30:26,600 INFO L290 TraceCheckUtils]: 106: Hoare triple {54558#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {54558#false} is VALID [2022-04-27 15:30:26,600 INFO L290 TraceCheckUtils]: 107: Hoare triple {54558#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {54558#false} is VALID [2022-04-27 15:30:26,600 INFO L290 TraceCheckUtils]: 108: Hoare triple {54558#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {54558#false} is VALID [2022-04-27 15:30:26,600 INFO L290 TraceCheckUtils]: 109: Hoare triple {54558#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {54558#false} is VALID [2022-04-27 15:30:26,600 INFO L290 TraceCheckUtils]: 110: Hoare triple {54558#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {54558#false} is VALID [2022-04-27 15:30:26,600 INFO L290 TraceCheckUtils]: 111: Hoare triple {54558#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {54558#false} is VALID [2022-04-27 15:30:26,601 INFO L290 TraceCheckUtils]: 112: Hoare triple {54558#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {54558#false} is VALID [2022-04-27 15:30:26,601 INFO L290 TraceCheckUtils]: 113: Hoare triple {54558#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {54558#false} is VALID [2022-04-27 15:30:26,601 INFO L290 TraceCheckUtils]: 114: Hoare triple {54558#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {54558#false} is VALID [2022-04-27 15:30:26,601 INFO L290 TraceCheckUtils]: 115: Hoare triple {54558#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {54558#false} is VALID [2022-04-27 15:30:26,601 INFO L290 TraceCheckUtils]: 116: Hoare triple {54558#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {54558#false} is VALID [2022-04-27 15:30:26,601 INFO L290 TraceCheckUtils]: 117: Hoare triple {54558#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {54558#false} is VALID [2022-04-27 15:30:26,601 INFO L290 TraceCheckUtils]: 118: Hoare triple {54558#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {54558#false} is VALID [2022-04-27 15:30:26,601 INFO L290 TraceCheckUtils]: 119: Hoare triple {54558#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {54558#false} is VALID [2022-04-27 15:30:26,601 INFO L290 TraceCheckUtils]: 120: Hoare triple {54558#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {54558#false} is VALID [2022-04-27 15:30:26,601 INFO L290 TraceCheckUtils]: 121: Hoare triple {54558#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {54558#false} is VALID [2022-04-27 15:30:26,601 INFO L290 TraceCheckUtils]: 122: Hoare triple {54558#false} assume 8544 == #t~mem64;havoc #t~mem64; {54558#false} is VALID [2022-04-27 15:30:26,601 INFO L290 TraceCheckUtils]: 123: Hoare triple {54558#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {54558#false} is VALID [2022-04-27 15:30:26,601 INFO L290 TraceCheckUtils]: 124: Hoare triple {54558#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); {54558#false} is VALID [2022-04-27 15:30:26,601 INFO L290 TraceCheckUtils]: 125: Hoare triple {54558#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {54558#false} is VALID [2022-04-27 15:30:26,601 INFO L290 TraceCheckUtils]: 126: Hoare triple {54558#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); {54558#false} is VALID [2022-04-27 15:30:26,601 INFO L290 TraceCheckUtils]: 127: Hoare triple {54558#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; {54558#false} is VALID [2022-04-27 15:30:26,601 INFO L290 TraceCheckUtils]: 128: Hoare triple {54558#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; {54558#false} is VALID [2022-04-27 15:30:26,602 INFO L290 TraceCheckUtils]: 129: Hoare triple {54558#false} assume 8 == ~blastFlag~0; {54558#false} is VALID [2022-04-27 15:30:26,602 INFO L290 TraceCheckUtils]: 130: Hoare triple {54558#false} assume !false; {54558#false} is VALID [2022-04-27 15:30:26,602 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-04-27 15:30:26,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:30:26,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688532584] [2022-04-27 15:30:26,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688532584] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:30:26,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:30:26,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:30:26,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614427334] [2022-04-27 15:30:26,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:30:26,603 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 131 [2022-04-27 15:30:26,603 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:30:26,603 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:26,670 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:30:26,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:30:26,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:30:26,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:30:26,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:30:26,671 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-27 15:30:32,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:30:32,545 INFO L93 Difference]: Finished difference Result 936 states and 1401 transitions. [2022-04-27 15:30:32,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:30:32,545 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 131 [2022-04-27 15:30:32,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:30:32,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:32,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 508 transitions. [2022-04-27 15:30:32,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:32,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 508 transitions. [2022-04-27 15:30:32,549 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 508 transitions. [2022-04-27 15:30:32,856 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-27 15:30:32,865 INFO L225 Difference]: With dead ends: 936 [2022-04-27 15:30:32,865 INFO L226 Difference]: Without dead ends: 499 [2022-04-27 15:30:32,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:30:32,866 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 64 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-27 15:30:32,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 529 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-04-27 15:30:32,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2022-04-27 15:30:32,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 463. [2022-04-27 15:30:32,872 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:30:32,872 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-27 15:30:32,872 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-27 15:30:32,873 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-27 15:30:32,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:30:32,880 INFO L93 Difference]: Finished difference Result 499 states and 739 transitions. [2022-04-27 15:30:32,880 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 739 transitions. [2022-04-27 15:30:32,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:30:32,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:30:32,882 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-27 15:30:32,882 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-27 15:30:32,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:30:32,890 INFO L93 Difference]: Finished difference Result 499 states and 739 transitions. [2022-04-27 15:30:32,890 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 739 transitions. [2022-04-27 15:30:32,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:30:32,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:30:32,891 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:30:32,891 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:30:32,891 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-27 15:30:32,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 690 transitions. [2022-04-27 15:30:32,916 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 690 transitions. Word has length 131 [2022-04-27 15:30:32,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:30:32,916 INFO L495 AbstractCegarLoop]: Abstraction has 463 states and 690 transitions. [2022-04-27 15:30:32,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:32,916 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 690 transitions. [2022-04-27 15:30:32,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-27 15:30:32,917 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:30:32,917 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:30:32,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-04-27 15:30:32,917 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:30:32,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:30:32,918 INFO L85 PathProgramCache]: Analyzing trace with hash -22008148, now seen corresponding path program 1 times [2022-04-27 15:30:32,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:30:32,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678379901] [2022-04-27 15:30:32,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:30:32,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:30:32,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:30:33,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:30:33,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:30:33,024 INFO L290 TraceCheckUtils]: 0: Hoare triple {57124#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {57117#true} is VALID [2022-04-27 15:30:33,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {57117#true} assume true; {57117#true} is VALID [2022-04-27 15:30:33,024 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {57117#true} {57117#true} #689#return; {57117#true} is VALID [2022-04-27 15:30:33,025 INFO L272 TraceCheckUtils]: 0: Hoare triple {57117#true} call ULTIMATE.init(); {57124#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:30:33,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {57124#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {57117#true} is VALID [2022-04-27 15:30:33,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {57117#true} assume true; {57117#true} is VALID [2022-04-27 15:30:33,025 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57117#true} {57117#true} #689#return; {57117#true} is VALID [2022-04-27 15:30:33,025 INFO L272 TraceCheckUtils]: 4: Hoare triple {57117#true} call #t~ret161 := main(); {57117#true} is VALID [2022-04-27 15:30:33,025 INFO L290 TraceCheckUtils]: 5: Hoare triple {57117#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; {57117#true} is VALID [2022-04-27 15:30:33,025 INFO L290 TraceCheckUtils]: 6: Hoare triple {57117#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {57117#true} is VALID [2022-04-27 15:30:33,025 INFO L272 TraceCheckUtils]: 7: Hoare triple {57117#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {57117#true} is VALID [2022-04-27 15:30:33,025 INFO L290 TraceCheckUtils]: 8: Hoare triple {57117#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); {57117#true} is VALID [2022-04-27 15:30:33,025 INFO L290 TraceCheckUtils]: 9: Hoare triple {57117#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; {57117#true} is VALID [2022-04-27 15:30:33,025 INFO L290 TraceCheckUtils]: 10: Hoare triple {57117#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; {57117#true} is VALID [2022-04-27 15:30:33,025 INFO L290 TraceCheckUtils]: 11: Hoare triple {57117#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {57117#true} is VALID [2022-04-27 15:30:33,025 INFO L290 TraceCheckUtils]: 12: Hoare triple {57117#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {57117#true} is VALID [2022-04-27 15:30:33,025 INFO L290 TraceCheckUtils]: 13: Hoare triple {57117#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {57117#true} is VALID [2022-04-27 15:30:33,025 INFO L290 TraceCheckUtils]: 14: Hoare triple {57117#true} assume !false; {57117#true} is VALID [2022-04-27 15:30:33,025 INFO L290 TraceCheckUtils]: 15: Hoare triple {57117#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); {57117#true} is VALID [2022-04-27 15:30:33,026 INFO L290 TraceCheckUtils]: 16: Hoare triple {57117#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {57117#true} is VALID [2022-04-27 15:30:33,026 INFO L290 TraceCheckUtils]: 17: Hoare triple {57117#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {57117#true} is VALID [2022-04-27 15:30:33,026 INFO L290 TraceCheckUtils]: 18: Hoare triple {57117#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {57117#true} is VALID [2022-04-27 15:30:33,026 INFO L290 TraceCheckUtils]: 19: Hoare triple {57117#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {57117#true} is VALID [2022-04-27 15:30:33,026 INFO L290 TraceCheckUtils]: 20: Hoare triple {57117#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {57117#true} is VALID [2022-04-27 15:30:33,026 INFO L290 TraceCheckUtils]: 21: Hoare triple {57117#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {57117#true} is VALID [2022-04-27 15:30:33,026 INFO L290 TraceCheckUtils]: 22: Hoare triple {57117#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {57117#true} is VALID [2022-04-27 15:30:33,026 INFO L290 TraceCheckUtils]: 23: Hoare triple {57117#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {57117#true} is VALID [2022-04-27 15:30:33,026 INFO L290 TraceCheckUtils]: 24: Hoare triple {57117#true} assume 8464 == #t~mem55;havoc #t~mem55; {57117#true} is VALID [2022-04-27 15:30:33,026 INFO L290 TraceCheckUtils]: 25: Hoare triple {57117#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; {57117#true} is VALID [2022-04-27 15:30:33,026 INFO L290 TraceCheckUtils]: 26: Hoare triple {57117#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {57117#true} is VALID [2022-04-27 15:30:33,026 INFO L290 TraceCheckUtils]: 27: Hoare triple {57117#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); {57117#true} is VALID [2022-04-27 15:30:33,026 INFO L290 TraceCheckUtils]: 28: Hoare triple {57117#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); {57117#true} is VALID [2022-04-27 15:30:33,026 INFO L290 TraceCheckUtils]: 29: Hoare triple {57117#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {57117#true} is VALID [2022-04-27 15:30:33,026 INFO L290 TraceCheckUtils]: 30: Hoare triple {57117#true} ~skip~0 := 0; {57117#true} is VALID [2022-04-27 15:30:33,026 INFO L290 TraceCheckUtils]: 31: Hoare triple {57117#true} assume !false; {57117#true} is VALID [2022-04-27 15:30:33,026 INFO L290 TraceCheckUtils]: 32: Hoare triple {57117#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); {57117#true} is VALID [2022-04-27 15:30:33,027 INFO L290 TraceCheckUtils]: 33: Hoare triple {57117#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {57117#true} is VALID [2022-04-27 15:30:33,027 INFO L290 TraceCheckUtils]: 34: Hoare triple {57117#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {57117#true} is VALID [2022-04-27 15:30:33,027 INFO L290 TraceCheckUtils]: 35: Hoare triple {57117#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {57117#true} is VALID [2022-04-27 15:30:33,027 INFO L290 TraceCheckUtils]: 36: Hoare triple {57117#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {57117#true} is VALID [2022-04-27 15:30:33,027 INFO L290 TraceCheckUtils]: 37: Hoare triple {57117#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {57117#true} is VALID [2022-04-27 15:30:33,027 INFO L290 TraceCheckUtils]: 38: Hoare triple {57117#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {57117#true} is VALID [2022-04-27 15:30:33,027 INFO L290 TraceCheckUtils]: 39: Hoare triple {57117#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {57117#true} is VALID [2022-04-27 15:30:33,027 INFO L290 TraceCheckUtils]: 40: Hoare triple {57117#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {57117#true} is VALID [2022-04-27 15:30:33,027 INFO L290 TraceCheckUtils]: 41: Hoare triple {57117#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {57117#true} is VALID [2022-04-27 15:30:33,027 INFO L290 TraceCheckUtils]: 42: Hoare triple {57117#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {57117#true} is VALID [2022-04-27 15:30:33,027 INFO L290 TraceCheckUtils]: 43: Hoare triple {57117#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {57117#true} is VALID [2022-04-27 15:30:33,027 INFO L290 TraceCheckUtils]: 44: Hoare triple {57117#true} assume 8496 == #t~mem58;havoc #t~mem58; {57117#true} is VALID [2022-04-27 15:30:33,027 INFO L290 TraceCheckUtils]: 45: Hoare triple {57117#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {57117#true} is VALID [2022-04-27 15:30:33,027 INFO L290 TraceCheckUtils]: 46: Hoare triple {57117#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {57117#true} is VALID [2022-04-27 15:30:33,027 INFO L290 TraceCheckUtils]: 47: Hoare triple {57117#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {57117#true} is VALID [2022-04-27 15:30:33,028 INFO L290 TraceCheckUtils]: 48: Hoare triple {57117#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {57122#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:33,029 INFO L290 TraceCheckUtils]: 49: Hoare triple {57122#(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); {57122#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:33,029 INFO L290 TraceCheckUtils]: 50: Hoare triple {57122#(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); {57122#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:33,029 INFO L290 TraceCheckUtils]: 51: Hoare triple {57122#(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; {57122#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:33,030 INFO L290 TraceCheckUtils]: 52: Hoare triple {57122#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {57122#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:33,030 INFO L290 TraceCheckUtils]: 53: Hoare triple {57122#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {57122#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:33,030 INFO L290 TraceCheckUtils]: 54: Hoare triple {57122#(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); {57122#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:33,031 INFO L290 TraceCheckUtils]: 55: Hoare triple {57122#(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); {57122#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:33,031 INFO L290 TraceCheckUtils]: 56: Hoare triple {57122#(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); {57122#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:33,031 INFO L290 TraceCheckUtils]: 57: Hoare triple {57122#(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); {57122#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:33,032 INFO L290 TraceCheckUtils]: 58: Hoare triple {57122#(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); {57122#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:33,032 INFO L290 TraceCheckUtils]: 59: Hoare triple {57122#(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); {57122#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:33,032 INFO L290 TraceCheckUtils]: 60: Hoare triple {57122#(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); {57122#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:33,033 INFO L290 TraceCheckUtils]: 61: Hoare triple {57122#(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); {57122#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:33,033 INFO L290 TraceCheckUtils]: 62: Hoare triple {57122#(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); {57122#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:33,033 INFO L290 TraceCheckUtils]: 63: Hoare triple {57122#(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); {57122#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:33,034 INFO L290 TraceCheckUtils]: 64: Hoare triple {57122#(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); {57122#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:33,034 INFO L290 TraceCheckUtils]: 65: Hoare triple {57122#(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); {57122#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:33,034 INFO L290 TraceCheckUtils]: 66: Hoare triple {57122#(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); {57122#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:33,035 INFO L290 TraceCheckUtils]: 67: Hoare triple {57122#(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); {57122#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:33,035 INFO L290 TraceCheckUtils]: 68: Hoare triple {57122#(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); {57122#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:33,035 INFO L290 TraceCheckUtils]: 69: Hoare triple {57122#(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); {57122#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:33,036 INFO L290 TraceCheckUtils]: 70: Hoare triple {57122#(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); {57122#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:33,036 INFO L290 TraceCheckUtils]: 71: Hoare triple {57122#(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); {57122#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:33,036 INFO L290 TraceCheckUtils]: 72: Hoare triple {57122#(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); {57122#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:33,037 INFO L290 TraceCheckUtils]: 73: Hoare triple {57122#(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); {57122#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:33,037 INFO L290 TraceCheckUtils]: 74: Hoare triple {57122#(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); {57122#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:33,037 INFO L290 TraceCheckUtils]: 75: Hoare triple {57122#(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); {57122#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:33,038 INFO L290 TraceCheckUtils]: 76: Hoare triple {57122#(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); {57122#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:33,038 INFO L290 TraceCheckUtils]: 77: Hoare triple {57122#(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); {57122#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:33,038 INFO L290 TraceCheckUtils]: 78: Hoare triple {57122#(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); {57122#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:33,039 INFO L290 TraceCheckUtils]: 79: Hoare triple {57122#(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); {57122#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:33,039 INFO L290 TraceCheckUtils]: 80: Hoare triple {57122#(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); {57122#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:33,039 INFO L290 TraceCheckUtils]: 81: Hoare triple {57122#(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); {57122#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:33,040 INFO L290 TraceCheckUtils]: 82: Hoare triple {57122#(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); {57122#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:33,040 INFO L290 TraceCheckUtils]: 83: Hoare triple {57122#(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); {57122#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:33,040 INFO L290 TraceCheckUtils]: 84: Hoare triple {57122#(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); {57122#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:33,041 INFO L290 TraceCheckUtils]: 85: Hoare triple {57122#(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); {57122#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:33,041 INFO L290 TraceCheckUtils]: 86: Hoare triple {57122#(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); {57122#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:33,041 INFO L290 TraceCheckUtils]: 87: Hoare triple {57122#(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); {57123#(not (= |ssl3_accept_#t~mem80| 8673))} is VALID [2022-04-27 15:30:33,042 INFO L290 TraceCheckUtils]: 88: Hoare triple {57123#(not (= |ssl3_accept_#t~mem80| 8673))} assume 8673 == #t~mem80;havoc #t~mem80; {57118#false} is VALID [2022-04-27 15:30:33,042 INFO L290 TraceCheckUtils]: 89: Hoare triple {57118#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {57118#false} is VALID [2022-04-27 15:30:33,042 INFO L290 TraceCheckUtils]: 90: Hoare triple {57118#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {57118#false} is VALID [2022-04-27 15:30:33,042 INFO L290 TraceCheckUtils]: 91: Hoare triple {57118#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); {57118#false} is VALID [2022-04-27 15:30:33,042 INFO L290 TraceCheckUtils]: 92: Hoare triple {57118#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; {57118#false} is VALID [2022-04-27 15:30:33,042 INFO L290 TraceCheckUtils]: 93: Hoare triple {57118#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {57118#false} is VALID [2022-04-27 15:30:33,042 INFO L290 TraceCheckUtils]: 94: Hoare triple {57118#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); {57118#false} is VALID [2022-04-27 15:30:33,042 INFO L290 TraceCheckUtils]: 95: Hoare triple {57118#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {57118#false} is VALID [2022-04-27 15:30:33,042 INFO L290 TraceCheckUtils]: 96: Hoare triple {57118#false} ~skip~0 := 0; {57118#false} is VALID [2022-04-27 15:30:33,042 INFO L290 TraceCheckUtils]: 97: Hoare triple {57118#false} assume !false; {57118#false} is VALID [2022-04-27 15:30:33,042 INFO L290 TraceCheckUtils]: 98: Hoare triple {57118#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); {57118#false} is VALID [2022-04-27 15:30:33,042 INFO L290 TraceCheckUtils]: 99: Hoare triple {57118#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {57118#false} is VALID [2022-04-27 15:30:33,042 INFO L290 TraceCheckUtils]: 100: Hoare triple {57118#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {57118#false} is VALID [2022-04-27 15:30:33,043 INFO L290 TraceCheckUtils]: 101: Hoare triple {57118#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {57118#false} is VALID [2022-04-27 15:30:33,043 INFO L290 TraceCheckUtils]: 102: Hoare triple {57118#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {57118#false} is VALID [2022-04-27 15:30:33,043 INFO L290 TraceCheckUtils]: 103: Hoare triple {57118#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {57118#false} is VALID [2022-04-27 15:30:33,043 INFO L290 TraceCheckUtils]: 104: Hoare triple {57118#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {57118#false} is VALID [2022-04-27 15:30:33,043 INFO L290 TraceCheckUtils]: 105: Hoare triple {57118#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {57118#false} is VALID [2022-04-27 15:30:33,043 INFO L290 TraceCheckUtils]: 106: Hoare triple {57118#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {57118#false} is VALID [2022-04-27 15:30:33,043 INFO L290 TraceCheckUtils]: 107: Hoare triple {57118#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {57118#false} is VALID [2022-04-27 15:30:33,043 INFO L290 TraceCheckUtils]: 108: Hoare triple {57118#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {57118#false} is VALID [2022-04-27 15:30:33,043 INFO L290 TraceCheckUtils]: 109: Hoare triple {57118#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {57118#false} is VALID [2022-04-27 15:30:33,043 INFO L290 TraceCheckUtils]: 110: Hoare triple {57118#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {57118#false} is VALID [2022-04-27 15:30:33,043 INFO L290 TraceCheckUtils]: 111: Hoare triple {57118#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {57118#false} is VALID [2022-04-27 15:30:33,043 INFO L290 TraceCheckUtils]: 112: Hoare triple {57118#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {57118#false} is VALID [2022-04-27 15:30:33,043 INFO L290 TraceCheckUtils]: 113: Hoare triple {57118#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {57118#false} is VALID [2022-04-27 15:30:33,043 INFO L290 TraceCheckUtils]: 114: Hoare triple {57118#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {57118#false} is VALID [2022-04-27 15:30:33,043 INFO L290 TraceCheckUtils]: 115: Hoare triple {57118#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {57118#false} is VALID [2022-04-27 15:30:33,043 INFO L290 TraceCheckUtils]: 116: Hoare triple {57118#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {57118#false} is VALID [2022-04-27 15:30:33,043 INFO L290 TraceCheckUtils]: 117: Hoare triple {57118#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {57118#false} is VALID [2022-04-27 15:30:33,044 INFO L290 TraceCheckUtils]: 118: Hoare triple {57118#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {57118#false} is VALID [2022-04-27 15:30:33,044 INFO L290 TraceCheckUtils]: 119: Hoare triple {57118#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {57118#false} is VALID [2022-04-27 15:30:33,044 INFO L290 TraceCheckUtils]: 120: Hoare triple {57118#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {57118#false} is VALID [2022-04-27 15:30:33,044 INFO L290 TraceCheckUtils]: 121: Hoare triple {57118#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {57118#false} is VALID [2022-04-27 15:30:33,044 INFO L290 TraceCheckUtils]: 122: Hoare triple {57118#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {57118#false} is VALID [2022-04-27 15:30:33,044 INFO L290 TraceCheckUtils]: 123: Hoare triple {57118#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {57118#false} is VALID [2022-04-27 15:30:33,044 INFO L290 TraceCheckUtils]: 124: Hoare triple {57118#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {57118#false} is VALID [2022-04-27 15:30:33,044 INFO L290 TraceCheckUtils]: 125: Hoare triple {57118#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {57118#false} is VALID [2022-04-27 15:30:33,044 INFO L290 TraceCheckUtils]: 126: Hoare triple {57118#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {57118#false} is VALID [2022-04-27 15:30:33,044 INFO L290 TraceCheckUtils]: 127: Hoare triple {57118#false} assume 8640 == #t~mem75;havoc #t~mem75; {57118#false} is VALID [2022-04-27 15:30:33,044 INFO L290 TraceCheckUtils]: 128: Hoare triple {57118#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {57118#false} is VALID [2022-04-27 15:30:33,044 INFO L290 TraceCheckUtils]: 129: Hoare triple {57118#false} assume 4 == ~blastFlag~0; {57118#false} is VALID [2022-04-27 15:30:33,044 INFO L290 TraceCheckUtils]: 130: Hoare triple {57118#false} assume !false; {57118#false} is VALID [2022-04-27 15:30:33,045 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-27 15:30:33,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:30:33,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678379901] [2022-04-27 15:30:33,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678379901] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:30:33,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:30:33,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:30:33,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544596891] [2022-04-27 15:30:33,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:30:33,045 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 131 [2022-04-27 15:30:33,046 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:30:33,046 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:33,131 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:30:33,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:30:33,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:30:33,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:30:33,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:30:33,133 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-27 15:30:37,106 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:30:40,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:30:40,729 INFO L93 Difference]: Finished difference Result 975 states and 1455 transitions. [2022-04-27 15:30:40,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:30:40,729 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 131 [2022-04-27 15:30:40,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:30:40,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:40,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 582 transitions. [2022-04-27 15:30:40,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:40,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 582 transitions. [2022-04-27 15:30:40,733 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 582 transitions. [2022-04-27 15:30:41,123 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 582 edges. 582 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:30:41,133 INFO L225 Difference]: With dead ends: 975 [2022-04-27 15:30:41,133 INFO L226 Difference]: Without dead ends: 536 [2022-04-27 15:30:41,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:30:41,134 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 108 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-27 15:30:41,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 360 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-04-27 15:30:41,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2022-04-27 15:30:41,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 465. [2022-04-27 15:30:41,140 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:30:41,140 INFO L82 GeneralOperation]: Start isEquivalent. First operand 536 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-27 15:30:41,140 INFO L74 IsIncluded]: Start isIncluded. First operand 536 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-27 15:30:41,141 INFO L87 Difference]: Start difference. First operand 536 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-27 15:30:41,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:30:41,149 INFO L93 Difference]: Finished difference Result 536 states and 791 transitions. [2022-04-27 15:30:41,149 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 791 transitions. [2022-04-27 15:30:41,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:30:41,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:30:41,150 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 536 states. [2022-04-27 15:30:41,150 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 536 states. [2022-04-27 15:30:41,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:30:41,159 INFO L93 Difference]: Finished difference Result 536 states and 791 transitions. [2022-04-27 15:30:41,159 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 791 transitions. [2022-04-27 15:30:41,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:30:41,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:30:41,160 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:30:41,160 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:30:41,160 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-27 15:30:41,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 693 transitions. [2022-04-27 15:30:41,167 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 693 transitions. Word has length 131 [2022-04-27 15:30:41,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:30:41,168 INFO L495 AbstractCegarLoop]: Abstraction has 465 states and 693 transitions. [2022-04-27 15:30:41,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:41,168 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 693 transitions. [2022-04-27 15:30:41,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-27 15:30:41,168 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:30:41,169 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:30:41,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-04-27 15:30:41,169 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:30:41,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:30:41,169 INFO L85 PathProgramCache]: Analyzing trace with hash 141167833, now seen corresponding path program 1 times [2022-04-27 15:30:41,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:30:41,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375627522] [2022-04-27 15:30:41,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:30:41,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:30:41,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:30:41,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:30:41,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:30:41,301 INFO L290 TraceCheckUtils]: 0: Hoare triple {59809#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {59803#true} is VALID [2022-04-27 15:30:41,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {59803#true} assume true; {59803#true} is VALID [2022-04-27 15:30:41,302 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {59803#true} {59803#true} #689#return; {59803#true} is VALID [2022-04-27 15:30:41,302 INFO L272 TraceCheckUtils]: 0: Hoare triple {59803#true} call ULTIMATE.init(); {59809#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:30:41,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {59809#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {59803#true} is VALID [2022-04-27 15:30:41,302 INFO L290 TraceCheckUtils]: 2: Hoare triple {59803#true} assume true; {59803#true} is VALID [2022-04-27 15:30:41,302 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59803#true} {59803#true} #689#return; {59803#true} is VALID [2022-04-27 15:30:41,303 INFO L272 TraceCheckUtils]: 4: Hoare triple {59803#true} call #t~ret161 := main(); {59803#true} is VALID [2022-04-27 15:30:41,303 INFO L290 TraceCheckUtils]: 5: Hoare triple {59803#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; {59803#true} is VALID [2022-04-27 15:30:41,303 INFO L290 TraceCheckUtils]: 6: Hoare triple {59803#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {59803#true} is VALID [2022-04-27 15:30:41,303 INFO L272 TraceCheckUtils]: 7: Hoare triple {59803#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {59803#true} is VALID [2022-04-27 15:30:41,303 INFO L290 TraceCheckUtils]: 8: Hoare triple {59803#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); {59803#true} is VALID [2022-04-27 15:30:41,303 INFO L290 TraceCheckUtils]: 9: Hoare triple {59803#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; {59803#true} is VALID [2022-04-27 15:30:41,303 INFO L290 TraceCheckUtils]: 10: Hoare triple {59803#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; {59803#true} is VALID [2022-04-27 15:30:41,303 INFO L290 TraceCheckUtils]: 11: Hoare triple {59803#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {59803#true} is VALID [2022-04-27 15:30:41,303 INFO L290 TraceCheckUtils]: 12: Hoare triple {59803#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {59803#true} is VALID [2022-04-27 15:30:41,303 INFO L290 TraceCheckUtils]: 13: Hoare triple {59803#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {59803#true} is VALID [2022-04-27 15:30:41,303 INFO L290 TraceCheckUtils]: 14: Hoare triple {59803#true} assume !false; {59803#true} is VALID [2022-04-27 15:30:41,303 INFO L290 TraceCheckUtils]: 15: Hoare triple {59803#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); {59803#true} is VALID [2022-04-27 15:30:41,303 INFO L290 TraceCheckUtils]: 16: Hoare triple {59803#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {59803#true} is VALID [2022-04-27 15:30:41,303 INFO L290 TraceCheckUtils]: 17: Hoare triple {59803#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {59803#true} is VALID [2022-04-27 15:30:41,303 INFO L290 TraceCheckUtils]: 18: Hoare triple {59803#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {59803#true} is VALID [2022-04-27 15:30:41,303 INFO L290 TraceCheckUtils]: 19: Hoare triple {59803#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {59803#true} is VALID [2022-04-27 15:30:41,303 INFO L290 TraceCheckUtils]: 20: Hoare triple {59803#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {59803#true} is VALID [2022-04-27 15:30:41,304 INFO L290 TraceCheckUtils]: 21: Hoare triple {59803#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {59803#true} is VALID [2022-04-27 15:30:41,304 INFO L290 TraceCheckUtils]: 22: Hoare triple {59803#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {59803#true} is VALID [2022-04-27 15:30:41,304 INFO L290 TraceCheckUtils]: 23: Hoare triple {59803#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {59803#true} is VALID [2022-04-27 15:30:41,304 INFO L290 TraceCheckUtils]: 24: Hoare triple {59803#true} assume 8464 == #t~mem55;havoc #t~mem55; {59803#true} is VALID [2022-04-27 15:30:41,304 INFO L290 TraceCheckUtils]: 25: Hoare triple {59803#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; {59803#true} is VALID [2022-04-27 15:30:41,304 INFO L290 TraceCheckUtils]: 26: Hoare triple {59803#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {59803#true} is VALID [2022-04-27 15:30:41,304 INFO L290 TraceCheckUtils]: 27: Hoare triple {59803#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); {59803#true} is VALID [2022-04-27 15:30:41,304 INFO L290 TraceCheckUtils]: 28: Hoare triple {59803#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); {59803#true} is VALID [2022-04-27 15:30:41,304 INFO L290 TraceCheckUtils]: 29: Hoare triple {59803#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {59803#true} is VALID [2022-04-27 15:30:41,304 INFO L290 TraceCheckUtils]: 30: Hoare triple {59803#true} ~skip~0 := 0; {59803#true} is VALID [2022-04-27 15:30:41,304 INFO L290 TraceCheckUtils]: 31: Hoare triple {59803#true} assume !false; {59803#true} is VALID [2022-04-27 15:30:41,304 INFO L290 TraceCheckUtils]: 32: Hoare triple {59803#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); {59803#true} is VALID [2022-04-27 15:30:41,304 INFO L290 TraceCheckUtils]: 33: Hoare triple {59803#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {59803#true} is VALID [2022-04-27 15:30:41,304 INFO L290 TraceCheckUtils]: 34: Hoare triple {59803#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {59803#true} is VALID [2022-04-27 15:30:41,304 INFO L290 TraceCheckUtils]: 35: Hoare triple {59803#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {59803#true} is VALID [2022-04-27 15:30:41,304 INFO L290 TraceCheckUtils]: 36: Hoare triple {59803#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {59803#true} is VALID [2022-04-27 15:30:41,304 INFO L290 TraceCheckUtils]: 37: Hoare triple {59803#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {59803#true} is VALID [2022-04-27 15:30:41,305 INFO L290 TraceCheckUtils]: 38: Hoare triple {59803#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {59803#true} is VALID [2022-04-27 15:30:41,305 INFO L290 TraceCheckUtils]: 39: Hoare triple {59803#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {59803#true} is VALID [2022-04-27 15:30:41,305 INFO L290 TraceCheckUtils]: 40: Hoare triple {59803#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {59803#true} is VALID [2022-04-27 15:30:41,305 INFO L290 TraceCheckUtils]: 41: Hoare triple {59803#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {59803#true} is VALID [2022-04-27 15:30:41,305 INFO L290 TraceCheckUtils]: 42: Hoare triple {59803#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {59803#true} is VALID [2022-04-27 15:30:41,305 INFO L290 TraceCheckUtils]: 43: Hoare triple {59803#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {59803#true} is VALID [2022-04-27 15:30:41,305 INFO L290 TraceCheckUtils]: 44: Hoare triple {59803#true} assume 8496 == #t~mem58;havoc #t~mem58; {59803#true} is VALID [2022-04-27 15:30:41,305 INFO L290 TraceCheckUtils]: 45: Hoare triple {59803#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {59803#true} is VALID [2022-04-27 15:30:41,305 INFO L290 TraceCheckUtils]: 46: Hoare triple {59803#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,305 INFO L290 TraceCheckUtils]: 47: Hoare triple {59808#(= 2 ssl3_accept_~blastFlag~0)} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,306 INFO L290 TraceCheckUtils]: 48: Hoare triple {59808#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,306 INFO L290 TraceCheckUtils]: 49: Hoare triple {59808#(= 2 ssl3_accept_~blastFlag~0)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,306 INFO L290 TraceCheckUtils]: 50: Hoare triple {59808#(= 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); {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,306 INFO L290 TraceCheckUtils]: 51: Hoare triple {59808#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,307 INFO L290 TraceCheckUtils]: 52: Hoare triple {59808#(= 2 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,307 INFO L290 TraceCheckUtils]: 53: Hoare triple {59808#(= 2 ssl3_accept_~blastFlag~0)} assume !false; {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,307 INFO L290 TraceCheckUtils]: 54: Hoare triple {59808#(= 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); {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,307 INFO L290 TraceCheckUtils]: 55: Hoare triple {59808#(= 2 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,307 INFO L290 TraceCheckUtils]: 56: Hoare triple {59808#(= 2 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,308 INFO L290 TraceCheckUtils]: 57: Hoare triple {59808#(= 2 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,308 INFO L290 TraceCheckUtils]: 58: Hoare triple {59808#(= 2 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,308 INFO L290 TraceCheckUtils]: 59: Hoare triple {59808#(= 2 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,308 INFO L290 TraceCheckUtils]: 60: Hoare triple {59808#(= 2 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,309 INFO L290 TraceCheckUtils]: 61: Hoare triple {59808#(= 2 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,309 INFO L290 TraceCheckUtils]: 62: Hoare triple {59808#(= 2 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,309 INFO L290 TraceCheckUtils]: 63: Hoare triple {59808#(= 2 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,309 INFO L290 TraceCheckUtils]: 64: Hoare triple {59808#(= 2 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,310 INFO L290 TraceCheckUtils]: 65: Hoare triple {59808#(= 2 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,310 INFO L290 TraceCheckUtils]: 66: Hoare triple {59808#(= 2 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,310 INFO L290 TraceCheckUtils]: 67: Hoare triple {59808#(= 2 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,310 INFO L290 TraceCheckUtils]: 68: Hoare triple {59808#(= 2 ssl3_accept_~blastFlag~0)} assume 8512 == #t~mem60;havoc #t~mem60; {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,310 INFO L290 TraceCheckUtils]: 69: Hoare triple {59808#(= 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); {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,311 INFO L290 TraceCheckUtils]: 70: Hoare triple {59808#(= 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; {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,311 INFO L290 TraceCheckUtils]: 71: Hoare triple {59808#(= 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); {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,311 INFO L290 TraceCheckUtils]: 72: Hoare triple {59808#(= 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); {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,317 INFO L290 TraceCheckUtils]: 73: Hoare triple {59808#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,318 INFO L290 TraceCheckUtils]: 74: Hoare triple {59808#(= 2 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,318 INFO L290 TraceCheckUtils]: 75: Hoare triple {59808#(= 2 ssl3_accept_~blastFlag~0)} assume !false; {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,318 INFO L290 TraceCheckUtils]: 76: Hoare triple {59808#(= 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); {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,319 INFO L290 TraceCheckUtils]: 77: Hoare triple {59808#(= 2 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,319 INFO L290 TraceCheckUtils]: 78: Hoare triple {59808#(= 2 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,319 INFO L290 TraceCheckUtils]: 79: Hoare triple {59808#(= 2 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,319 INFO L290 TraceCheckUtils]: 80: Hoare triple {59808#(= 2 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,319 INFO L290 TraceCheckUtils]: 81: Hoare triple {59808#(= 2 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,320 INFO L290 TraceCheckUtils]: 82: Hoare triple {59808#(= 2 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,320 INFO L290 TraceCheckUtils]: 83: Hoare triple {59808#(= 2 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,320 INFO L290 TraceCheckUtils]: 84: Hoare triple {59808#(= 2 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,320 INFO L290 TraceCheckUtils]: 85: Hoare triple {59808#(= 2 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,321 INFO L290 TraceCheckUtils]: 86: Hoare triple {59808#(= 2 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,321 INFO L290 TraceCheckUtils]: 87: Hoare triple {59808#(= 2 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,321 INFO L290 TraceCheckUtils]: 88: Hoare triple {59808#(= 2 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,321 INFO L290 TraceCheckUtils]: 89: Hoare triple {59808#(= 2 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,322 INFO L290 TraceCheckUtils]: 90: Hoare triple {59808#(= 2 ssl3_accept_~blastFlag~0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,322 INFO L290 TraceCheckUtils]: 91: Hoare triple {59808#(= 2 ssl3_accept_~blastFlag~0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,322 INFO L290 TraceCheckUtils]: 92: Hoare triple {59808#(= 2 ssl3_accept_~blastFlag~0)} assume 8528 == #t~mem62;havoc #t~mem62; {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,322 INFO L290 TraceCheckUtils]: 93: Hoare triple {59808#(= 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); {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,322 INFO L290 TraceCheckUtils]: 94: Hoare triple {59808#(= 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; {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,323 INFO L290 TraceCheckUtils]: 95: Hoare triple {59808#(= 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); {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,323 INFO L290 TraceCheckUtils]: 96: Hoare triple {59808#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,323 INFO L290 TraceCheckUtils]: 97: Hoare triple {59808#(= 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); {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,323 INFO L290 TraceCheckUtils]: 98: Hoare triple {59808#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,324 INFO L290 TraceCheckUtils]: 99: Hoare triple {59808#(= 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); {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,324 INFO L290 TraceCheckUtils]: 100: Hoare triple {59808#(= 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); {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,324 INFO L290 TraceCheckUtils]: 101: Hoare triple {59808#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,324 INFO L290 TraceCheckUtils]: 102: Hoare triple {59808#(= 2 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,325 INFO L290 TraceCheckUtils]: 103: Hoare triple {59808#(= 2 ssl3_accept_~blastFlag~0)} assume !false; {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,325 INFO L290 TraceCheckUtils]: 104: Hoare triple {59808#(= 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); {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,325 INFO L290 TraceCheckUtils]: 105: Hoare triple {59808#(= 2 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,325 INFO L290 TraceCheckUtils]: 106: Hoare triple {59808#(= 2 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,325 INFO L290 TraceCheckUtils]: 107: Hoare triple {59808#(= 2 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,326 INFO L290 TraceCheckUtils]: 108: Hoare triple {59808#(= 2 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,326 INFO L290 TraceCheckUtils]: 109: Hoare triple {59808#(= 2 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,326 INFO L290 TraceCheckUtils]: 110: Hoare triple {59808#(= 2 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,326 INFO L290 TraceCheckUtils]: 111: Hoare triple {59808#(= 2 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,327 INFO L290 TraceCheckUtils]: 112: Hoare triple {59808#(= 2 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,327 INFO L290 TraceCheckUtils]: 113: Hoare triple {59808#(= 2 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,327 INFO L290 TraceCheckUtils]: 114: Hoare triple {59808#(= 2 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,327 INFO L290 TraceCheckUtils]: 115: Hoare triple {59808#(= 2 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,328 INFO L290 TraceCheckUtils]: 116: Hoare triple {59808#(= 2 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,328 INFO L290 TraceCheckUtils]: 117: Hoare triple {59808#(= 2 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,328 INFO L290 TraceCheckUtils]: 118: Hoare triple {59808#(= 2 ssl3_accept_~blastFlag~0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,328 INFO L290 TraceCheckUtils]: 119: Hoare triple {59808#(= 2 ssl3_accept_~blastFlag~0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,328 INFO L290 TraceCheckUtils]: 120: Hoare triple {59808#(= 2 ssl3_accept_~blastFlag~0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,329 INFO L290 TraceCheckUtils]: 121: Hoare triple {59808#(= 2 ssl3_accept_~blastFlag~0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,329 INFO L290 TraceCheckUtils]: 122: Hoare triple {59808#(= 2 ssl3_accept_~blastFlag~0)} assume 8544 == #t~mem64;havoc #t~mem64; {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,329 INFO L290 TraceCheckUtils]: 123: Hoare triple {59808#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,329 INFO L290 TraceCheckUtils]: 124: Hoare triple {59808#(= 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); {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,330 INFO L290 TraceCheckUtils]: 125: Hoare triple {59808#(= 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; {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,330 INFO L290 TraceCheckUtils]: 126: Hoare triple {59808#(= 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); {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,330 INFO L290 TraceCheckUtils]: 127: Hoare triple {59808#(= 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; {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,330 INFO L290 TraceCheckUtils]: 128: Hoare triple {59808#(= 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; {59808#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:30:41,331 INFO L290 TraceCheckUtils]: 129: Hoare triple {59808#(= 2 ssl3_accept_~blastFlag~0)} assume 8 == ~blastFlag~0; {59804#false} is VALID [2022-04-27 15:30:41,331 INFO L290 TraceCheckUtils]: 130: Hoare triple {59804#false} assume !false; {59804#false} is VALID [2022-04-27 15:30:41,331 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-04-27 15:30:41,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:30:41,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375627522] [2022-04-27 15:30:41,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375627522] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:30:41,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:30:41,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:30:41,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320977635] [2022-04-27 15:30:41,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:30:41,332 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 131 [2022-04-27 15:30:41,332 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:30:41,332 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:41,402 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:30:41,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:30:41,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:30:41,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:30:41,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:30:41,403 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-27 15:30:44,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:30:44,054 INFO L93 Difference]: Finished difference Result 1293 states and 1945 transitions. [2022-04-27 15:30:44,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:30:44,054 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 131 [2022-04-27 15:30:44,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:30:44,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:44,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 599 transitions. [2022-04-27 15:30:44,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:44,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 599 transitions. [2022-04-27 15:30:44,058 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 599 transitions. [2022-04-27 15:30:44,451 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 599 edges. 599 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:30:44,475 INFO L225 Difference]: With dead ends: 1293 [2022-04-27 15:30:44,475 INFO L226 Difference]: Without dead ends: 854 [2022-04-27 15:30:44,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:30:44,476 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 134 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:30:44,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 441 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-27 15:30:44,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2022-04-27 15:30:44,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 854. [2022-04-27 15:30:44,485 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:30:44,488 INFO L82 GeneralOperation]: Start isEquivalent. First operand 854 states. Second operand has 854 states, 849 states have (on average 1.4958775029446407) internal successors, (1270), 849 states have internal predecessors, (1270), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:44,488 INFO L74 IsIncluded]: Start isIncluded. First operand 854 states. Second operand has 854 states, 849 states have (on average 1.4958775029446407) internal successors, (1270), 849 states have internal predecessors, (1270), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:44,489 INFO L87 Difference]: Start difference. First operand 854 states. Second operand has 854 states, 849 states have (on average 1.4958775029446407) internal successors, (1270), 849 states have internal predecessors, (1270), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:44,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:30:44,509 INFO L93 Difference]: Finished difference Result 854 states and 1274 transitions. [2022-04-27 15:30:44,509 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1274 transitions. [2022-04-27 15:30:44,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:30:44,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:30:44,510 INFO L74 IsIncluded]: Start isIncluded. First operand has 854 states, 849 states have (on average 1.4958775029446407) internal successors, (1270), 849 states have internal predecessors, (1270), 3 states have call successors, (3), 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 854 states. [2022-04-27 15:30:44,511 INFO L87 Difference]: Start difference. First operand has 854 states, 849 states have (on average 1.4958775029446407) internal successors, (1270), 849 states have internal predecessors, (1270), 3 states have call successors, (3), 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 854 states. [2022-04-27 15:30:44,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:30:44,531 INFO L93 Difference]: Finished difference Result 854 states and 1274 transitions. [2022-04-27 15:30:44,531 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1274 transitions. [2022-04-27 15:30:44,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:30:44,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:30:44,532 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:30:44,532 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:30:44,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 854 states, 849 states have (on average 1.4958775029446407) internal successors, (1270), 849 states have internal predecessors, (1270), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:44,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1274 transitions. [2022-04-27 15:30:44,554 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1274 transitions. Word has length 131 [2022-04-27 15:30:44,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:30:44,554 INFO L495 AbstractCegarLoop]: Abstraction has 854 states and 1274 transitions. [2022-04-27 15:30:44,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:44,554 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1274 transitions. [2022-04-27 15:30:44,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-27 15:30:44,555 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:30:44,555 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:30:44,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-04-27 15:30:44,556 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:30:44,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:30:44,556 INFO L85 PathProgramCache]: Analyzing trace with hash 2017650651, now seen corresponding path program 1 times [2022-04-27 15:30:44,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:30:44,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164755406] [2022-04-27 15:30:44,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:30:44,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:30:44,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:30:44,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:30:44,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:30:44,668 INFO L290 TraceCheckUtils]: 0: Hoare triple {63896#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {63890#true} is VALID [2022-04-27 15:30:44,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {63890#true} assume true; {63890#true} is VALID [2022-04-27 15:30:44,668 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {63890#true} {63890#true} #689#return; {63890#true} is VALID [2022-04-27 15:30:44,669 INFO L272 TraceCheckUtils]: 0: Hoare triple {63890#true} call ULTIMATE.init(); {63896#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:30:44,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {63896#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {63890#true} is VALID [2022-04-27 15:30:44,669 INFO L290 TraceCheckUtils]: 2: Hoare triple {63890#true} assume true; {63890#true} is VALID [2022-04-27 15:30:44,669 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63890#true} {63890#true} #689#return; {63890#true} is VALID [2022-04-27 15:30:44,669 INFO L272 TraceCheckUtils]: 4: Hoare triple {63890#true} call #t~ret161 := main(); {63890#true} is VALID [2022-04-27 15:30:44,669 INFO L290 TraceCheckUtils]: 5: Hoare triple {63890#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; {63890#true} is VALID [2022-04-27 15:30:44,669 INFO L290 TraceCheckUtils]: 6: Hoare triple {63890#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {63890#true} is VALID [2022-04-27 15:30:44,669 INFO L272 TraceCheckUtils]: 7: Hoare triple {63890#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {63890#true} is VALID [2022-04-27 15:30:44,669 INFO L290 TraceCheckUtils]: 8: Hoare triple {63890#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); {63890#true} is VALID [2022-04-27 15:30:44,669 INFO L290 TraceCheckUtils]: 9: Hoare triple {63890#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; {63890#true} is VALID [2022-04-27 15:30:44,669 INFO L290 TraceCheckUtils]: 10: Hoare triple {63890#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; {63890#true} is VALID [2022-04-27 15:30:44,670 INFO L290 TraceCheckUtils]: 11: Hoare triple {63890#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {63890#true} is VALID [2022-04-27 15:30:44,670 INFO L290 TraceCheckUtils]: 12: Hoare triple {63890#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {63890#true} is VALID [2022-04-27 15:30:44,670 INFO L290 TraceCheckUtils]: 13: Hoare triple {63890#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {63890#true} is VALID [2022-04-27 15:30:44,670 INFO L290 TraceCheckUtils]: 14: Hoare triple {63890#true} assume !false; {63890#true} is VALID [2022-04-27 15:30:44,670 INFO L290 TraceCheckUtils]: 15: Hoare triple {63890#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); {63890#true} is VALID [2022-04-27 15:30:44,670 INFO L290 TraceCheckUtils]: 16: Hoare triple {63890#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {63890#true} is VALID [2022-04-27 15:30:44,670 INFO L290 TraceCheckUtils]: 17: Hoare triple {63890#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {63890#true} is VALID [2022-04-27 15:30:44,670 INFO L290 TraceCheckUtils]: 18: Hoare triple {63890#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {63890#true} is VALID [2022-04-27 15:30:44,670 INFO L290 TraceCheckUtils]: 19: Hoare triple {63890#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {63890#true} is VALID [2022-04-27 15:30:44,670 INFO L290 TraceCheckUtils]: 20: Hoare triple {63890#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {63890#true} is VALID [2022-04-27 15:30:44,670 INFO L290 TraceCheckUtils]: 21: Hoare triple {63890#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {63890#true} is VALID [2022-04-27 15:30:44,670 INFO L290 TraceCheckUtils]: 22: Hoare triple {63890#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {63890#true} is VALID [2022-04-27 15:30:44,670 INFO L290 TraceCheckUtils]: 23: Hoare triple {63890#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {63890#true} is VALID [2022-04-27 15:30:44,670 INFO L290 TraceCheckUtils]: 24: Hoare triple {63890#true} assume 8464 == #t~mem55;havoc #t~mem55; {63890#true} is VALID [2022-04-27 15:30:44,670 INFO L290 TraceCheckUtils]: 25: Hoare triple {63890#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; {63890#true} is VALID [2022-04-27 15:30:44,671 INFO L290 TraceCheckUtils]: 26: Hoare triple {63890#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {63895#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:30:44,671 INFO L290 TraceCheckUtils]: 27: Hoare triple {63895#(= 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); {63895#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:30:44,671 INFO L290 TraceCheckUtils]: 28: Hoare triple {63895#(= 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); {63895#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:30:44,671 INFO L290 TraceCheckUtils]: 29: Hoare triple {63895#(= ssl3_accept_~blastFlag~0 1)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {63895#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:30:44,672 INFO L290 TraceCheckUtils]: 30: Hoare triple {63895#(= ssl3_accept_~blastFlag~0 1)} ~skip~0 := 0; {63895#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:30:44,672 INFO L290 TraceCheckUtils]: 31: Hoare triple {63895#(= ssl3_accept_~blastFlag~0 1)} assume !false; {63895#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:30:44,672 INFO L290 TraceCheckUtils]: 32: Hoare triple {63895#(= 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); {63895#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:30:44,672 INFO L290 TraceCheckUtils]: 33: Hoare triple {63895#(= ssl3_accept_~blastFlag~0 1)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {63895#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:30:44,672 INFO L290 TraceCheckUtils]: 34: Hoare triple {63895#(= ssl3_accept_~blastFlag~0 1)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {63895#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:30:44,673 INFO L290 TraceCheckUtils]: 35: Hoare triple {63895#(= ssl3_accept_~blastFlag~0 1)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {63895#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:30:44,673 INFO L290 TraceCheckUtils]: 36: Hoare triple {63895#(= ssl3_accept_~blastFlag~0 1)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {63895#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:30:44,673 INFO L290 TraceCheckUtils]: 37: Hoare triple {63895#(= ssl3_accept_~blastFlag~0 1)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {63895#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:30:44,673 INFO L290 TraceCheckUtils]: 38: Hoare triple {63895#(= ssl3_accept_~blastFlag~0 1)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {63895#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:30:44,673 INFO L290 TraceCheckUtils]: 39: Hoare triple {63895#(= ssl3_accept_~blastFlag~0 1)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {63895#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:30:44,674 INFO L290 TraceCheckUtils]: 40: Hoare triple {63895#(= ssl3_accept_~blastFlag~0 1)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {63895#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:30:44,674 INFO L290 TraceCheckUtils]: 41: Hoare triple {63895#(= ssl3_accept_~blastFlag~0 1)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {63895#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:30:44,674 INFO L290 TraceCheckUtils]: 42: Hoare triple {63895#(= ssl3_accept_~blastFlag~0 1)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {63895#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:30:44,674 INFO L290 TraceCheckUtils]: 43: Hoare triple {63895#(= ssl3_accept_~blastFlag~0 1)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {63895#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:30:44,675 INFO L290 TraceCheckUtils]: 44: Hoare triple {63895#(= ssl3_accept_~blastFlag~0 1)} assume 8496 == #t~mem58;havoc #t~mem58; {63895#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:30:44,675 INFO L290 TraceCheckUtils]: 45: Hoare triple {63895#(= ssl3_accept_~blastFlag~0 1)} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {63895#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:30:44,675 INFO L290 TraceCheckUtils]: 46: Hoare triple {63895#(= ssl3_accept_~blastFlag~0 1)} assume !(1 == ~blastFlag~0); {63891#false} is VALID [2022-04-27 15:30:44,675 INFO L290 TraceCheckUtils]: 47: Hoare triple {63891#false} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {63891#false} is VALID [2022-04-27 15:30:44,675 INFO L290 TraceCheckUtils]: 48: Hoare triple {63891#false} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {63891#false} is VALID [2022-04-27 15:30:44,675 INFO L290 TraceCheckUtils]: 49: Hoare triple {63891#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {63891#false} is VALID [2022-04-27 15:30:44,675 INFO L290 TraceCheckUtils]: 50: Hoare triple {63891#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); {63891#false} is VALID [2022-04-27 15:30:44,675 INFO L290 TraceCheckUtils]: 51: Hoare triple {63891#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {63891#false} is VALID [2022-04-27 15:30:44,675 INFO L290 TraceCheckUtils]: 52: Hoare triple {63891#false} ~skip~0 := 0; {63891#false} is VALID [2022-04-27 15:30:44,675 INFO L290 TraceCheckUtils]: 53: Hoare triple {63891#false} assume !false; {63891#false} is VALID [2022-04-27 15:30:44,676 INFO L290 TraceCheckUtils]: 54: Hoare triple {63891#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); {63891#false} is VALID [2022-04-27 15:30:44,676 INFO L290 TraceCheckUtils]: 55: Hoare triple {63891#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {63891#false} is VALID [2022-04-27 15:30:44,676 INFO L290 TraceCheckUtils]: 56: Hoare triple {63891#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {63891#false} is VALID [2022-04-27 15:30:44,676 INFO L290 TraceCheckUtils]: 57: Hoare triple {63891#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {63891#false} is VALID [2022-04-27 15:30:44,676 INFO L290 TraceCheckUtils]: 58: Hoare triple {63891#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {63891#false} is VALID [2022-04-27 15:30:44,676 INFO L290 TraceCheckUtils]: 59: Hoare triple {63891#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {63891#false} is VALID [2022-04-27 15:30:44,676 INFO L290 TraceCheckUtils]: 60: Hoare triple {63891#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {63891#false} is VALID [2022-04-27 15:30:44,676 INFO L290 TraceCheckUtils]: 61: Hoare triple {63891#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {63891#false} is VALID [2022-04-27 15:30:44,676 INFO L290 TraceCheckUtils]: 62: Hoare triple {63891#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {63891#false} is VALID [2022-04-27 15:30:44,676 INFO L290 TraceCheckUtils]: 63: Hoare triple {63891#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {63891#false} is VALID [2022-04-27 15:30:44,676 INFO L290 TraceCheckUtils]: 64: Hoare triple {63891#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {63891#false} is VALID [2022-04-27 15:30:44,676 INFO L290 TraceCheckUtils]: 65: Hoare triple {63891#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {63891#false} is VALID [2022-04-27 15:30:44,676 INFO L290 TraceCheckUtils]: 66: Hoare triple {63891#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {63891#false} is VALID [2022-04-27 15:30:44,676 INFO L290 TraceCheckUtils]: 67: Hoare triple {63891#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {63891#false} is VALID [2022-04-27 15:30:44,676 INFO L290 TraceCheckUtils]: 68: Hoare triple {63891#false} assume 8512 == #t~mem60;havoc #t~mem60; {63891#false} is VALID [2022-04-27 15:30:44,676 INFO L290 TraceCheckUtils]: 69: Hoare triple {63891#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); {63891#false} is VALID [2022-04-27 15:30:44,676 INFO L290 TraceCheckUtils]: 70: Hoare triple {63891#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; {63891#false} is VALID [2022-04-27 15:30:44,677 INFO L290 TraceCheckUtils]: 71: Hoare triple {63891#false} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {63891#false} is VALID [2022-04-27 15:30:44,677 INFO L290 TraceCheckUtils]: 72: Hoare triple {63891#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); {63891#false} is VALID [2022-04-27 15:30:44,677 INFO L290 TraceCheckUtils]: 73: Hoare triple {63891#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {63891#false} is VALID [2022-04-27 15:30:44,677 INFO L290 TraceCheckUtils]: 74: Hoare triple {63891#false} ~skip~0 := 0; {63891#false} is VALID [2022-04-27 15:30:44,677 INFO L290 TraceCheckUtils]: 75: Hoare triple {63891#false} assume !false; {63891#false} is VALID [2022-04-27 15:30:44,677 INFO L290 TraceCheckUtils]: 76: Hoare triple {63891#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); {63891#false} is VALID [2022-04-27 15:30:44,677 INFO L290 TraceCheckUtils]: 77: Hoare triple {63891#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {63891#false} is VALID [2022-04-27 15:30:44,677 INFO L290 TraceCheckUtils]: 78: Hoare triple {63891#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {63891#false} is VALID [2022-04-27 15:30:44,677 INFO L290 TraceCheckUtils]: 79: Hoare triple {63891#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {63891#false} is VALID [2022-04-27 15:30:44,677 INFO L290 TraceCheckUtils]: 80: Hoare triple {63891#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {63891#false} is VALID [2022-04-27 15:30:44,677 INFO L290 TraceCheckUtils]: 81: Hoare triple {63891#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {63891#false} is VALID [2022-04-27 15:30:44,677 INFO L290 TraceCheckUtils]: 82: Hoare triple {63891#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {63891#false} is VALID [2022-04-27 15:30:44,677 INFO L290 TraceCheckUtils]: 83: Hoare triple {63891#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {63891#false} is VALID [2022-04-27 15:30:44,677 INFO L290 TraceCheckUtils]: 84: Hoare triple {63891#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {63891#false} is VALID [2022-04-27 15:30:44,677 INFO L290 TraceCheckUtils]: 85: Hoare triple {63891#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {63891#false} is VALID [2022-04-27 15:30:44,677 INFO L290 TraceCheckUtils]: 86: Hoare triple {63891#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {63891#false} is VALID [2022-04-27 15:30:44,677 INFO L290 TraceCheckUtils]: 87: Hoare triple {63891#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {63891#false} is VALID [2022-04-27 15:30:44,677 INFO L290 TraceCheckUtils]: 88: Hoare triple {63891#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {63891#false} is VALID [2022-04-27 15:30:44,678 INFO L290 TraceCheckUtils]: 89: Hoare triple {63891#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {63891#false} is VALID [2022-04-27 15:30:44,678 INFO L290 TraceCheckUtils]: 90: Hoare triple {63891#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {63891#false} is VALID [2022-04-27 15:30:44,678 INFO L290 TraceCheckUtils]: 91: Hoare triple {63891#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {63891#false} is VALID [2022-04-27 15:30:44,678 INFO L290 TraceCheckUtils]: 92: Hoare triple {63891#false} assume 8528 == #t~mem62;havoc #t~mem62; {63891#false} is VALID [2022-04-27 15:30:44,678 INFO L290 TraceCheckUtils]: 93: Hoare triple {63891#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); {63891#false} is VALID [2022-04-27 15:30:44,678 INFO L290 TraceCheckUtils]: 94: Hoare triple {63891#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; {63891#false} is VALID [2022-04-27 15:30:44,678 INFO L290 TraceCheckUtils]: 95: Hoare triple {63891#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); {63891#false} is VALID [2022-04-27 15:30:44,678 INFO L290 TraceCheckUtils]: 96: Hoare triple {63891#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {63891#false} is VALID [2022-04-27 15:30:44,678 INFO L290 TraceCheckUtils]: 97: Hoare triple {63891#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {63891#false} is VALID [2022-04-27 15:30:44,678 INFO L290 TraceCheckUtils]: 98: Hoare triple {63891#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {63891#false} is VALID [2022-04-27 15:30:44,678 INFO L290 TraceCheckUtils]: 99: Hoare triple {63891#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {63891#false} is VALID [2022-04-27 15:30:44,678 INFO L290 TraceCheckUtils]: 100: Hoare triple {63891#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); {63891#false} is VALID [2022-04-27 15:30:44,678 INFO L290 TraceCheckUtils]: 101: Hoare triple {63891#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {63891#false} is VALID [2022-04-27 15:30:44,678 INFO L290 TraceCheckUtils]: 102: Hoare triple {63891#false} ~skip~0 := 0; {63891#false} is VALID [2022-04-27 15:30:44,678 INFO L290 TraceCheckUtils]: 103: Hoare triple {63891#false} assume !false; {63891#false} is VALID [2022-04-27 15:30:44,678 INFO L290 TraceCheckUtils]: 104: Hoare triple {63891#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); {63891#false} is VALID [2022-04-27 15:30:44,678 INFO L290 TraceCheckUtils]: 105: Hoare triple {63891#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {63891#false} is VALID [2022-04-27 15:30:44,679 INFO L290 TraceCheckUtils]: 106: Hoare triple {63891#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {63891#false} is VALID [2022-04-27 15:30:44,679 INFO L290 TraceCheckUtils]: 107: Hoare triple {63891#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {63891#false} is VALID [2022-04-27 15:30:44,679 INFO L290 TraceCheckUtils]: 108: Hoare triple {63891#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {63891#false} is VALID [2022-04-27 15:30:44,679 INFO L290 TraceCheckUtils]: 109: Hoare triple {63891#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {63891#false} is VALID [2022-04-27 15:30:44,679 INFO L290 TraceCheckUtils]: 110: Hoare triple {63891#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {63891#false} is VALID [2022-04-27 15:30:44,679 INFO L290 TraceCheckUtils]: 111: Hoare triple {63891#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {63891#false} is VALID [2022-04-27 15:30:44,679 INFO L290 TraceCheckUtils]: 112: Hoare triple {63891#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {63891#false} is VALID [2022-04-27 15:30:44,679 INFO L290 TraceCheckUtils]: 113: Hoare triple {63891#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {63891#false} is VALID [2022-04-27 15:30:44,679 INFO L290 TraceCheckUtils]: 114: Hoare triple {63891#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {63891#false} is VALID [2022-04-27 15:30:44,679 INFO L290 TraceCheckUtils]: 115: Hoare triple {63891#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {63891#false} is VALID [2022-04-27 15:30:44,679 INFO L290 TraceCheckUtils]: 116: Hoare triple {63891#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {63891#false} is VALID [2022-04-27 15:30:44,679 INFO L290 TraceCheckUtils]: 117: Hoare triple {63891#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {63891#false} is VALID [2022-04-27 15:30:44,679 INFO L290 TraceCheckUtils]: 118: Hoare triple {63891#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {63891#false} is VALID [2022-04-27 15:30:44,679 INFO L290 TraceCheckUtils]: 119: Hoare triple {63891#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {63891#false} is VALID [2022-04-27 15:30:44,679 INFO L290 TraceCheckUtils]: 120: Hoare triple {63891#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {63891#false} is VALID [2022-04-27 15:30:44,679 INFO L290 TraceCheckUtils]: 121: Hoare triple {63891#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {63891#false} is VALID [2022-04-27 15:30:44,679 INFO L290 TraceCheckUtils]: 122: Hoare triple {63891#false} assume 8544 == #t~mem64;havoc #t~mem64; {63891#false} is VALID [2022-04-27 15:30:44,680 INFO L290 TraceCheckUtils]: 123: Hoare triple {63891#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {63891#false} is VALID [2022-04-27 15:30:44,680 INFO L290 TraceCheckUtils]: 124: Hoare triple {63891#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); {63891#false} is VALID [2022-04-27 15:30:44,680 INFO L290 TraceCheckUtils]: 125: Hoare triple {63891#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {63891#false} is VALID [2022-04-27 15:30:44,680 INFO L290 TraceCheckUtils]: 126: Hoare triple {63891#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); {63891#false} is VALID [2022-04-27 15:30:44,680 INFO L290 TraceCheckUtils]: 127: Hoare triple {63891#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; {63891#false} is VALID [2022-04-27 15:30:44,680 INFO L290 TraceCheckUtils]: 128: Hoare triple {63891#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; {63891#false} is VALID [2022-04-27 15:30:44,680 INFO L290 TraceCheckUtils]: 129: Hoare triple {63891#false} assume 8 == ~blastFlag~0; {63891#false} is VALID [2022-04-27 15:30:44,680 INFO L290 TraceCheckUtils]: 130: Hoare triple {63891#false} assume !false; {63891#false} is VALID [2022-04-27 15:30:44,680 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-04-27 15:30:44,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:30:44,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164755406] [2022-04-27 15:30:44,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164755406] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:30:44,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:30:44,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:30:44,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920429393] [2022-04-27 15:30:44,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:30:44,683 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 131 [2022-04-27 15:30:44,683 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:30:44,683 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:44,739 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:30:44,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:30:44,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:30:44,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:30:44,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:30:44,740 INFO L87 Difference]: Start difference. First operand 854 states and 1274 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:47,036 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-27 15:30:49,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:30:49,456 INFO L93 Difference]: Finished difference Result 1709 states and 2555 transitions. [2022-04-27 15:30:49,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:30:49,456 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 131 [2022-04-27 15:30:49,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:30:49,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:49,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 448 transitions. [2022-04-27 15:30:49,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:49,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 448 transitions. [2022-04-27 15:30:49,459 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 448 transitions. [2022-04-27 15:30:49,697 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 448 edges. 448 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:30:49,722 INFO L225 Difference]: With dead ends: 1709 [2022-04-27 15:30:49,722 INFO L226 Difference]: Without dead ends: 881 [2022-04-27 15:30:49,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:30:49,723 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 15 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:30:49,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 417 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-27 15:30:49,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2022-04-27 15:30:49,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 881. [2022-04-27 15:30:49,745 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:30:49,746 INFO L82 GeneralOperation]: Start isEquivalent. First operand 881 states. Second operand has 881 states, 876 states have (on average 1.4897260273972603) internal successors, (1305), 876 states have internal predecessors, (1305), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:49,747 INFO L74 IsIncluded]: Start isIncluded. First operand 881 states. Second operand has 881 states, 876 states have (on average 1.4897260273972603) internal successors, (1305), 876 states have internal predecessors, (1305), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:49,747 INFO L87 Difference]: Start difference. First operand 881 states. Second operand has 881 states, 876 states have (on average 1.4897260273972603) internal successors, (1305), 876 states have internal predecessors, (1305), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:49,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:30:49,784 INFO L93 Difference]: Finished difference Result 881 states and 1309 transitions. [2022-04-27 15:30:49,784 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1309 transitions. [2022-04-27 15:30:49,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:30:49,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:30:49,785 INFO L74 IsIncluded]: Start isIncluded. First operand has 881 states, 876 states have (on average 1.4897260273972603) internal successors, (1305), 876 states have internal predecessors, (1305), 3 states have call successors, (3), 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 881 states. [2022-04-27 15:30:49,786 INFO L87 Difference]: Start difference. First operand has 881 states, 876 states have (on average 1.4897260273972603) internal successors, (1305), 876 states have internal predecessors, (1305), 3 states have call successors, (3), 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 881 states. [2022-04-27 15:30:49,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:30:49,807 INFO L93 Difference]: Finished difference Result 881 states and 1309 transitions. [2022-04-27 15:30:49,807 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1309 transitions. [2022-04-27 15:30:49,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:30:49,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:30:49,807 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:30:49,807 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:30:49,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 876 states have (on average 1.4897260273972603) internal successors, (1305), 876 states have internal predecessors, (1305), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:49,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1309 transitions. [2022-04-27 15:30:49,830 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1309 transitions. Word has length 131 [2022-04-27 15:30:49,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:30:49,830 INFO L495 AbstractCegarLoop]: Abstraction has 881 states and 1309 transitions. [2022-04-27 15:30:49,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:49,830 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1309 transitions. [2022-04-27 15:30:49,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-27 15:30:49,831 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:30:49,832 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:30:49,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-04-27 15:30:49,832 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:30:49,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:30:49,833 INFO L85 PathProgramCache]: Analyzing trace with hash 2136092125, now seen corresponding path program 1 times [2022-04-27 15:30:49,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:30:49,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320149479] [2022-04-27 15:30:49,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:30:49,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:30:49,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:30:49,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:30:49,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:30:49,950 INFO L290 TraceCheckUtils]: 0: Hoare triple {68528#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {68522#true} is VALID [2022-04-27 15:30:49,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {68522#true} assume true; {68522#true} is VALID [2022-04-27 15:30:49,950 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {68522#true} {68522#true} #689#return; {68522#true} is VALID [2022-04-27 15:30:49,951 INFO L272 TraceCheckUtils]: 0: Hoare triple {68522#true} call ULTIMATE.init(); {68528#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:30:49,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {68528#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {68522#true} is VALID [2022-04-27 15:30:49,951 INFO L290 TraceCheckUtils]: 2: Hoare triple {68522#true} assume true; {68522#true} is VALID [2022-04-27 15:30:49,951 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {68522#true} {68522#true} #689#return; {68522#true} is VALID [2022-04-27 15:30:49,951 INFO L272 TraceCheckUtils]: 4: Hoare triple {68522#true} call #t~ret161 := main(); {68522#true} is VALID [2022-04-27 15:30:49,951 INFO L290 TraceCheckUtils]: 5: Hoare triple {68522#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; {68522#true} is VALID [2022-04-27 15:30:49,951 INFO L290 TraceCheckUtils]: 6: Hoare triple {68522#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {68522#true} is VALID [2022-04-27 15:30:49,951 INFO L272 TraceCheckUtils]: 7: Hoare triple {68522#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {68522#true} is VALID [2022-04-27 15:30:49,951 INFO L290 TraceCheckUtils]: 8: Hoare triple {68522#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); {68527#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:30:49,951 INFO L290 TraceCheckUtils]: 9: Hoare triple {68527#(= 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; {68527#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:30:49,952 INFO L290 TraceCheckUtils]: 10: Hoare triple {68527#(= 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; {68527#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:30:49,952 INFO L290 TraceCheckUtils]: 11: Hoare triple {68527#(= 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)))); {68527#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:30:49,952 INFO L290 TraceCheckUtils]: 12: Hoare triple {68527#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {68527#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:30:49,952 INFO L290 TraceCheckUtils]: 13: Hoare triple {68527#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {68527#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:30:49,953 INFO L290 TraceCheckUtils]: 14: Hoare triple {68527#(= ssl3_accept_~blastFlag~0 0)} assume !false; {68527#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:30:49,953 INFO L290 TraceCheckUtils]: 15: Hoare triple {68527#(= 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); {68527#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:30:49,953 INFO L290 TraceCheckUtils]: 16: Hoare triple {68527#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {68527#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:30:49,953 INFO L290 TraceCheckUtils]: 17: Hoare triple {68527#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {68527#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:30:49,954 INFO L290 TraceCheckUtils]: 18: Hoare triple {68527#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {68527#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:30:49,954 INFO L290 TraceCheckUtils]: 19: Hoare triple {68527#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {68527#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:30:49,954 INFO L290 TraceCheckUtils]: 20: Hoare triple {68527#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {68527#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:30:49,954 INFO L290 TraceCheckUtils]: 21: Hoare triple {68527#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {68527#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:30:49,955 INFO L290 TraceCheckUtils]: 22: Hoare triple {68527#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {68527#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:30:49,955 INFO L290 TraceCheckUtils]: 23: Hoare triple {68527#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {68527#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:30:49,955 INFO L290 TraceCheckUtils]: 24: Hoare triple {68527#(= ssl3_accept_~blastFlag~0 0)} assume 8464 == #t~mem55;havoc #t~mem55; {68527#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:30:49,955 INFO L290 TraceCheckUtils]: 25: Hoare triple {68527#(= 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; {68527#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:30:49,956 INFO L290 TraceCheckUtils]: 26: Hoare triple {68527#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == ~blastFlag~0); {68523#false} is VALID [2022-04-27 15:30:49,956 INFO L290 TraceCheckUtils]: 27: Hoare triple {68523#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); {68523#false} is VALID [2022-04-27 15:30:49,956 INFO L290 TraceCheckUtils]: 28: Hoare triple {68523#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); {68523#false} is VALID [2022-04-27 15:30:49,956 INFO L290 TraceCheckUtils]: 29: Hoare triple {68523#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {68523#false} is VALID [2022-04-27 15:30:49,956 INFO L290 TraceCheckUtils]: 30: Hoare triple {68523#false} ~skip~0 := 0; {68523#false} is VALID [2022-04-27 15:30:49,956 INFO L290 TraceCheckUtils]: 31: Hoare triple {68523#false} assume !false; {68523#false} is VALID [2022-04-27 15:30:49,956 INFO L290 TraceCheckUtils]: 32: Hoare triple {68523#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); {68523#false} is VALID [2022-04-27 15:30:49,956 INFO L290 TraceCheckUtils]: 33: Hoare triple {68523#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {68523#false} is VALID [2022-04-27 15:30:49,956 INFO L290 TraceCheckUtils]: 34: Hoare triple {68523#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {68523#false} is VALID [2022-04-27 15:30:49,956 INFO L290 TraceCheckUtils]: 35: Hoare triple {68523#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {68523#false} is VALID [2022-04-27 15:30:49,956 INFO L290 TraceCheckUtils]: 36: Hoare triple {68523#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {68523#false} is VALID [2022-04-27 15:30:49,956 INFO L290 TraceCheckUtils]: 37: Hoare triple {68523#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {68523#false} is VALID [2022-04-27 15:30:49,956 INFO L290 TraceCheckUtils]: 38: Hoare triple {68523#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {68523#false} is VALID [2022-04-27 15:30:49,956 INFO L290 TraceCheckUtils]: 39: Hoare triple {68523#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {68523#false} is VALID [2022-04-27 15:30:49,957 INFO L290 TraceCheckUtils]: 40: Hoare triple {68523#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {68523#false} is VALID [2022-04-27 15:30:49,957 INFO L290 TraceCheckUtils]: 41: Hoare triple {68523#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {68523#false} is VALID [2022-04-27 15:30:49,957 INFO L290 TraceCheckUtils]: 42: Hoare triple {68523#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {68523#false} is VALID [2022-04-27 15:30:49,957 INFO L290 TraceCheckUtils]: 43: Hoare triple {68523#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {68523#false} is VALID [2022-04-27 15:30:49,957 INFO L290 TraceCheckUtils]: 44: Hoare triple {68523#false} assume 8496 == #t~mem58;havoc #t~mem58; {68523#false} is VALID [2022-04-27 15:30:49,957 INFO L290 TraceCheckUtils]: 45: Hoare triple {68523#false} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {68523#false} is VALID [2022-04-27 15:30:49,957 INFO L290 TraceCheckUtils]: 46: Hoare triple {68523#false} assume !(1 == ~blastFlag~0); {68523#false} is VALID [2022-04-27 15:30:49,957 INFO L290 TraceCheckUtils]: 47: Hoare triple {68523#false} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {68523#false} is VALID [2022-04-27 15:30:49,957 INFO L290 TraceCheckUtils]: 48: Hoare triple {68523#false} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {68523#false} is VALID [2022-04-27 15:30:49,957 INFO L290 TraceCheckUtils]: 49: Hoare triple {68523#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {68523#false} is VALID [2022-04-27 15:30:49,957 INFO L290 TraceCheckUtils]: 50: Hoare triple {68523#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); {68523#false} is VALID [2022-04-27 15:30:49,957 INFO L290 TraceCheckUtils]: 51: Hoare triple {68523#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {68523#false} is VALID [2022-04-27 15:30:49,957 INFO L290 TraceCheckUtils]: 52: Hoare triple {68523#false} ~skip~0 := 0; {68523#false} is VALID [2022-04-27 15:30:49,957 INFO L290 TraceCheckUtils]: 53: Hoare triple {68523#false} assume !false; {68523#false} is VALID [2022-04-27 15:30:49,957 INFO L290 TraceCheckUtils]: 54: Hoare triple {68523#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); {68523#false} is VALID [2022-04-27 15:30:49,957 INFO L290 TraceCheckUtils]: 55: Hoare triple {68523#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {68523#false} is VALID [2022-04-27 15:30:49,958 INFO L290 TraceCheckUtils]: 56: Hoare triple {68523#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {68523#false} is VALID [2022-04-27 15:30:49,958 INFO L290 TraceCheckUtils]: 57: Hoare triple {68523#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {68523#false} is VALID [2022-04-27 15:30:49,958 INFO L290 TraceCheckUtils]: 58: Hoare triple {68523#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {68523#false} is VALID [2022-04-27 15:30:49,958 INFO L290 TraceCheckUtils]: 59: Hoare triple {68523#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {68523#false} is VALID [2022-04-27 15:30:49,958 INFO L290 TraceCheckUtils]: 60: Hoare triple {68523#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {68523#false} is VALID [2022-04-27 15:30:49,958 INFO L290 TraceCheckUtils]: 61: Hoare triple {68523#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {68523#false} is VALID [2022-04-27 15:30:49,958 INFO L290 TraceCheckUtils]: 62: Hoare triple {68523#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {68523#false} is VALID [2022-04-27 15:30:49,958 INFO L290 TraceCheckUtils]: 63: Hoare triple {68523#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {68523#false} is VALID [2022-04-27 15:30:49,958 INFO L290 TraceCheckUtils]: 64: Hoare triple {68523#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {68523#false} is VALID [2022-04-27 15:30:49,958 INFO L290 TraceCheckUtils]: 65: Hoare triple {68523#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {68523#false} is VALID [2022-04-27 15:30:49,958 INFO L290 TraceCheckUtils]: 66: Hoare triple {68523#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {68523#false} is VALID [2022-04-27 15:30:49,958 INFO L290 TraceCheckUtils]: 67: Hoare triple {68523#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {68523#false} is VALID [2022-04-27 15:30:49,958 INFO L290 TraceCheckUtils]: 68: Hoare triple {68523#false} assume 8512 == #t~mem60;havoc #t~mem60; {68523#false} is VALID [2022-04-27 15:30:49,958 INFO L290 TraceCheckUtils]: 69: Hoare triple {68523#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); {68523#false} is VALID [2022-04-27 15:30:49,958 INFO L290 TraceCheckUtils]: 70: Hoare triple {68523#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; {68523#false} is VALID [2022-04-27 15:30:49,958 INFO L290 TraceCheckUtils]: 71: Hoare triple {68523#false} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {68523#false} is VALID [2022-04-27 15:30:49,958 INFO L290 TraceCheckUtils]: 72: Hoare triple {68523#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); {68523#false} is VALID [2022-04-27 15:30:49,959 INFO L290 TraceCheckUtils]: 73: Hoare triple {68523#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {68523#false} is VALID [2022-04-27 15:30:49,959 INFO L290 TraceCheckUtils]: 74: Hoare triple {68523#false} ~skip~0 := 0; {68523#false} is VALID [2022-04-27 15:30:49,959 INFO L290 TraceCheckUtils]: 75: Hoare triple {68523#false} assume !false; {68523#false} is VALID [2022-04-27 15:30:49,959 INFO L290 TraceCheckUtils]: 76: Hoare triple {68523#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); {68523#false} is VALID [2022-04-27 15:30:49,959 INFO L290 TraceCheckUtils]: 77: Hoare triple {68523#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {68523#false} is VALID [2022-04-27 15:30:49,959 INFO L290 TraceCheckUtils]: 78: Hoare triple {68523#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {68523#false} is VALID [2022-04-27 15:30:49,959 INFO L290 TraceCheckUtils]: 79: Hoare triple {68523#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {68523#false} is VALID [2022-04-27 15:30:49,959 INFO L290 TraceCheckUtils]: 80: Hoare triple {68523#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {68523#false} is VALID [2022-04-27 15:30:49,959 INFO L290 TraceCheckUtils]: 81: Hoare triple {68523#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {68523#false} is VALID [2022-04-27 15:30:49,959 INFO L290 TraceCheckUtils]: 82: Hoare triple {68523#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {68523#false} is VALID [2022-04-27 15:30:49,959 INFO L290 TraceCheckUtils]: 83: Hoare triple {68523#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {68523#false} is VALID [2022-04-27 15:30:49,959 INFO L290 TraceCheckUtils]: 84: Hoare triple {68523#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {68523#false} is VALID [2022-04-27 15:30:49,959 INFO L290 TraceCheckUtils]: 85: Hoare triple {68523#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {68523#false} is VALID [2022-04-27 15:30:49,959 INFO L290 TraceCheckUtils]: 86: Hoare triple {68523#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {68523#false} is VALID [2022-04-27 15:30:49,959 INFO L290 TraceCheckUtils]: 87: Hoare triple {68523#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {68523#false} is VALID [2022-04-27 15:30:49,959 INFO L290 TraceCheckUtils]: 88: Hoare triple {68523#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {68523#false} is VALID [2022-04-27 15:30:49,959 INFO L290 TraceCheckUtils]: 89: Hoare triple {68523#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {68523#false} is VALID [2022-04-27 15:30:49,959 INFO L290 TraceCheckUtils]: 90: Hoare triple {68523#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {68523#false} is VALID [2022-04-27 15:30:49,960 INFO L290 TraceCheckUtils]: 91: Hoare triple {68523#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {68523#false} is VALID [2022-04-27 15:30:49,960 INFO L290 TraceCheckUtils]: 92: Hoare triple {68523#false} assume 8528 == #t~mem62;havoc #t~mem62; {68523#false} is VALID [2022-04-27 15:30:49,960 INFO L290 TraceCheckUtils]: 93: Hoare triple {68523#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); {68523#false} is VALID [2022-04-27 15:30:49,960 INFO L290 TraceCheckUtils]: 94: Hoare triple {68523#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; {68523#false} is VALID [2022-04-27 15:30:49,960 INFO L290 TraceCheckUtils]: 95: Hoare triple {68523#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); {68523#false} is VALID [2022-04-27 15:30:49,960 INFO L290 TraceCheckUtils]: 96: Hoare triple {68523#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {68523#false} is VALID [2022-04-27 15:30:49,960 INFO L290 TraceCheckUtils]: 97: Hoare triple {68523#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {68523#false} is VALID [2022-04-27 15:30:49,960 INFO L290 TraceCheckUtils]: 98: Hoare triple {68523#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {68523#false} is VALID [2022-04-27 15:30:49,960 INFO L290 TraceCheckUtils]: 99: Hoare triple {68523#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {68523#false} is VALID [2022-04-27 15:30:49,960 INFO L290 TraceCheckUtils]: 100: Hoare triple {68523#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); {68523#false} is VALID [2022-04-27 15:30:49,960 INFO L290 TraceCheckUtils]: 101: Hoare triple {68523#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {68523#false} is VALID [2022-04-27 15:30:49,960 INFO L290 TraceCheckUtils]: 102: Hoare triple {68523#false} ~skip~0 := 0; {68523#false} is VALID [2022-04-27 15:30:49,960 INFO L290 TraceCheckUtils]: 103: Hoare triple {68523#false} assume !false; {68523#false} is VALID [2022-04-27 15:30:49,960 INFO L290 TraceCheckUtils]: 104: Hoare triple {68523#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); {68523#false} is VALID [2022-04-27 15:30:49,960 INFO L290 TraceCheckUtils]: 105: Hoare triple {68523#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {68523#false} is VALID [2022-04-27 15:30:49,960 INFO L290 TraceCheckUtils]: 106: Hoare triple {68523#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {68523#false} is VALID [2022-04-27 15:30:49,961 INFO L290 TraceCheckUtils]: 107: Hoare triple {68523#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {68523#false} is VALID [2022-04-27 15:30:49,961 INFO L290 TraceCheckUtils]: 108: Hoare triple {68523#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {68523#false} is VALID [2022-04-27 15:30:49,961 INFO L290 TraceCheckUtils]: 109: Hoare triple {68523#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {68523#false} is VALID [2022-04-27 15:30:49,961 INFO L290 TraceCheckUtils]: 110: Hoare triple {68523#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {68523#false} is VALID [2022-04-27 15:30:49,961 INFO L290 TraceCheckUtils]: 111: Hoare triple {68523#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {68523#false} is VALID [2022-04-27 15:30:49,961 INFO L290 TraceCheckUtils]: 112: Hoare triple {68523#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {68523#false} is VALID [2022-04-27 15:30:49,961 INFO L290 TraceCheckUtils]: 113: Hoare triple {68523#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {68523#false} is VALID [2022-04-27 15:30:49,961 INFO L290 TraceCheckUtils]: 114: Hoare triple {68523#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {68523#false} is VALID [2022-04-27 15:30:49,961 INFO L290 TraceCheckUtils]: 115: Hoare triple {68523#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {68523#false} is VALID [2022-04-27 15:30:49,961 INFO L290 TraceCheckUtils]: 116: Hoare triple {68523#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {68523#false} is VALID [2022-04-27 15:30:49,961 INFO L290 TraceCheckUtils]: 117: Hoare triple {68523#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {68523#false} is VALID [2022-04-27 15:30:49,961 INFO L290 TraceCheckUtils]: 118: Hoare triple {68523#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {68523#false} is VALID [2022-04-27 15:30:49,961 INFO L290 TraceCheckUtils]: 119: Hoare triple {68523#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {68523#false} is VALID [2022-04-27 15:30:49,961 INFO L290 TraceCheckUtils]: 120: Hoare triple {68523#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {68523#false} is VALID [2022-04-27 15:30:49,961 INFO L290 TraceCheckUtils]: 121: Hoare triple {68523#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {68523#false} is VALID [2022-04-27 15:30:49,961 INFO L290 TraceCheckUtils]: 122: Hoare triple {68523#false} assume 8544 == #t~mem64;havoc #t~mem64; {68523#false} is VALID [2022-04-27 15:30:49,961 INFO L290 TraceCheckUtils]: 123: Hoare triple {68523#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {68523#false} is VALID [2022-04-27 15:30:49,962 INFO L290 TraceCheckUtils]: 124: Hoare triple {68523#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); {68523#false} is VALID [2022-04-27 15:30:49,962 INFO L290 TraceCheckUtils]: 125: Hoare triple {68523#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {68523#false} is VALID [2022-04-27 15:30:49,962 INFO L290 TraceCheckUtils]: 126: Hoare triple {68523#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); {68523#false} is VALID [2022-04-27 15:30:49,962 INFO L290 TraceCheckUtils]: 127: Hoare triple {68523#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; {68523#false} is VALID [2022-04-27 15:30:49,962 INFO L290 TraceCheckUtils]: 128: Hoare triple {68523#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; {68523#false} is VALID [2022-04-27 15:30:49,962 INFO L290 TraceCheckUtils]: 129: Hoare triple {68523#false} assume 8 == ~blastFlag~0; {68523#false} is VALID [2022-04-27 15:30:49,962 INFO L290 TraceCheckUtils]: 130: Hoare triple {68523#false} assume !false; {68523#false} is VALID [2022-04-27 15:30:49,962 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2022-04-27 15:30:49,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:30:49,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320149479] [2022-04-27 15:30:49,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320149479] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:30:49,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:30:49,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:30:49,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926420686] [2022-04-27 15:30:49,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:30:49,963 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 131 [2022-04-27 15:30:49,963 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:30:49,963 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:50,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:30:50,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:30:50,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:30:50,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:30:50,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:30:50,021 INFO L87 Difference]: Start difference. First operand 881 states and 1309 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:54,292 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-27 15:30:55,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:30:55,986 INFO L93 Difference]: Finished difference Result 1738 states and 2591 transitions. [2022-04-27 15:30:55,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:30:55,987 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 131 [2022-04-27 15:30:55,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:30:55,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:55,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 425 transitions. [2022-04-27 15:30:55,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:55,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 425 transitions. [2022-04-27 15:30:55,990 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 425 transitions. [2022-04-27 15:30:56,260 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 425 edges. 425 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:30:56,285 INFO L225 Difference]: With dead ends: 1738 [2022-04-27 15:30:56,286 INFO L226 Difference]: Without dead ends: 883 [2022-04-27 15:30:56,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:30:56,287 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 4 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s 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.9s IncrementalHoareTripleChecker+Time [2022-04-27 15:30:56,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 396 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-04-27 15:30:56,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2022-04-27 15:30:56,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 883. [2022-04-27 15:30:56,297 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:30:56,298 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-27 15:30:56,299 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-27 15:30:56,299 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-27 15:30:56,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:30:56,320 INFO L93 Difference]: Finished difference Result 883 states and 1311 transitions. [2022-04-27 15:30:56,321 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1311 transitions. [2022-04-27 15:30:56,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:30:56,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:30:56,322 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-27 15:30:56,323 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-27 15:30:56,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:30:56,344 INFO L93 Difference]: Finished difference Result 883 states and 1311 transitions. [2022-04-27 15:30:56,344 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1311 transitions. [2022-04-27 15:30:56,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:30:56,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:30:56,345 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:30:56,345 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:30:56,346 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-27 15:30:56,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1311 transitions. [2022-04-27 15:30:56,369 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1311 transitions. Word has length 131 [2022-04-27 15:30:56,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:30:56,370 INFO L495 AbstractCegarLoop]: Abstraction has 883 states and 1311 transitions. [2022-04-27 15:30:56,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:56,370 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1311 transitions. [2022-04-27 15:30:56,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-04-27 15:30:56,371 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:30:56,371 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:30:56,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-04-27 15:30:56,371 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:30:56,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:30:56,371 INFO L85 PathProgramCache]: Analyzing trace with hash -997450557, now seen corresponding path program 1 times [2022-04-27 15:30:56,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:30:56,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870946940] [2022-04-27 15:30:56,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:30:56,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:30:56,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:30:56,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:30:56,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:30:56,507 INFO L290 TraceCheckUtils]: 0: Hoare triple {73201#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {73195#true} is VALID [2022-04-27 15:30:56,507 INFO L290 TraceCheckUtils]: 1: Hoare triple {73195#true} assume true; {73195#true} is VALID [2022-04-27 15:30:56,507 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {73195#true} {73195#true} #689#return; {73195#true} is VALID [2022-04-27 15:30:56,508 INFO L272 TraceCheckUtils]: 0: Hoare triple {73195#true} call ULTIMATE.init(); {73201#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:30:56,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {73201#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {73195#true} is VALID [2022-04-27 15:30:56,508 INFO L290 TraceCheckUtils]: 2: Hoare triple {73195#true} assume true; {73195#true} is VALID [2022-04-27 15:30:56,508 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73195#true} {73195#true} #689#return; {73195#true} is VALID [2022-04-27 15:30:56,508 INFO L272 TraceCheckUtils]: 4: Hoare triple {73195#true} call #t~ret161 := main(); {73195#true} is VALID [2022-04-27 15:30:56,509 INFO L290 TraceCheckUtils]: 5: Hoare triple {73195#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; {73195#true} is VALID [2022-04-27 15:30:56,509 INFO L290 TraceCheckUtils]: 6: Hoare triple {73195#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {73195#true} is VALID [2022-04-27 15:30:56,509 INFO L272 TraceCheckUtils]: 7: Hoare triple {73195#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {73195#true} is VALID [2022-04-27 15:30:56,509 INFO L290 TraceCheckUtils]: 8: Hoare triple {73195#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); {73195#true} is VALID [2022-04-27 15:30:56,509 INFO L290 TraceCheckUtils]: 9: Hoare triple {73195#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; {73195#true} is VALID [2022-04-27 15:30:56,509 INFO L290 TraceCheckUtils]: 10: Hoare triple {73195#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; {73195#true} is VALID [2022-04-27 15:30:56,509 INFO L290 TraceCheckUtils]: 11: Hoare triple {73195#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {73195#true} is VALID [2022-04-27 15:30:56,509 INFO L290 TraceCheckUtils]: 12: Hoare triple {73195#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {73195#true} is VALID [2022-04-27 15:30:56,509 INFO L290 TraceCheckUtils]: 13: Hoare triple {73195#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {73195#true} is VALID [2022-04-27 15:30:56,509 INFO L290 TraceCheckUtils]: 14: Hoare triple {73195#true} assume !false; {73195#true} is VALID [2022-04-27 15:30:56,509 INFO L290 TraceCheckUtils]: 15: Hoare triple {73195#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); {73195#true} is VALID [2022-04-27 15:30:56,509 INFO L290 TraceCheckUtils]: 16: Hoare triple {73195#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {73195#true} is VALID [2022-04-27 15:30:56,509 INFO L290 TraceCheckUtils]: 17: Hoare triple {73195#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {73195#true} is VALID [2022-04-27 15:30:56,509 INFO L290 TraceCheckUtils]: 18: Hoare triple {73195#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {73195#true} is VALID [2022-04-27 15:30:56,510 INFO L290 TraceCheckUtils]: 19: Hoare triple {73195#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {73195#true} is VALID [2022-04-27 15:30:56,510 INFO L290 TraceCheckUtils]: 20: Hoare triple {73195#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {73195#true} is VALID [2022-04-27 15:30:56,510 INFO L290 TraceCheckUtils]: 21: Hoare triple {73195#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {73195#true} is VALID [2022-04-27 15:30:56,510 INFO L290 TraceCheckUtils]: 22: Hoare triple {73195#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {73195#true} is VALID [2022-04-27 15:30:56,510 INFO L290 TraceCheckUtils]: 23: Hoare triple {73195#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {73195#true} is VALID [2022-04-27 15:30:56,510 INFO L290 TraceCheckUtils]: 24: Hoare triple {73195#true} assume 8464 == #t~mem55;havoc #t~mem55; {73195#true} is VALID [2022-04-27 15:30:56,510 INFO L290 TraceCheckUtils]: 25: Hoare triple {73195#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; {73195#true} is VALID [2022-04-27 15:30:56,510 INFO L290 TraceCheckUtils]: 26: Hoare triple {73195#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {73195#true} is VALID [2022-04-27 15:30:56,510 INFO L290 TraceCheckUtils]: 27: Hoare triple {73195#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); {73195#true} is VALID [2022-04-27 15:30:56,510 INFO L290 TraceCheckUtils]: 28: Hoare triple {73195#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); {73195#true} is VALID [2022-04-27 15:30:56,510 INFO L290 TraceCheckUtils]: 29: Hoare triple {73195#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {73195#true} is VALID [2022-04-27 15:30:56,510 INFO L290 TraceCheckUtils]: 30: Hoare triple {73195#true} ~skip~0 := 0; {73195#true} is VALID [2022-04-27 15:30:56,510 INFO L290 TraceCheckUtils]: 31: Hoare triple {73195#true} assume !false; {73195#true} is VALID [2022-04-27 15:30:56,510 INFO L290 TraceCheckUtils]: 32: Hoare triple {73195#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); {73195#true} is VALID [2022-04-27 15:30:56,510 INFO L290 TraceCheckUtils]: 33: Hoare triple {73195#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {73195#true} is VALID [2022-04-27 15:30:56,510 INFO L290 TraceCheckUtils]: 34: Hoare triple {73195#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {73195#true} is VALID [2022-04-27 15:30:56,510 INFO L290 TraceCheckUtils]: 35: Hoare triple {73195#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {73195#true} is VALID [2022-04-27 15:30:56,510 INFO L290 TraceCheckUtils]: 36: Hoare triple {73195#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {73195#true} is VALID [2022-04-27 15:30:56,511 INFO L290 TraceCheckUtils]: 37: Hoare triple {73195#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {73195#true} is VALID [2022-04-27 15:30:56,511 INFO L290 TraceCheckUtils]: 38: Hoare triple {73195#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {73195#true} is VALID [2022-04-27 15:30:56,511 INFO L290 TraceCheckUtils]: 39: Hoare triple {73195#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {73195#true} is VALID [2022-04-27 15:30:56,511 INFO L290 TraceCheckUtils]: 40: Hoare triple {73195#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {73195#true} is VALID [2022-04-27 15:30:56,511 INFO L290 TraceCheckUtils]: 41: Hoare triple {73195#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {73195#true} is VALID [2022-04-27 15:30:56,511 INFO L290 TraceCheckUtils]: 42: Hoare triple {73195#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {73195#true} is VALID [2022-04-27 15:30:56,511 INFO L290 TraceCheckUtils]: 43: Hoare triple {73195#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {73195#true} is VALID [2022-04-27 15:30:56,511 INFO L290 TraceCheckUtils]: 44: Hoare triple {73195#true} assume 8496 == #t~mem58;havoc #t~mem58; {73195#true} is VALID [2022-04-27 15:30:56,511 INFO L290 TraceCheckUtils]: 45: Hoare triple {73195#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {73195#true} is VALID [2022-04-27 15:30:56,511 INFO L290 TraceCheckUtils]: 46: Hoare triple {73195#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {73195#true} is VALID [2022-04-27 15:30:56,511 INFO L290 TraceCheckUtils]: 47: Hoare triple {73195#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {73195#true} is VALID [2022-04-27 15:30:56,511 INFO L290 TraceCheckUtils]: 48: Hoare triple {73195#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {73195#true} is VALID [2022-04-27 15:30:56,511 INFO L290 TraceCheckUtils]: 49: Hoare triple {73195#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {73195#true} is VALID [2022-04-27 15:30:56,511 INFO L290 TraceCheckUtils]: 50: Hoare triple {73195#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); {73195#true} is VALID [2022-04-27 15:30:56,511 INFO L290 TraceCheckUtils]: 51: Hoare triple {73195#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {73195#true} is VALID [2022-04-27 15:30:56,511 INFO L290 TraceCheckUtils]: 52: Hoare triple {73195#true} ~skip~0 := 0; {73195#true} is VALID [2022-04-27 15:30:56,511 INFO L290 TraceCheckUtils]: 53: Hoare triple {73195#true} assume !false; {73195#true} is VALID [2022-04-27 15:30:56,512 INFO L290 TraceCheckUtils]: 54: Hoare triple {73195#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); {73195#true} is VALID [2022-04-27 15:30:56,512 INFO L290 TraceCheckUtils]: 55: Hoare triple {73195#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {73195#true} is VALID [2022-04-27 15:30:56,512 INFO L290 TraceCheckUtils]: 56: Hoare triple {73195#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {73195#true} is VALID [2022-04-27 15:30:56,512 INFO L290 TraceCheckUtils]: 57: Hoare triple {73195#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {73195#true} is VALID [2022-04-27 15:30:56,512 INFO L290 TraceCheckUtils]: 58: Hoare triple {73195#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {73195#true} is VALID [2022-04-27 15:30:56,512 INFO L290 TraceCheckUtils]: 59: Hoare triple {73195#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {73195#true} is VALID [2022-04-27 15:30:56,512 INFO L290 TraceCheckUtils]: 60: Hoare triple {73195#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {73195#true} is VALID [2022-04-27 15:30:56,512 INFO L290 TraceCheckUtils]: 61: Hoare triple {73195#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {73195#true} is VALID [2022-04-27 15:30:56,512 INFO L290 TraceCheckUtils]: 62: Hoare triple {73195#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {73195#true} is VALID [2022-04-27 15:30:56,512 INFO L290 TraceCheckUtils]: 63: Hoare triple {73195#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {73195#true} is VALID [2022-04-27 15:30:56,512 INFO L290 TraceCheckUtils]: 64: Hoare triple {73195#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {73195#true} is VALID [2022-04-27 15:30:56,512 INFO L290 TraceCheckUtils]: 65: Hoare triple {73195#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {73195#true} is VALID [2022-04-27 15:30:56,512 INFO L290 TraceCheckUtils]: 66: Hoare triple {73195#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {73195#true} is VALID [2022-04-27 15:30:56,512 INFO L290 TraceCheckUtils]: 67: Hoare triple {73195#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {73195#true} is VALID [2022-04-27 15:30:56,512 INFO L290 TraceCheckUtils]: 68: Hoare triple {73195#true} assume 8512 == #t~mem60;havoc #t~mem60; {73195#true} is VALID [2022-04-27 15:30:56,512 INFO L290 TraceCheckUtils]: 69: Hoare triple {73195#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); {73195#true} is VALID [2022-04-27 15:30:56,513 INFO L290 TraceCheckUtils]: 70: Hoare triple {73195#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; {73195#true} is VALID [2022-04-27 15:30:56,513 INFO L290 TraceCheckUtils]: 71: Hoare triple {73195#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 6; {73200#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:30:56,513 INFO L290 TraceCheckUtils]: 72: Hoare triple {73200#(<= ssl3_accept_~blastFlag~0 6)} assume !(~ret~0 <= 0); {73200#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:30:56,513 INFO L290 TraceCheckUtils]: 73: Hoare triple {73200#(<= 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); {73200#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:30:56,514 INFO L290 TraceCheckUtils]: 74: Hoare triple {73200#(<= 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); {73200#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:30:56,514 INFO L290 TraceCheckUtils]: 75: Hoare triple {73200#(<= ssl3_accept_~blastFlag~0 6)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {73200#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:30:56,514 INFO L290 TraceCheckUtils]: 76: Hoare triple {73200#(<= ssl3_accept_~blastFlag~0 6)} ~skip~0 := 0; {73200#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:30:56,514 INFO L290 TraceCheckUtils]: 77: Hoare triple {73200#(<= ssl3_accept_~blastFlag~0 6)} assume !false; {73200#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:30:56,515 INFO L290 TraceCheckUtils]: 78: Hoare triple {73200#(<= 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); {73200#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:30:56,515 INFO L290 TraceCheckUtils]: 79: Hoare triple {73200#(<= ssl3_accept_~blastFlag~0 6)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {73200#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:30:56,515 INFO L290 TraceCheckUtils]: 80: Hoare triple {73200#(<= ssl3_accept_~blastFlag~0 6)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {73200#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:30:56,515 INFO L290 TraceCheckUtils]: 81: Hoare triple {73200#(<= ssl3_accept_~blastFlag~0 6)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {73200#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:30:56,516 INFO L290 TraceCheckUtils]: 82: Hoare triple {73200#(<= ssl3_accept_~blastFlag~0 6)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {73200#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:30:56,516 INFO L290 TraceCheckUtils]: 83: Hoare triple {73200#(<= ssl3_accept_~blastFlag~0 6)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {73200#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:30:56,516 INFO L290 TraceCheckUtils]: 84: Hoare triple {73200#(<= ssl3_accept_~blastFlag~0 6)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {73200#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:30:56,516 INFO L290 TraceCheckUtils]: 85: Hoare triple {73200#(<= ssl3_accept_~blastFlag~0 6)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {73200#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:30:56,517 INFO L290 TraceCheckUtils]: 86: Hoare triple {73200#(<= ssl3_accept_~blastFlag~0 6)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {73200#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:30:56,517 INFO L290 TraceCheckUtils]: 87: Hoare triple {73200#(<= ssl3_accept_~blastFlag~0 6)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {73200#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:30:56,517 INFO L290 TraceCheckUtils]: 88: Hoare triple {73200#(<= ssl3_accept_~blastFlag~0 6)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {73200#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:30:56,517 INFO L290 TraceCheckUtils]: 89: Hoare triple {73200#(<= ssl3_accept_~blastFlag~0 6)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {73200#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:30:56,518 INFO L290 TraceCheckUtils]: 90: Hoare triple {73200#(<= ssl3_accept_~blastFlag~0 6)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {73200#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:30:56,518 INFO L290 TraceCheckUtils]: 91: Hoare triple {73200#(<= ssl3_accept_~blastFlag~0 6)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {73200#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:30:56,518 INFO L290 TraceCheckUtils]: 92: Hoare triple {73200#(<= ssl3_accept_~blastFlag~0 6)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {73200#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:30:56,518 INFO L290 TraceCheckUtils]: 93: Hoare triple {73200#(<= ssl3_accept_~blastFlag~0 6)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {73200#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:30:56,519 INFO L290 TraceCheckUtils]: 94: Hoare triple {73200#(<= ssl3_accept_~blastFlag~0 6)} assume 8528 == #t~mem62;havoc #t~mem62; {73200#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:30:56,519 INFO L290 TraceCheckUtils]: 95: Hoare triple {73200#(<= 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); {73200#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:30:56,519 INFO L290 TraceCheckUtils]: 96: Hoare triple {73200#(<= 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; {73200#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:30:56,519 INFO L290 TraceCheckUtils]: 97: Hoare triple {73200#(<= 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); {73200#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:30:56,519 INFO L290 TraceCheckUtils]: 98: Hoare triple {73200#(<= ssl3_accept_~blastFlag~0 6)} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {73200#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:30:56,520 INFO L290 TraceCheckUtils]: 99: Hoare triple {73200#(<= 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); {73200#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:30:56,520 INFO L290 TraceCheckUtils]: 100: Hoare triple {73200#(<= ssl3_accept_~blastFlag~0 6)} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {73200#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:30:56,520 INFO L290 TraceCheckUtils]: 101: Hoare triple {73200#(<= 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); {73200#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:30:56,520 INFO L290 TraceCheckUtils]: 102: Hoare triple {73200#(<= 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); {73200#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:30:56,521 INFO L290 TraceCheckUtils]: 103: Hoare triple {73200#(<= ssl3_accept_~blastFlag~0 6)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {73200#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:30:56,521 INFO L290 TraceCheckUtils]: 104: Hoare triple {73200#(<= ssl3_accept_~blastFlag~0 6)} ~skip~0 := 0; {73200#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:30:56,521 INFO L290 TraceCheckUtils]: 105: Hoare triple {73200#(<= ssl3_accept_~blastFlag~0 6)} assume !false; {73200#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:30:56,521 INFO L290 TraceCheckUtils]: 106: Hoare triple {73200#(<= 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); {73200#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:30:56,522 INFO L290 TraceCheckUtils]: 107: Hoare triple {73200#(<= ssl3_accept_~blastFlag~0 6)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {73200#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:30:56,522 INFO L290 TraceCheckUtils]: 108: Hoare triple {73200#(<= ssl3_accept_~blastFlag~0 6)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {73200#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:30:56,522 INFO L290 TraceCheckUtils]: 109: Hoare triple {73200#(<= ssl3_accept_~blastFlag~0 6)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {73200#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:30:56,522 INFO L290 TraceCheckUtils]: 110: Hoare triple {73200#(<= ssl3_accept_~blastFlag~0 6)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {73200#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:30:56,523 INFO L290 TraceCheckUtils]: 111: Hoare triple {73200#(<= ssl3_accept_~blastFlag~0 6)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {73200#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:30:56,523 INFO L290 TraceCheckUtils]: 112: Hoare triple {73200#(<= ssl3_accept_~blastFlag~0 6)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {73200#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:30:56,523 INFO L290 TraceCheckUtils]: 113: Hoare triple {73200#(<= ssl3_accept_~blastFlag~0 6)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {73200#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:30:56,523 INFO L290 TraceCheckUtils]: 114: Hoare triple {73200#(<= ssl3_accept_~blastFlag~0 6)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {73200#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:30:56,524 INFO L290 TraceCheckUtils]: 115: Hoare triple {73200#(<= ssl3_accept_~blastFlag~0 6)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {73200#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:30:56,524 INFO L290 TraceCheckUtils]: 116: Hoare triple {73200#(<= ssl3_accept_~blastFlag~0 6)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {73200#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:30:56,524 INFO L290 TraceCheckUtils]: 117: Hoare triple {73200#(<= ssl3_accept_~blastFlag~0 6)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {73200#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:30:56,524 INFO L290 TraceCheckUtils]: 118: Hoare triple {73200#(<= ssl3_accept_~blastFlag~0 6)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {73200#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:30:56,525 INFO L290 TraceCheckUtils]: 119: Hoare triple {73200#(<= ssl3_accept_~blastFlag~0 6)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {73200#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:30:56,525 INFO L290 TraceCheckUtils]: 120: Hoare triple {73200#(<= ssl3_accept_~blastFlag~0 6)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {73200#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:30:56,525 INFO L290 TraceCheckUtils]: 121: Hoare triple {73200#(<= ssl3_accept_~blastFlag~0 6)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {73200#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:30:56,525 INFO L290 TraceCheckUtils]: 122: Hoare triple {73200#(<= ssl3_accept_~blastFlag~0 6)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {73200#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:30:56,526 INFO L290 TraceCheckUtils]: 123: Hoare triple {73200#(<= ssl3_accept_~blastFlag~0 6)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {73200#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:30:56,526 INFO L290 TraceCheckUtils]: 124: Hoare triple {73200#(<= ssl3_accept_~blastFlag~0 6)} assume 8544 == #t~mem64;havoc #t~mem64; {73200#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:30:56,526 INFO L290 TraceCheckUtils]: 125: Hoare triple {73200#(<= ssl3_accept_~blastFlag~0 6)} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {73200#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:30:56,526 INFO L290 TraceCheckUtils]: 126: Hoare triple {73200#(<= 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); {73200#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:30:56,526 INFO L290 TraceCheckUtils]: 127: Hoare triple {73200#(<= 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; {73200#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:30:56,527 INFO L290 TraceCheckUtils]: 128: Hoare triple {73200#(<= 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); {73200#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:30:56,527 INFO L290 TraceCheckUtils]: 129: Hoare triple {73200#(<= 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; {73200#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:30:56,527 INFO L290 TraceCheckUtils]: 130: Hoare triple {73200#(<= 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; {73200#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:30:56,528 INFO L290 TraceCheckUtils]: 131: Hoare triple {73200#(<= ssl3_accept_~blastFlag~0 6)} assume 8 == ~blastFlag~0; {73196#false} is VALID [2022-04-27 15:30:56,528 INFO L290 TraceCheckUtils]: 132: Hoare triple {73196#false} assume !false; {73196#false} is VALID [2022-04-27 15:30:56,528 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-27 15:30:56,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:30:56,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870946940] [2022-04-27 15:30:56,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870946940] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:30:56,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:30:56,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:30:56,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441395393] [2022-04-27 15:30:56,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:30:56,530 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 133 [2022-04-27 15:30:56,530 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:30:56,530 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:56,591 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:30:56,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:30:56,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:30:56,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:30:56,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:30:56,592 INFO L87 Difference]: Start difference. First operand 883 states and 1311 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:58,209 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:31:00,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:31:00,601 INFO L93 Difference]: Finished difference Result 2177 states and 3253 transitions. [2022-04-27 15:31:00,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:31:00,601 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 133 [2022-04-27 15:31:00,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:31:00,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:00,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 607 transitions. [2022-04-27 15:31:00,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:00,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 607 transitions. [2022-04-27 15:31:00,622 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 607 transitions. [2022-04-27 15:31:00,943 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 607 edges. 607 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:31:00,994 INFO L225 Difference]: With dead ends: 2177 [2022-04-27 15:31:00,994 INFO L226 Difference]: Without dead ends: 1322 [2022-04-27 15:31:00,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:31:00,995 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 157 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:31:00,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 380 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-27 15:31:00,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2022-04-27 15:31:01,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1320. [2022-04-27 15:31:01,070 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:31:01,072 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1322 states. Second operand has 1320 states, 1315 states have (on average 1.4958174904942967) internal successors, (1967), 1315 states have internal predecessors, (1967), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:01,072 INFO L74 IsIncluded]: Start isIncluded. First operand 1322 states. Second operand has 1320 states, 1315 states have (on average 1.4958174904942967) internal successors, (1967), 1315 states have internal predecessors, (1967), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:01,073 INFO L87 Difference]: Start difference. First operand 1322 states. Second operand has 1320 states, 1315 states have (on average 1.4958174904942967) internal successors, (1967), 1315 states have internal predecessors, (1967), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:01,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:31:01,115 INFO L93 Difference]: Finished difference Result 1322 states and 1972 transitions. [2022-04-27 15:31:01,115 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1972 transitions. [2022-04-27 15:31:01,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:31:01,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:31:01,116 INFO L74 IsIncluded]: Start isIncluded. First operand has 1320 states, 1315 states have (on average 1.4958174904942967) internal successors, (1967), 1315 states have internal predecessors, (1967), 3 states have call successors, (3), 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 1322 states. [2022-04-27 15:31:01,117 INFO L87 Difference]: Start difference. First operand has 1320 states, 1315 states have (on average 1.4958174904942967) internal successors, (1967), 1315 states have internal predecessors, (1967), 3 states have call successors, (3), 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 1322 states. [2022-04-27 15:31:01,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:31:01,158 INFO L93 Difference]: Finished difference Result 1322 states and 1972 transitions. [2022-04-27 15:31:01,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1972 transitions. [2022-04-27 15:31:01,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:31:01,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:31:01,159 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:31:01,159 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:31:01,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1320 states, 1315 states have (on average 1.4958174904942967) internal successors, (1967), 1315 states have internal predecessors, (1967), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:01,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1971 transitions. [2022-04-27 15:31:01,205 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1971 transitions. Word has length 133 [2022-04-27 15:31:01,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:31:01,205 INFO L495 AbstractCegarLoop]: Abstraction has 1320 states and 1971 transitions. [2022-04-27 15:31:01,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:01,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1971 transitions. [2022-04-27 15:31:01,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-04-27 15:31:01,206 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:31:01,207 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:31:01,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-04-27 15:31:01,207 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:31:01,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:31:01,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1473303164, now seen corresponding path program 1 times [2022-04-27 15:31:01,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:31:01,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164003595] [2022-04-27 15:31:01,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:31:01,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:31:01,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:31:01,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:31:01,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:31:01,331 INFO L290 TraceCheckUtils]: 0: Hoare triple {79713#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {79707#true} is VALID [2022-04-27 15:31:01,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {79707#true} assume true; {79707#true} is VALID [2022-04-27 15:31:01,331 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {79707#true} {79707#true} #689#return; {79707#true} is VALID [2022-04-27 15:31:01,332 INFO L272 TraceCheckUtils]: 0: Hoare triple {79707#true} call ULTIMATE.init(); {79713#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:31:01,332 INFO L290 TraceCheckUtils]: 1: Hoare triple {79713#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {79707#true} is VALID [2022-04-27 15:31:01,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {79707#true} assume true; {79707#true} is VALID [2022-04-27 15:31:01,332 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {79707#true} {79707#true} #689#return; {79707#true} is VALID [2022-04-27 15:31:01,332 INFO L272 TraceCheckUtils]: 4: Hoare triple {79707#true} call #t~ret161 := main(); {79707#true} is VALID [2022-04-27 15:31:01,332 INFO L290 TraceCheckUtils]: 5: Hoare triple {79707#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; {79707#true} is VALID [2022-04-27 15:31:01,332 INFO L290 TraceCheckUtils]: 6: Hoare triple {79707#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {79707#true} is VALID [2022-04-27 15:31:01,332 INFO L272 TraceCheckUtils]: 7: Hoare triple {79707#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {79707#true} is VALID [2022-04-27 15:31:01,332 INFO L290 TraceCheckUtils]: 8: Hoare triple {79707#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); {79707#true} is VALID [2022-04-27 15:31:01,333 INFO L290 TraceCheckUtils]: 9: Hoare triple {79707#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; {79707#true} is VALID [2022-04-27 15:31:01,333 INFO L290 TraceCheckUtils]: 10: Hoare triple {79707#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; {79707#true} is VALID [2022-04-27 15:31:01,333 INFO L290 TraceCheckUtils]: 11: Hoare triple {79707#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {79707#true} is VALID [2022-04-27 15:31:01,333 INFO L290 TraceCheckUtils]: 12: Hoare triple {79707#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {79707#true} is VALID [2022-04-27 15:31:01,333 INFO L290 TraceCheckUtils]: 13: Hoare triple {79707#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {79707#true} is VALID [2022-04-27 15:31:01,333 INFO L290 TraceCheckUtils]: 14: Hoare triple {79707#true} assume !false; {79707#true} is VALID [2022-04-27 15:31:01,333 INFO L290 TraceCheckUtils]: 15: Hoare triple {79707#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); {79707#true} is VALID [2022-04-27 15:31:01,333 INFO L290 TraceCheckUtils]: 16: Hoare triple {79707#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {79707#true} is VALID [2022-04-27 15:31:01,333 INFO L290 TraceCheckUtils]: 17: Hoare triple {79707#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {79707#true} is VALID [2022-04-27 15:31:01,333 INFO L290 TraceCheckUtils]: 18: Hoare triple {79707#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {79707#true} is VALID [2022-04-27 15:31:01,333 INFO L290 TraceCheckUtils]: 19: Hoare triple {79707#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {79707#true} is VALID [2022-04-27 15:31:01,333 INFO L290 TraceCheckUtils]: 20: Hoare triple {79707#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {79707#true} is VALID [2022-04-27 15:31:01,333 INFO L290 TraceCheckUtils]: 21: Hoare triple {79707#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {79707#true} is VALID [2022-04-27 15:31:01,333 INFO L290 TraceCheckUtils]: 22: Hoare triple {79707#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {79707#true} is VALID [2022-04-27 15:31:01,333 INFO L290 TraceCheckUtils]: 23: Hoare triple {79707#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {79707#true} is VALID [2022-04-27 15:31:01,333 INFO L290 TraceCheckUtils]: 24: Hoare triple {79707#true} assume 8464 == #t~mem55;havoc #t~mem55; {79707#true} is VALID [2022-04-27 15:31:01,333 INFO L290 TraceCheckUtils]: 25: Hoare triple {79707#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; {79707#true} is VALID [2022-04-27 15:31:01,334 INFO L290 TraceCheckUtils]: 26: Hoare triple {79707#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {79707#true} is VALID [2022-04-27 15:31:01,334 INFO L290 TraceCheckUtils]: 27: Hoare triple {79707#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); {79707#true} is VALID [2022-04-27 15:31:01,334 INFO L290 TraceCheckUtils]: 28: Hoare triple {79707#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); {79707#true} is VALID [2022-04-27 15:31:01,334 INFO L290 TraceCheckUtils]: 29: Hoare triple {79707#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {79707#true} is VALID [2022-04-27 15:31:01,334 INFO L290 TraceCheckUtils]: 30: Hoare triple {79707#true} ~skip~0 := 0; {79707#true} is VALID [2022-04-27 15:31:01,334 INFO L290 TraceCheckUtils]: 31: Hoare triple {79707#true} assume !false; {79707#true} is VALID [2022-04-27 15:31:01,334 INFO L290 TraceCheckUtils]: 32: Hoare triple {79707#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); {79707#true} is VALID [2022-04-27 15:31:01,334 INFO L290 TraceCheckUtils]: 33: Hoare triple {79707#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {79707#true} is VALID [2022-04-27 15:31:01,334 INFO L290 TraceCheckUtils]: 34: Hoare triple {79707#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {79707#true} is VALID [2022-04-27 15:31:01,334 INFO L290 TraceCheckUtils]: 35: Hoare triple {79707#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {79707#true} is VALID [2022-04-27 15:31:01,334 INFO L290 TraceCheckUtils]: 36: Hoare triple {79707#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {79707#true} is VALID [2022-04-27 15:31:01,334 INFO L290 TraceCheckUtils]: 37: Hoare triple {79707#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {79707#true} is VALID [2022-04-27 15:31:01,334 INFO L290 TraceCheckUtils]: 38: Hoare triple {79707#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {79707#true} is VALID [2022-04-27 15:31:01,334 INFO L290 TraceCheckUtils]: 39: Hoare triple {79707#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {79707#true} is VALID [2022-04-27 15:31:01,334 INFO L290 TraceCheckUtils]: 40: Hoare triple {79707#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {79707#true} is VALID [2022-04-27 15:31:01,334 INFO L290 TraceCheckUtils]: 41: Hoare triple {79707#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {79707#true} is VALID [2022-04-27 15:31:01,334 INFO L290 TraceCheckUtils]: 42: Hoare triple {79707#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {79707#true} is VALID [2022-04-27 15:31:01,334 INFO L290 TraceCheckUtils]: 43: Hoare triple {79707#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {79707#true} is VALID [2022-04-27 15:31:01,335 INFO L290 TraceCheckUtils]: 44: Hoare triple {79707#true} assume 8496 == #t~mem58;havoc #t~mem58; {79707#true} is VALID [2022-04-27 15:31:01,335 INFO L290 TraceCheckUtils]: 45: Hoare triple {79707#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {79707#true} is VALID [2022-04-27 15:31:01,335 INFO L290 TraceCheckUtils]: 46: Hoare triple {79707#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {79707#true} is VALID [2022-04-27 15:31:01,335 INFO L290 TraceCheckUtils]: 47: Hoare triple {79707#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {79707#true} is VALID [2022-04-27 15:31:01,335 INFO L290 TraceCheckUtils]: 48: Hoare triple {79707#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {79707#true} is VALID [2022-04-27 15:31:01,335 INFO L290 TraceCheckUtils]: 49: Hoare triple {79707#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {79707#true} is VALID [2022-04-27 15:31:01,335 INFO L290 TraceCheckUtils]: 50: Hoare triple {79707#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); {79707#true} is VALID [2022-04-27 15:31:01,335 INFO L290 TraceCheckUtils]: 51: Hoare triple {79707#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {79707#true} is VALID [2022-04-27 15:31:01,335 INFO L290 TraceCheckUtils]: 52: Hoare triple {79707#true} ~skip~0 := 0; {79707#true} is VALID [2022-04-27 15:31:01,335 INFO L290 TraceCheckUtils]: 53: Hoare triple {79707#true} assume !false; {79707#true} is VALID [2022-04-27 15:31:01,335 INFO L290 TraceCheckUtils]: 54: Hoare triple {79707#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); {79707#true} is VALID [2022-04-27 15:31:01,335 INFO L290 TraceCheckUtils]: 55: Hoare triple {79707#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {79707#true} is VALID [2022-04-27 15:31:01,335 INFO L290 TraceCheckUtils]: 56: Hoare triple {79707#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {79707#true} is VALID [2022-04-27 15:31:01,335 INFO L290 TraceCheckUtils]: 57: Hoare triple {79707#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {79707#true} is VALID [2022-04-27 15:31:01,335 INFO L290 TraceCheckUtils]: 58: Hoare triple {79707#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {79707#true} is VALID [2022-04-27 15:31:01,335 INFO L290 TraceCheckUtils]: 59: Hoare triple {79707#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {79707#true} is VALID [2022-04-27 15:31:01,335 INFO L290 TraceCheckUtils]: 60: Hoare triple {79707#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {79707#true} is VALID [2022-04-27 15:31:01,336 INFO L290 TraceCheckUtils]: 61: Hoare triple {79707#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {79707#true} is VALID [2022-04-27 15:31:01,336 INFO L290 TraceCheckUtils]: 62: Hoare triple {79707#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {79707#true} is VALID [2022-04-27 15:31:01,336 INFO L290 TraceCheckUtils]: 63: Hoare triple {79707#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {79707#true} is VALID [2022-04-27 15:31:01,336 INFO L290 TraceCheckUtils]: 64: Hoare triple {79707#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {79707#true} is VALID [2022-04-27 15:31:01,336 INFO L290 TraceCheckUtils]: 65: Hoare triple {79707#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {79707#true} is VALID [2022-04-27 15:31:01,336 INFO L290 TraceCheckUtils]: 66: Hoare triple {79707#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {79707#true} is VALID [2022-04-27 15:31:01,336 INFO L290 TraceCheckUtils]: 67: Hoare triple {79707#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {79707#true} is VALID [2022-04-27 15:31:01,336 INFO L290 TraceCheckUtils]: 68: Hoare triple {79707#true} assume 8512 == #t~mem60;havoc #t~mem60; {79707#true} is VALID [2022-04-27 15:31:01,336 INFO L290 TraceCheckUtils]: 69: Hoare triple {79707#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); {79707#true} is VALID [2022-04-27 15:31:01,336 INFO L290 TraceCheckUtils]: 70: Hoare triple {79707#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; {79707#true} is VALID [2022-04-27 15:31:01,336 INFO L290 TraceCheckUtils]: 71: Hoare triple {79707#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 6; {79707#true} is VALID [2022-04-27 15:31:01,336 INFO L290 TraceCheckUtils]: 72: Hoare triple {79707#true} assume !(~ret~0 <= 0); {79707#true} is VALID [2022-04-27 15:31:01,336 INFO L290 TraceCheckUtils]: 73: Hoare triple {79707#true} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {79707#true} is VALID [2022-04-27 15:31:01,336 INFO L290 TraceCheckUtils]: 74: Hoare triple {79707#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); {79707#true} is VALID [2022-04-27 15:31:01,336 INFO L290 TraceCheckUtils]: 75: Hoare triple {79707#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {79707#true} is VALID [2022-04-27 15:31:01,336 INFO L290 TraceCheckUtils]: 76: Hoare triple {79707#true} ~skip~0 := 0; {79707#true} is VALID [2022-04-27 15:31:01,336 INFO L290 TraceCheckUtils]: 77: Hoare triple {79707#true} assume !false; {79707#true} is VALID [2022-04-27 15:31:01,336 INFO L290 TraceCheckUtils]: 78: Hoare triple {79707#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); {79707#true} is VALID [2022-04-27 15:31:01,337 INFO L290 TraceCheckUtils]: 79: Hoare triple {79707#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {79707#true} is VALID [2022-04-27 15:31:01,337 INFO L290 TraceCheckUtils]: 80: Hoare triple {79707#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {79707#true} is VALID [2022-04-27 15:31:01,337 INFO L290 TraceCheckUtils]: 81: Hoare triple {79707#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {79707#true} is VALID [2022-04-27 15:31:01,337 INFO L290 TraceCheckUtils]: 82: Hoare triple {79707#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {79707#true} is VALID [2022-04-27 15:31:01,337 INFO L290 TraceCheckUtils]: 83: Hoare triple {79707#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {79707#true} is VALID [2022-04-27 15:31:01,337 INFO L290 TraceCheckUtils]: 84: Hoare triple {79707#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {79707#true} is VALID [2022-04-27 15:31:01,337 INFO L290 TraceCheckUtils]: 85: Hoare triple {79707#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {79707#true} is VALID [2022-04-27 15:31:01,337 INFO L290 TraceCheckUtils]: 86: Hoare triple {79707#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {79707#true} is VALID [2022-04-27 15:31:01,337 INFO L290 TraceCheckUtils]: 87: Hoare triple {79707#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {79707#true} is VALID [2022-04-27 15:31:01,337 INFO L290 TraceCheckUtils]: 88: Hoare triple {79707#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {79707#true} is VALID [2022-04-27 15:31:01,337 INFO L290 TraceCheckUtils]: 89: Hoare triple {79707#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {79707#true} is VALID [2022-04-27 15:31:01,337 INFO L290 TraceCheckUtils]: 90: Hoare triple {79707#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {79707#true} is VALID [2022-04-27 15:31:01,337 INFO L290 TraceCheckUtils]: 91: Hoare triple {79707#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {79707#true} is VALID [2022-04-27 15:31:01,337 INFO L290 TraceCheckUtils]: 92: Hoare triple {79707#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {79707#true} is VALID [2022-04-27 15:31:01,337 INFO L290 TraceCheckUtils]: 93: Hoare triple {79707#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {79707#true} is VALID [2022-04-27 15:31:01,337 INFO L290 TraceCheckUtils]: 94: Hoare triple {79707#true} assume 8528 == #t~mem62;havoc #t~mem62; {79707#true} is VALID [2022-04-27 15:31:01,337 INFO L290 TraceCheckUtils]: 95: Hoare triple {79707#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); {79707#true} is VALID [2022-04-27 15:31:01,338 INFO L290 TraceCheckUtils]: 96: Hoare triple {79707#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; {79707#true} is VALID [2022-04-27 15:31:01,338 INFO L290 TraceCheckUtils]: 97: Hoare triple {79707#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); {79707#true} is VALID [2022-04-27 15:31:01,338 INFO L290 TraceCheckUtils]: 98: Hoare triple {79707#true} assume 0 != #t~mem106;havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {79707#true} is VALID [2022-04-27 15:31:01,338 INFO L290 TraceCheckUtils]: 99: Hoare triple {79707#true} assume -2147483648 <= #t~nondet115 && #t~nondet115 <= 2147483647;~ret~0 := #t~nondet115;havoc #t~nondet115; {79707#true} is VALID [2022-04-27 15:31:01,338 INFO L290 TraceCheckUtils]: 100: Hoare triple {79707#true} assume 6 == ~blastFlag~0;~blastFlag~0 := 7; {79712#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-27 15:31:01,338 INFO L290 TraceCheckUtils]: 101: Hoare triple {79712#(<= ssl3_accept_~blastFlag~0 7)} assume !(~ret~0 <= 0); {79712#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-27 15:31:01,339 INFO L290 TraceCheckUtils]: 102: Hoare triple {79712#(<= 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); {79712#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-27 15:31:01,339 INFO L290 TraceCheckUtils]: 103: Hoare triple {79712#(<= 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); {79712#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-27 15:31:01,339 INFO L290 TraceCheckUtils]: 104: Hoare triple {79712#(<= ssl3_accept_~blastFlag~0 7)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {79712#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-27 15:31:01,339 INFO L290 TraceCheckUtils]: 105: Hoare triple {79712#(<= ssl3_accept_~blastFlag~0 7)} ~skip~0 := 0; {79712#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-27 15:31:01,340 INFO L290 TraceCheckUtils]: 106: Hoare triple {79712#(<= ssl3_accept_~blastFlag~0 7)} assume !false; {79712#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-27 15:31:01,340 INFO L290 TraceCheckUtils]: 107: Hoare triple {79712#(<= 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); {79712#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-27 15:31:01,340 INFO L290 TraceCheckUtils]: 108: Hoare triple {79712#(<= ssl3_accept_~blastFlag~0 7)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {79712#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-27 15:31:01,340 INFO L290 TraceCheckUtils]: 109: Hoare triple {79712#(<= ssl3_accept_~blastFlag~0 7)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {79712#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-27 15:31:01,341 INFO L290 TraceCheckUtils]: 110: Hoare triple {79712#(<= ssl3_accept_~blastFlag~0 7)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {79712#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-27 15:31:01,341 INFO L290 TraceCheckUtils]: 111: Hoare triple {79712#(<= ssl3_accept_~blastFlag~0 7)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {79712#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-27 15:31:01,341 INFO L290 TraceCheckUtils]: 112: Hoare triple {79712#(<= ssl3_accept_~blastFlag~0 7)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {79712#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-27 15:31:01,341 INFO L290 TraceCheckUtils]: 113: Hoare triple {79712#(<= ssl3_accept_~blastFlag~0 7)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {79712#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-27 15:31:01,341 INFO L290 TraceCheckUtils]: 114: Hoare triple {79712#(<= ssl3_accept_~blastFlag~0 7)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {79712#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-27 15:31:01,342 INFO L290 TraceCheckUtils]: 115: Hoare triple {79712#(<= ssl3_accept_~blastFlag~0 7)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {79712#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-27 15:31:01,342 INFO L290 TraceCheckUtils]: 116: Hoare triple {79712#(<= ssl3_accept_~blastFlag~0 7)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {79712#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-27 15:31:01,342 INFO L290 TraceCheckUtils]: 117: Hoare triple {79712#(<= ssl3_accept_~blastFlag~0 7)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {79712#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-27 15:31:01,342 INFO L290 TraceCheckUtils]: 118: Hoare triple {79712#(<= ssl3_accept_~blastFlag~0 7)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {79712#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-27 15:31:01,343 INFO L290 TraceCheckUtils]: 119: Hoare triple {79712#(<= ssl3_accept_~blastFlag~0 7)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {79712#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-27 15:31:01,343 INFO L290 TraceCheckUtils]: 120: Hoare triple {79712#(<= ssl3_accept_~blastFlag~0 7)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {79712#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-27 15:31:01,343 INFO L290 TraceCheckUtils]: 121: Hoare triple {79712#(<= ssl3_accept_~blastFlag~0 7)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {79712#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-27 15:31:01,343 INFO L290 TraceCheckUtils]: 122: Hoare triple {79712#(<= ssl3_accept_~blastFlag~0 7)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {79712#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-27 15:31:01,344 INFO L290 TraceCheckUtils]: 123: Hoare triple {79712#(<= ssl3_accept_~blastFlag~0 7)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {79712#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-27 15:31:01,344 INFO L290 TraceCheckUtils]: 124: Hoare triple {79712#(<= ssl3_accept_~blastFlag~0 7)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {79712#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-27 15:31:01,344 INFO L290 TraceCheckUtils]: 125: Hoare triple {79712#(<= ssl3_accept_~blastFlag~0 7)} assume 8544 == #t~mem64;havoc #t~mem64; {79712#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-27 15:31:01,344 INFO L290 TraceCheckUtils]: 126: Hoare triple {79712#(<= ssl3_accept_~blastFlag~0 7)} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {79712#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-27 15:31:01,345 INFO L290 TraceCheckUtils]: 127: Hoare triple {79712#(<= 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); {79712#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-27 15:31:01,345 INFO L290 TraceCheckUtils]: 128: Hoare triple {79712#(<= 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; {79712#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-27 15:31:01,345 INFO L290 TraceCheckUtils]: 129: Hoare triple {79712#(<= 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); {79712#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-27 15:31:01,345 INFO L290 TraceCheckUtils]: 130: Hoare triple {79712#(<= 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; {79712#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-27 15:31:01,346 INFO L290 TraceCheckUtils]: 131: Hoare triple {79712#(<= 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; {79712#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-27 15:31:01,346 INFO L290 TraceCheckUtils]: 132: Hoare triple {79712#(<= ssl3_accept_~blastFlag~0 7)} assume 8 == ~blastFlag~0; {79708#false} is VALID [2022-04-27 15:31:01,346 INFO L290 TraceCheckUtils]: 133: Hoare triple {79708#false} assume !false; {79708#false} is VALID [2022-04-27 15:31:01,346 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-27 15:31:01,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:31:01,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164003595] [2022-04-27 15:31:01,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164003595] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:31:01,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:31:01,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:31:01,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66832345] [2022-04-27 15:31:01,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:31:01,347 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-27 15:31:01,347 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:31:01,347 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-27 15:31:01,410 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-27 15:31:01,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:31:01,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:31:01,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:31:01,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:31:01,411 INFO L87 Difference]: Start difference. First operand 1320 states and 1971 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-27 15:31:04,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:31:04,082 INFO L93 Difference]: Finished difference Result 1761 states and 2635 transitions. [2022-04-27 15:31:04,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:31:04,083 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-27 15:31:04,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:31:04,083 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-27 15:31:04,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 412 transitions. [2022-04-27 15:31:04,084 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-27 15:31:04,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 412 transitions. [2022-04-27 15:31:04,085 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 412 transitions. [2022-04-27 15:31:04,312 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-27 15:31:04,419 INFO L225 Difference]: With dead ends: 1761 [2022-04-27 15:31:04,419 INFO L226 Difference]: Without dead ends: 1759 [2022-04-27 15:31:04,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:31:04,420 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 165 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:31:04,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 378 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-27 15:31:04,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1759 states. [2022-04-27 15:31:04,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1759 to 1757. [2022-04-27 15:31:04,530 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:31:04,532 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1759 states. Second operand has 1757 states, 1752 states have (on average 1.5) internal successors, (2628), 1752 states have internal predecessors, (2628), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:04,533 INFO L74 IsIncluded]: Start isIncluded. First operand 1759 states. Second operand has 1757 states, 1752 states have (on average 1.5) internal successors, (2628), 1752 states have internal predecessors, (2628), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:04,533 INFO L87 Difference]: Start difference. First operand 1759 states. Second operand has 1757 states, 1752 states have (on average 1.5) internal successors, (2628), 1752 states have internal predecessors, (2628), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:04,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:31:04,611 INFO L93 Difference]: Finished difference Result 1759 states and 2633 transitions. [2022-04-27 15:31:04,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1759 states and 2633 transitions. [2022-04-27 15:31:04,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:31:04,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:31:04,614 INFO L74 IsIncluded]: Start isIncluded. First operand has 1757 states, 1752 states have (on average 1.5) internal successors, (2628), 1752 states have internal predecessors, (2628), 3 states have call successors, (3), 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 1759 states. [2022-04-27 15:31:04,615 INFO L87 Difference]: Start difference. First operand has 1757 states, 1752 states have (on average 1.5) internal successors, (2628), 1752 states have internal predecessors, (2628), 3 states have call successors, (3), 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 1759 states. [2022-04-27 15:31:04,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:31:04,693 INFO L93 Difference]: Finished difference Result 1759 states and 2633 transitions. [2022-04-27 15:31:04,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1759 states and 2633 transitions. [2022-04-27 15:31:04,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:31:04,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:31:04,698 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:31:04,698 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:31:04,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1757 states, 1752 states have (on average 1.5) internal successors, (2628), 1752 states have internal predecessors, (2628), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:04,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1757 states to 1757 states and 2632 transitions. [2022-04-27 15:31:04,785 INFO L78 Accepts]: Start accepts. Automaton has 1757 states and 2632 transitions. Word has length 134 [2022-04-27 15:31:04,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:31:04,793 INFO L495 AbstractCegarLoop]: Abstraction has 1757 states and 2632 transitions. [2022-04-27 15:31:04,793 INFO L496 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-27 15:31:04,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1757 states and 2632 transitions. [2022-04-27 15:31:04,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-04-27 15:31:04,794 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:31:04,795 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:31:04,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-04-27 15:31:04,795 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:31:04,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:31:04,795 INFO L85 PathProgramCache]: Analyzing trace with hash -924650012, now seen corresponding path program 1 times [2022-04-27 15:31:04,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:31:04,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634320168] [2022-04-27 15:31:04,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:31:04,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:31:04,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:31:04,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:31:04,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:31:04,990 INFO L290 TraceCheckUtils]: 0: Hoare triple {87119#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {87112#true} is VALID [2022-04-27 15:31:04,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {87112#true} assume true; {87112#true} is VALID [2022-04-27 15:31:04,990 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {87112#true} {87112#true} #689#return; {87112#true} is VALID [2022-04-27 15:31:04,991 INFO L272 TraceCheckUtils]: 0: Hoare triple {87112#true} call ULTIMATE.init(); {87119#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:31:04,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {87119#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {87112#true} is VALID [2022-04-27 15:31:04,991 INFO L290 TraceCheckUtils]: 2: Hoare triple {87112#true} assume true; {87112#true} is VALID [2022-04-27 15:31:04,991 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {87112#true} {87112#true} #689#return; {87112#true} is VALID [2022-04-27 15:31:04,991 INFO L272 TraceCheckUtils]: 4: Hoare triple {87112#true} call #t~ret161 := main(); {87112#true} is VALID [2022-04-27 15:31:04,991 INFO L290 TraceCheckUtils]: 5: Hoare triple {87112#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; {87112#true} is VALID [2022-04-27 15:31:04,991 INFO L290 TraceCheckUtils]: 6: Hoare triple {87112#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {87112#true} is VALID [2022-04-27 15:31:04,991 INFO L272 TraceCheckUtils]: 7: Hoare triple {87112#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {87112#true} is VALID [2022-04-27 15:31:04,991 INFO L290 TraceCheckUtils]: 8: Hoare triple {87112#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); {87112#true} is VALID [2022-04-27 15:31:04,991 INFO L290 TraceCheckUtils]: 9: Hoare triple {87112#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; {87112#true} is VALID [2022-04-27 15:31:04,991 INFO L290 TraceCheckUtils]: 10: Hoare triple {87112#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; {87112#true} is VALID [2022-04-27 15:31:04,991 INFO L290 TraceCheckUtils]: 11: Hoare triple {87112#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {87112#true} is VALID [2022-04-27 15:31:04,992 INFO L290 TraceCheckUtils]: 12: Hoare triple {87112#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {87112#true} is VALID [2022-04-27 15:31:04,992 INFO L290 TraceCheckUtils]: 13: Hoare triple {87112#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {87112#true} is VALID [2022-04-27 15:31:04,992 INFO L290 TraceCheckUtils]: 14: Hoare triple {87112#true} assume !false; {87112#true} is VALID [2022-04-27 15:31:04,992 INFO L290 TraceCheckUtils]: 15: Hoare triple {87112#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); {87112#true} is VALID [2022-04-27 15:31:04,992 INFO L290 TraceCheckUtils]: 16: Hoare triple {87112#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {87112#true} is VALID [2022-04-27 15:31:04,992 INFO L290 TraceCheckUtils]: 17: Hoare triple {87112#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {87112#true} is VALID [2022-04-27 15:31:04,992 INFO L290 TraceCheckUtils]: 18: Hoare triple {87112#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {87112#true} is VALID [2022-04-27 15:31:04,992 INFO L290 TraceCheckUtils]: 19: Hoare triple {87112#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {87112#true} is VALID [2022-04-27 15:31:04,992 INFO L290 TraceCheckUtils]: 20: Hoare triple {87112#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {87112#true} is VALID [2022-04-27 15:31:04,992 INFO L290 TraceCheckUtils]: 21: Hoare triple {87112#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {87112#true} is VALID [2022-04-27 15:31:04,992 INFO L290 TraceCheckUtils]: 22: Hoare triple {87112#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {87112#true} is VALID [2022-04-27 15:31:04,992 INFO L290 TraceCheckUtils]: 23: Hoare triple {87112#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {87112#true} is VALID [2022-04-27 15:31:04,992 INFO L290 TraceCheckUtils]: 24: Hoare triple {87112#true} assume 8464 == #t~mem55;havoc #t~mem55; {87112#true} is VALID [2022-04-27 15:31:04,992 INFO L290 TraceCheckUtils]: 25: Hoare triple {87112#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; {87112#true} is VALID [2022-04-27 15:31:04,992 INFO L290 TraceCheckUtils]: 26: Hoare triple {87112#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {87112#true} is VALID [2022-04-27 15:31:04,992 INFO L290 TraceCheckUtils]: 27: Hoare triple {87112#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); {87112#true} is VALID [2022-04-27 15:31:04,992 INFO L290 TraceCheckUtils]: 28: Hoare triple {87112#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); {87112#true} is VALID [2022-04-27 15:31:04,992 INFO L290 TraceCheckUtils]: 29: Hoare triple {87112#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {87112#true} is VALID [2022-04-27 15:31:04,993 INFO L290 TraceCheckUtils]: 30: Hoare triple {87112#true} ~skip~0 := 0; {87112#true} is VALID [2022-04-27 15:31:04,993 INFO L290 TraceCheckUtils]: 31: Hoare triple {87112#true} assume !false; {87112#true} is VALID [2022-04-27 15:31:04,993 INFO L290 TraceCheckUtils]: 32: Hoare triple {87112#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); {87112#true} is VALID [2022-04-27 15:31:04,993 INFO L290 TraceCheckUtils]: 33: Hoare triple {87112#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {87112#true} is VALID [2022-04-27 15:31:04,993 INFO L290 TraceCheckUtils]: 34: Hoare triple {87112#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {87112#true} is VALID [2022-04-27 15:31:04,993 INFO L290 TraceCheckUtils]: 35: Hoare triple {87112#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {87112#true} is VALID [2022-04-27 15:31:04,993 INFO L290 TraceCheckUtils]: 36: Hoare triple {87112#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {87112#true} is VALID [2022-04-27 15:31:04,993 INFO L290 TraceCheckUtils]: 37: Hoare triple {87112#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {87112#true} is VALID [2022-04-27 15:31:04,993 INFO L290 TraceCheckUtils]: 38: Hoare triple {87112#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {87112#true} is VALID [2022-04-27 15:31:04,993 INFO L290 TraceCheckUtils]: 39: Hoare triple {87112#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {87112#true} is VALID [2022-04-27 15:31:04,993 INFO L290 TraceCheckUtils]: 40: Hoare triple {87112#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {87112#true} is VALID [2022-04-27 15:31:04,993 INFO L290 TraceCheckUtils]: 41: Hoare triple {87112#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {87112#true} is VALID [2022-04-27 15:31:04,993 INFO L290 TraceCheckUtils]: 42: Hoare triple {87112#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {87112#true} is VALID [2022-04-27 15:31:04,993 INFO L290 TraceCheckUtils]: 43: Hoare triple {87112#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {87112#true} is VALID [2022-04-27 15:31:04,993 INFO L290 TraceCheckUtils]: 44: Hoare triple {87112#true} assume 8496 == #t~mem58;havoc #t~mem58; {87112#true} is VALID [2022-04-27 15:31:04,993 INFO L290 TraceCheckUtils]: 45: Hoare triple {87112#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {87112#true} is VALID [2022-04-27 15:31:04,993 INFO L290 TraceCheckUtils]: 46: Hoare triple {87112#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {87112#true} is VALID [2022-04-27 15:31:04,993 INFO L290 TraceCheckUtils]: 47: Hoare triple {87112#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {87112#true} is VALID [2022-04-27 15:31:04,993 INFO L290 TraceCheckUtils]: 48: Hoare triple {87112#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {87112#true} is VALID [2022-04-27 15:31:04,994 INFO L290 TraceCheckUtils]: 49: Hoare triple {87112#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {87112#true} is VALID [2022-04-27 15:31:04,994 INFO L290 TraceCheckUtils]: 50: Hoare triple {87112#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); {87112#true} is VALID [2022-04-27 15:31:04,994 INFO L290 TraceCheckUtils]: 51: Hoare triple {87112#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {87112#true} is VALID [2022-04-27 15:31:04,994 INFO L290 TraceCheckUtils]: 52: Hoare triple {87112#true} ~skip~0 := 0; {87112#true} is VALID [2022-04-27 15:31:04,994 INFO L290 TraceCheckUtils]: 53: Hoare triple {87112#true} assume !false; {87112#true} is VALID [2022-04-27 15:31:04,994 INFO L290 TraceCheckUtils]: 54: Hoare triple {87112#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); {87112#true} is VALID [2022-04-27 15:31:04,994 INFO L290 TraceCheckUtils]: 55: Hoare triple {87112#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {87112#true} is VALID [2022-04-27 15:31:04,994 INFO L290 TraceCheckUtils]: 56: Hoare triple {87112#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {87112#true} is VALID [2022-04-27 15:31:04,994 INFO L290 TraceCheckUtils]: 57: Hoare triple {87112#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {87112#true} is VALID [2022-04-27 15:31:04,994 INFO L290 TraceCheckUtils]: 58: Hoare triple {87112#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {87112#true} is VALID [2022-04-27 15:31:04,994 INFO L290 TraceCheckUtils]: 59: Hoare triple {87112#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {87112#true} is VALID [2022-04-27 15:31:04,994 INFO L290 TraceCheckUtils]: 60: Hoare triple {87112#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {87112#true} is VALID [2022-04-27 15:31:04,994 INFO L290 TraceCheckUtils]: 61: Hoare triple {87112#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {87112#true} is VALID [2022-04-27 15:31:04,994 INFO L290 TraceCheckUtils]: 62: Hoare triple {87112#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {87112#true} is VALID [2022-04-27 15:31:04,994 INFO L290 TraceCheckUtils]: 63: Hoare triple {87112#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {87112#true} is VALID [2022-04-27 15:31:04,994 INFO L290 TraceCheckUtils]: 64: Hoare triple {87112#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {87112#true} is VALID [2022-04-27 15:31:04,994 INFO L290 TraceCheckUtils]: 65: Hoare triple {87112#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {87112#true} is VALID [2022-04-27 15:31:04,994 INFO L290 TraceCheckUtils]: 66: Hoare triple {87112#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {87112#true} is VALID [2022-04-27 15:31:04,995 INFO L290 TraceCheckUtils]: 67: Hoare triple {87112#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {87112#true} is VALID [2022-04-27 15:31:04,995 INFO L290 TraceCheckUtils]: 68: Hoare triple {87112#true} assume 8512 == #t~mem60;havoc #t~mem60; {87112#true} is VALID [2022-04-27 15:31:04,995 INFO L290 TraceCheckUtils]: 69: Hoare triple {87112#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); {87112#true} is VALID [2022-04-27 15:31:04,995 INFO L290 TraceCheckUtils]: 70: Hoare triple {87112#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; {87112#true} is VALID [2022-04-27 15:31:04,995 INFO L290 TraceCheckUtils]: 71: Hoare triple {87112#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 6; {87112#true} is VALID [2022-04-27 15:31:04,995 INFO L290 TraceCheckUtils]: 72: Hoare triple {87112#true} assume !(~ret~0 <= 0); {87112#true} is VALID [2022-04-27 15:31:04,996 INFO L290 TraceCheckUtils]: 73: Hoare triple {87112#true} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {87117#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:31:04,996 INFO L290 TraceCheckUtils]: 74: Hoare triple {87117#(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); {87117#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:31:04,996 INFO L290 TraceCheckUtils]: 75: Hoare triple {87117#(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; {87117#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:31:04,997 INFO L290 TraceCheckUtils]: 76: Hoare triple {87117#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {87117#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:31:04,997 INFO L290 TraceCheckUtils]: 77: Hoare triple {87117#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {87117#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:31:04,997 INFO L290 TraceCheckUtils]: 78: Hoare triple {87117#(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); {87117#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:31:04,998 INFO L290 TraceCheckUtils]: 79: Hoare triple {87117#(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); {87117#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:31:04,998 INFO L290 TraceCheckUtils]: 80: Hoare triple {87117#(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); {87117#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:31:04,998 INFO L290 TraceCheckUtils]: 81: Hoare triple {87117#(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); {87117#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:31:05,001 INFO L290 TraceCheckUtils]: 82: Hoare triple {87117#(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); {87117#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:31:05,002 INFO L290 TraceCheckUtils]: 83: Hoare triple {87117#(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); {87117#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:31:05,002 INFO L290 TraceCheckUtils]: 84: Hoare triple {87117#(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); {87117#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:31:05,002 INFO L290 TraceCheckUtils]: 85: Hoare triple {87117#(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); {87117#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:31:05,003 INFO L290 TraceCheckUtils]: 86: Hoare triple {87117#(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); {87117#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:31:05,003 INFO L290 TraceCheckUtils]: 87: Hoare triple {87117#(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); {87117#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:31:05,003 INFO L290 TraceCheckUtils]: 88: Hoare triple {87117#(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); {87117#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:31:05,004 INFO L290 TraceCheckUtils]: 89: Hoare triple {87117#(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); {87117#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:31:05,004 INFO L290 TraceCheckUtils]: 90: Hoare triple {87117#(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); {87117#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:31:05,004 INFO L290 TraceCheckUtils]: 91: Hoare triple {87117#(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); {87117#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:31:05,005 INFO L290 TraceCheckUtils]: 92: Hoare triple {87117#(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); {87117#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:31:05,005 INFO L290 TraceCheckUtils]: 93: Hoare triple {87117#(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); {87117#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:31:05,005 INFO L290 TraceCheckUtils]: 94: Hoare triple {87117#(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); {87117#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:31:05,006 INFO L290 TraceCheckUtils]: 95: Hoare triple {87117#(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); {87117#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:31:05,006 INFO L290 TraceCheckUtils]: 96: Hoare triple {87117#(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); {87117#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:31:05,015 INFO L290 TraceCheckUtils]: 97: Hoare triple {87117#(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); {87117#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:31:05,016 INFO L290 TraceCheckUtils]: 98: Hoare triple {87117#(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); {87117#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:31:05,016 INFO L290 TraceCheckUtils]: 99: Hoare triple {87117#(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); {87118#(not (= 8448 |ssl3_accept_#t~mem68|))} is VALID [2022-04-27 15:31:05,016 INFO L290 TraceCheckUtils]: 100: Hoare triple {87118#(not (= 8448 |ssl3_accept_#t~mem68|))} assume 8448 == #t~mem68;havoc #t~mem68; {87113#false} is VALID [2022-04-27 15:31:05,016 INFO L290 TraceCheckUtils]: 101: Hoare triple {87113#false} assume !(~num1~0 > 0); {87113#false} is VALID [2022-04-27 15:31:05,016 INFO L290 TraceCheckUtils]: 102: Hoare triple {87113#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; {87113#false} is VALID [2022-04-27 15:31:05,017 INFO L290 TraceCheckUtils]: 103: Hoare triple {87113#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); {87113#false} is VALID [2022-04-27 15:31:05,017 INFO L290 TraceCheckUtils]: 104: Hoare triple {87113#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {87113#false} is VALID [2022-04-27 15:31:05,017 INFO L290 TraceCheckUtils]: 105: Hoare triple {87113#false} ~skip~0 := 0; {87113#false} is VALID [2022-04-27 15:31:05,017 INFO L290 TraceCheckUtils]: 106: Hoare triple {87113#false} assume !false; {87113#false} is VALID [2022-04-27 15:31:05,017 INFO L290 TraceCheckUtils]: 107: Hoare triple {87113#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); {87113#false} is VALID [2022-04-27 15:31:05,017 INFO L290 TraceCheckUtils]: 108: Hoare triple {87113#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {87113#false} is VALID [2022-04-27 15:31:05,017 INFO L290 TraceCheckUtils]: 109: Hoare triple {87113#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {87113#false} is VALID [2022-04-27 15:31:05,017 INFO L290 TraceCheckUtils]: 110: Hoare triple {87113#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {87113#false} is VALID [2022-04-27 15:31:05,017 INFO L290 TraceCheckUtils]: 111: Hoare triple {87113#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {87113#false} is VALID [2022-04-27 15:31:05,017 INFO L290 TraceCheckUtils]: 112: Hoare triple {87113#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {87113#false} is VALID [2022-04-27 15:31:05,017 INFO L290 TraceCheckUtils]: 113: Hoare triple {87113#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {87113#false} is VALID [2022-04-27 15:31:05,017 INFO L290 TraceCheckUtils]: 114: Hoare triple {87113#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {87113#false} is VALID [2022-04-27 15:31:05,017 INFO L290 TraceCheckUtils]: 115: Hoare triple {87113#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {87113#false} is VALID [2022-04-27 15:31:05,017 INFO L290 TraceCheckUtils]: 116: Hoare triple {87113#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {87113#false} is VALID [2022-04-27 15:31:05,017 INFO L290 TraceCheckUtils]: 117: Hoare triple {87113#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {87113#false} is VALID [2022-04-27 15:31:05,017 INFO L290 TraceCheckUtils]: 118: Hoare triple {87113#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {87113#false} is VALID [2022-04-27 15:31:05,017 INFO L290 TraceCheckUtils]: 119: Hoare triple {87113#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {87113#false} is VALID [2022-04-27 15:31:05,018 INFO L290 TraceCheckUtils]: 120: Hoare triple {87113#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {87113#false} is VALID [2022-04-27 15:31:05,018 INFO L290 TraceCheckUtils]: 121: Hoare triple {87113#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {87113#false} is VALID [2022-04-27 15:31:05,018 INFO L290 TraceCheckUtils]: 122: Hoare triple {87113#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {87113#false} is VALID [2022-04-27 15:31:05,018 INFO L290 TraceCheckUtils]: 123: Hoare triple {87113#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {87113#false} is VALID [2022-04-27 15:31:05,018 INFO L290 TraceCheckUtils]: 124: Hoare triple {87113#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {87113#false} is VALID [2022-04-27 15:31:05,018 INFO L290 TraceCheckUtils]: 125: Hoare triple {87113#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {87113#false} is VALID [2022-04-27 15:31:05,018 INFO L290 TraceCheckUtils]: 126: Hoare triple {87113#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {87113#false} is VALID [2022-04-27 15:31:05,018 INFO L290 TraceCheckUtils]: 127: Hoare triple {87113#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {87113#false} is VALID [2022-04-27 15:31:05,018 INFO L290 TraceCheckUtils]: 128: Hoare triple {87113#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {87113#false} is VALID [2022-04-27 15:31:05,018 INFO L290 TraceCheckUtils]: 129: Hoare triple {87113#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {87113#false} is VALID [2022-04-27 15:31:05,018 INFO L290 TraceCheckUtils]: 130: Hoare triple {87113#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {87113#false} is VALID [2022-04-27 15:31:05,018 INFO L290 TraceCheckUtils]: 131: Hoare triple {87113#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {87113#false} is VALID [2022-04-27 15:31:05,018 INFO L290 TraceCheckUtils]: 132: Hoare triple {87113#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {87113#false} is VALID [2022-04-27 15:31:05,018 INFO L290 TraceCheckUtils]: 133: Hoare triple {87113#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {87113#false} is VALID [2022-04-27 15:31:05,018 INFO L290 TraceCheckUtils]: 134: Hoare triple {87113#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {87113#false} is VALID [2022-04-27 15:31:05,018 INFO L290 TraceCheckUtils]: 135: Hoare triple {87113#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {87113#false} is VALID [2022-04-27 15:31:05,018 INFO L290 TraceCheckUtils]: 136: Hoare triple {87113#false} assume 8640 == #t~mem75;havoc #t~mem75; {87113#false} is VALID [2022-04-27 15:31:05,018 INFO L290 TraceCheckUtils]: 137: Hoare triple {87113#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {87113#false} is VALID [2022-04-27 15:31:05,019 INFO L290 TraceCheckUtils]: 138: Hoare triple {87113#false} assume 4 == ~blastFlag~0; {87113#false} is VALID [2022-04-27 15:31:05,019 INFO L290 TraceCheckUtils]: 139: Hoare triple {87113#false} assume !false; {87113#false} is VALID [2022-04-27 15:31:05,019 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-27 15:31:05,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:31:05,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634320168] [2022-04-27 15:31:05,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634320168] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:31:05,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:31:05,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:31:05,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159129875] [2022-04-27 15:31:05,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:31:05,021 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-27 15:31:05,021 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:31:05,021 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:05,118 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:31:05,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:31:05,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:31:05,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:31:05,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:31:05,119 INFO L87 Difference]: Start difference. First operand 1757 states and 2632 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:09,118 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:31:13,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:31:13,064 INFO L93 Difference]: Finished difference Result 4073 states and 6093 transitions. [2022-04-27 15:31:13,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:31:13,064 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-27 15:31:13,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:31:13,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:13,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 576 transitions. [2022-04-27 15:31:13,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:13,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 576 transitions. [2022-04-27 15:31:13,068 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 576 transitions. [2022-04-27 15:31:13,451 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 576 edges. 576 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:31:13,622 INFO L225 Difference]: With dead ends: 4073 [2022-04-27 15:31:13,623 INFO L226 Difference]: Without dead ends: 2344 [2022-04-27 15:31:13,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:31:13,624 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 116 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 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, 2.9s IncrementalHoareTripleChecker+Time [2022-04-27 15:31:13,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 376 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-04-27 15:31:13,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2344 states. [2022-04-27 15:31:13,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2344 to 1993. [2022-04-27 15:31:13,751 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:31:13,753 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2344 states. Second operand has 1993 states, 1988 states have (on average 1.4974849094567404) internal successors, (2977), 1988 states have internal predecessors, (2977), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:13,754 INFO L74 IsIncluded]: Start isIncluded. First operand 2344 states. Second operand has 1993 states, 1988 states have (on average 1.4974849094567404) internal successors, (2977), 1988 states have internal predecessors, (2977), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:13,755 INFO L87 Difference]: Start difference. First operand 2344 states. Second operand has 1993 states, 1988 states have (on average 1.4974849094567404) internal successors, (2977), 1988 states have internal predecessors, (2977), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:13,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:31:13,888 INFO L93 Difference]: Finished difference Result 2344 states and 3478 transitions. [2022-04-27 15:31:13,888 INFO L276 IsEmpty]: Start isEmpty. Operand 2344 states and 3478 transitions. [2022-04-27 15:31:13,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:31:13,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:31:13,892 INFO L74 IsIncluded]: Start isIncluded. First operand has 1993 states, 1988 states have (on average 1.4974849094567404) internal successors, (2977), 1988 states have internal predecessors, (2977), 3 states have call successors, (3), 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 2344 states. [2022-04-27 15:31:13,893 INFO L87 Difference]: Start difference. First operand has 1993 states, 1988 states have (on average 1.4974849094567404) internal successors, (2977), 1988 states have internal predecessors, (2977), 3 states have call successors, (3), 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 2344 states. [2022-04-27 15:31:14,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:31:14,025 INFO L93 Difference]: Finished difference Result 2344 states and 3478 transitions. [2022-04-27 15:31:14,025 INFO L276 IsEmpty]: Start isEmpty. Operand 2344 states and 3478 transitions. [2022-04-27 15:31:14,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:31:14,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:31:14,027 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:31:14,027 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:31:14,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1993 states, 1988 states have (on average 1.4974849094567404) internal successors, (2977), 1988 states have internal predecessors, (2977), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:14,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1993 states to 1993 states and 2981 transitions. [2022-04-27 15:31:14,136 INFO L78 Accepts]: Start accepts. Automaton has 1993 states and 2981 transitions. Word has length 140 [2022-04-27 15:31:14,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:31:14,137 INFO L495 AbstractCegarLoop]: Abstraction has 1993 states and 2981 transitions. [2022-04-27 15:31:14,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:14,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1993 states and 2981 transitions. [2022-04-27 15:31:14,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-04-27 15:31:14,138 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:31:14,138 INFO L195 NwaCegarLoop]: 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-27 15:31:14,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-04-27 15:31:14,138 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:31:14,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:31:14,139 INFO L85 PathProgramCache]: Analyzing trace with hash -516884985, now seen corresponding path program 1 times [2022-04-27 15:31:14,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:31:14,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110646332] [2022-04-27 15:31:14,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:31:14,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:31:14,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:31:14,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:31:14,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:31:14,242 INFO L290 TraceCheckUtils]: 0: Hoare triple {98514#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {98507#true} is VALID [2022-04-27 15:31:14,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {98507#true} assume true; {98507#true} is VALID [2022-04-27 15:31:14,242 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {98507#true} {98507#true} #689#return; {98507#true} is VALID [2022-04-27 15:31:14,243 INFO L272 TraceCheckUtils]: 0: Hoare triple {98507#true} call ULTIMATE.init(); {98514#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:31:14,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {98514#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {98507#true} is VALID [2022-04-27 15:31:14,243 INFO L290 TraceCheckUtils]: 2: Hoare triple {98507#true} assume true; {98507#true} is VALID [2022-04-27 15:31:14,243 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {98507#true} {98507#true} #689#return; {98507#true} is VALID [2022-04-27 15:31:14,243 INFO L272 TraceCheckUtils]: 4: Hoare triple {98507#true} call #t~ret161 := main(); {98507#true} is VALID [2022-04-27 15:31:14,243 INFO L290 TraceCheckUtils]: 5: Hoare triple {98507#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; {98507#true} is VALID [2022-04-27 15:31:14,244 INFO L290 TraceCheckUtils]: 6: Hoare triple {98507#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {98507#true} is VALID [2022-04-27 15:31:14,244 INFO L272 TraceCheckUtils]: 7: Hoare triple {98507#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {98507#true} is VALID [2022-04-27 15:31:14,244 INFO L290 TraceCheckUtils]: 8: Hoare triple {98507#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); {98507#true} is VALID [2022-04-27 15:31:14,244 INFO L290 TraceCheckUtils]: 9: Hoare triple {98507#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; {98507#true} is VALID [2022-04-27 15:31:14,244 INFO L290 TraceCheckUtils]: 10: Hoare triple {98507#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; {98507#true} is VALID [2022-04-27 15:31:14,244 INFO L290 TraceCheckUtils]: 11: Hoare triple {98507#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {98507#true} is VALID [2022-04-27 15:31:14,244 INFO L290 TraceCheckUtils]: 12: Hoare triple {98507#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {98507#true} is VALID [2022-04-27 15:31:14,244 INFO L290 TraceCheckUtils]: 13: Hoare triple {98507#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {98507#true} is VALID [2022-04-27 15:31:14,244 INFO L290 TraceCheckUtils]: 14: Hoare triple {98507#true} assume !false; {98507#true} is VALID [2022-04-27 15:31:14,244 INFO L290 TraceCheckUtils]: 15: Hoare triple {98507#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); {98507#true} is VALID [2022-04-27 15:31:14,244 INFO L290 TraceCheckUtils]: 16: Hoare triple {98507#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {98507#true} is VALID [2022-04-27 15:31:14,244 INFO L290 TraceCheckUtils]: 17: Hoare triple {98507#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {98507#true} is VALID [2022-04-27 15:31:14,244 INFO L290 TraceCheckUtils]: 18: Hoare triple {98507#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {98507#true} is VALID [2022-04-27 15:31:14,244 INFO L290 TraceCheckUtils]: 19: Hoare triple {98507#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {98507#true} is VALID [2022-04-27 15:31:14,244 INFO L290 TraceCheckUtils]: 20: Hoare triple {98507#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {98507#true} is VALID [2022-04-27 15:31:14,244 INFO L290 TraceCheckUtils]: 21: Hoare triple {98507#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {98507#true} is VALID [2022-04-27 15:31:14,244 INFO L290 TraceCheckUtils]: 22: Hoare triple {98507#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {98507#true} is VALID [2022-04-27 15:31:14,245 INFO L290 TraceCheckUtils]: 23: Hoare triple {98507#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {98507#true} is VALID [2022-04-27 15:31:14,245 INFO L290 TraceCheckUtils]: 24: Hoare triple {98507#true} assume 8464 == #t~mem55;havoc #t~mem55; {98507#true} is VALID [2022-04-27 15:31:14,245 INFO L290 TraceCheckUtils]: 25: Hoare triple {98507#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; {98507#true} is VALID [2022-04-27 15:31:14,245 INFO L290 TraceCheckUtils]: 26: Hoare triple {98507#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {98507#true} is VALID [2022-04-27 15:31:14,245 INFO L290 TraceCheckUtils]: 27: Hoare triple {98507#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); {98507#true} is VALID [2022-04-27 15:31:14,245 INFO L290 TraceCheckUtils]: 28: Hoare triple {98507#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); {98507#true} is VALID [2022-04-27 15:31:14,245 INFO L290 TraceCheckUtils]: 29: Hoare triple {98507#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {98507#true} is VALID [2022-04-27 15:31:14,245 INFO L290 TraceCheckUtils]: 30: Hoare triple {98507#true} ~skip~0 := 0; {98507#true} is VALID [2022-04-27 15:31:14,245 INFO L290 TraceCheckUtils]: 31: Hoare triple {98507#true} assume !false; {98507#true} is VALID [2022-04-27 15:31:14,245 INFO L290 TraceCheckUtils]: 32: Hoare triple {98507#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); {98507#true} is VALID [2022-04-27 15:31:14,245 INFO L290 TraceCheckUtils]: 33: Hoare triple {98507#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {98507#true} is VALID [2022-04-27 15:31:14,245 INFO L290 TraceCheckUtils]: 34: Hoare triple {98507#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {98507#true} is VALID [2022-04-27 15:31:14,245 INFO L290 TraceCheckUtils]: 35: Hoare triple {98507#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {98507#true} is VALID [2022-04-27 15:31:14,245 INFO L290 TraceCheckUtils]: 36: Hoare triple {98507#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {98507#true} is VALID [2022-04-27 15:31:14,245 INFO L290 TraceCheckUtils]: 37: Hoare triple {98507#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {98507#true} is VALID [2022-04-27 15:31:14,245 INFO L290 TraceCheckUtils]: 38: Hoare triple {98507#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {98507#true} is VALID [2022-04-27 15:31:14,245 INFO L290 TraceCheckUtils]: 39: Hoare triple {98507#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {98507#true} is VALID [2022-04-27 15:31:14,246 INFO L290 TraceCheckUtils]: 40: Hoare triple {98507#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {98507#true} is VALID [2022-04-27 15:31:14,246 INFO L290 TraceCheckUtils]: 41: Hoare triple {98507#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {98507#true} is VALID [2022-04-27 15:31:14,246 INFO L290 TraceCheckUtils]: 42: Hoare triple {98507#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {98507#true} is VALID [2022-04-27 15:31:14,246 INFO L290 TraceCheckUtils]: 43: Hoare triple {98507#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {98507#true} is VALID [2022-04-27 15:31:14,246 INFO L290 TraceCheckUtils]: 44: Hoare triple {98507#true} assume 8496 == #t~mem58;havoc #t~mem58; {98507#true} is VALID [2022-04-27 15:31:14,246 INFO L290 TraceCheckUtils]: 45: Hoare triple {98507#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {98507#true} is VALID [2022-04-27 15:31:14,246 INFO L290 TraceCheckUtils]: 46: Hoare triple {98507#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {98507#true} is VALID [2022-04-27 15:31:14,246 INFO L290 TraceCheckUtils]: 47: Hoare triple {98507#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {98507#true} is VALID [2022-04-27 15:31:14,246 INFO L290 TraceCheckUtils]: 48: Hoare triple {98507#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {98507#true} is VALID [2022-04-27 15:31:14,246 INFO L290 TraceCheckUtils]: 49: Hoare triple {98507#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {98507#true} is VALID [2022-04-27 15:31:14,246 INFO L290 TraceCheckUtils]: 50: Hoare triple {98507#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); {98507#true} is VALID [2022-04-27 15:31:14,246 INFO L290 TraceCheckUtils]: 51: Hoare triple {98507#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {98507#true} is VALID [2022-04-27 15:31:14,246 INFO L290 TraceCheckUtils]: 52: Hoare triple {98507#true} ~skip~0 := 0; {98507#true} is VALID [2022-04-27 15:31:14,246 INFO L290 TraceCheckUtils]: 53: Hoare triple {98507#true} assume !false; {98507#true} is VALID [2022-04-27 15:31:14,246 INFO L290 TraceCheckUtils]: 54: Hoare triple {98507#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); {98507#true} is VALID [2022-04-27 15:31:14,246 INFO L290 TraceCheckUtils]: 55: Hoare triple {98507#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {98507#true} is VALID [2022-04-27 15:31:14,246 INFO L290 TraceCheckUtils]: 56: Hoare triple {98507#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {98507#true} is VALID [2022-04-27 15:31:14,246 INFO L290 TraceCheckUtils]: 57: Hoare triple {98507#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {98507#true} is VALID [2022-04-27 15:31:14,247 INFO L290 TraceCheckUtils]: 58: Hoare triple {98507#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {98507#true} is VALID [2022-04-27 15:31:14,247 INFO L290 TraceCheckUtils]: 59: Hoare triple {98507#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {98507#true} is VALID [2022-04-27 15:31:14,247 INFO L290 TraceCheckUtils]: 60: Hoare triple {98507#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {98507#true} is VALID [2022-04-27 15:31:14,247 INFO L290 TraceCheckUtils]: 61: Hoare triple {98507#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {98507#true} is VALID [2022-04-27 15:31:14,247 INFO L290 TraceCheckUtils]: 62: Hoare triple {98507#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {98507#true} is VALID [2022-04-27 15:31:14,247 INFO L290 TraceCheckUtils]: 63: Hoare triple {98507#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {98507#true} is VALID [2022-04-27 15:31:14,247 INFO L290 TraceCheckUtils]: 64: Hoare triple {98507#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {98507#true} is VALID [2022-04-27 15:31:14,247 INFO L290 TraceCheckUtils]: 65: Hoare triple {98507#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {98507#true} is VALID [2022-04-27 15:31:14,247 INFO L290 TraceCheckUtils]: 66: Hoare triple {98507#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {98507#true} is VALID [2022-04-27 15:31:14,247 INFO L290 TraceCheckUtils]: 67: Hoare triple {98507#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {98507#true} is VALID [2022-04-27 15:31:14,247 INFO L290 TraceCheckUtils]: 68: Hoare triple {98507#true} assume 8512 == #t~mem60;havoc #t~mem60; {98507#true} is VALID [2022-04-27 15:31:14,247 INFO L290 TraceCheckUtils]: 69: Hoare triple {98507#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); {98507#true} is VALID [2022-04-27 15:31:14,247 INFO L290 TraceCheckUtils]: 70: Hoare triple {98507#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; {98507#true} is VALID [2022-04-27 15:31:14,247 INFO L290 TraceCheckUtils]: 71: Hoare triple {98507#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 6; {98507#true} is VALID [2022-04-27 15:31:14,247 INFO L290 TraceCheckUtils]: 72: Hoare triple {98507#true} assume !(~ret~0 <= 0); {98507#true} is VALID [2022-04-27 15:31:14,248 INFO L290 TraceCheckUtils]: 73: Hoare triple {98507#true} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {98512#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:14,248 INFO L290 TraceCheckUtils]: 74: Hoare triple {98512#(= 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); {98512#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:14,249 INFO L290 TraceCheckUtils]: 75: Hoare triple {98512#(= 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; {98512#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:14,249 INFO L290 TraceCheckUtils]: 76: Hoare triple {98512#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {98512#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:14,249 INFO L290 TraceCheckUtils]: 77: Hoare triple {98512#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {98512#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:14,250 INFO L290 TraceCheckUtils]: 78: Hoare triple {98512#(= 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); {98512#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:14,250 INFO L290 TraceCheckUtils]: 79: Hoare triple {98512#(= 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); {98512#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:14,250 INFO L290 TraceCheckUtils]: 80: Hoare triple {98512#(= 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); {98512#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:14,251 INFO L290 TraceCheckUtils]: 81: Hoare triple {98512#(= 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); {98512#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:14,251 INFO L290 TraceCheckUtils]: 82: Hoare triple {98512#(= 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); {98512#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:14,251 INFO L290 TraceCheckUtils]: 83: Hoare triple {98512#(= 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); {98512#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:14,252 INFO L290 TraceCheckUtils]: 84: Hoare triple {98512#(= 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); {98512#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:14,252 INFO L290 TraceCheckUtils]: 85: Hoare triple {98512#(= 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); {98512#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:14,252 INFO L290 TraceCheckUtils]: 86: Hoare triple {98512#(= 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); {98512#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:14,253 INFO L290 TraceCheckUtils]: 87: Hoare triple {98512#(= 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); {98512#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:14,253 INFO L290 TraceCheckUtils]: 88: Hoare triple {98512#(= 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); {98512#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:14,253 INFO L290 TraceCheckUtils]: 89: Hoare triple {98512#(= 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); {98512#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:14,254 INFO L290 TraceCheckUtils]: 90: Hoare triple {98512#(= 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); {98512#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:14,254 INFO L290 TraceCheckUtils]: 91: Hoare triple {98512#(= 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); {98512#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:14,254 INFO L290 TraceCheckUtils]: 92: Hoare triple {98512#(= 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); {98512#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:14,255 INFO L290 TraceCheckUtils]: 93: Hoare triple {98512#(= 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); {98513#(= |ssl3_accept_#t~mem62| 8528)} is VALID [2022-04-27 15:31:14,255 INFO L290 TraceCheckUtils]: 94: Hoare triple {98513#(= |ssl3_accept_#t~mem62| 8528)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {98508#false} is VALID [2022-04-27 15:31:14,255 INFO L290 TraceCheckUtils]: 95: Hoare triple {98508#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {98508#false} is VALID [2022-04-27 15:31:14,255 INFO L290 TraceCheckUtils]: 96: Hoare triple {98508#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {98508#false} is VALID [2022-04-27 15:31:14,255 INFO L290 TraceCheckUtils]: 97: Hoare triple {98508#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {98508#false} is VALID [2022-04-27 15:31:14,255 INFO L290 TraceCheckUtils]: 98: Hoare triple {98508#false} assume 8560 == #t~mem66;havoc #t~mem66; {98508#false} is VALID [2022-04-27 15:31:14,255 INFO L290 TraceCheckUtils]: 99: Hoare triple {98508#false} assume -2147483648 <= #t~nondet130 && #t~nondet130 <= 2147483647;~ret~0 := #t~nondet130;havoc #t~nondet130; {98508#false} is VALID [2022-04-27 15:31:14,255 INFO L290 TraceCheckUtils]: 100: Hoare triple {98508#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); {98508#false} is VALID [2022-04-27 15:31:14,255 INFO L290 TraceCheckUtils]: 101: Hoare triple {98508#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); {98508#false} is VALID [2022-04-27 15:31:14,256 INFO L290 TraceCheckUtils]: 102: Hoare triple {98508#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {98508#false} is VALID [2022-04-27 15:31:14,256 INFO L290 TraceCheckUtils]: 103: Hoare triple {98508#false} ~skip~0 := 0; {98508#false} is VALID [2022-04-27 15:31:14,256 INFO L290 TraceCheckUtils]: 104: Hoare triple {98508#false} assume !false; {98508#false} is VALID [2022-04-27 15:31:14,256 INFO L290 TraceCheckUtils]: 105: Hoare triple {98508#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); {98508#false} is VALID [2022-04-27 15:31:14,256 INFO L290 TraceCheckUtils]: 106: Hoare triple {98508#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {98508#false} is VALID [2022-04-27 15:31:14,256 INFO L290 TraceCheckUtils]: 107: Hoare triple {98508#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {98508#false} is VALID [2022-04-27 15:31:14,256 INFO L290 TraceCheckUtils]: 108: Hoare triple {98508#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {98508#false} is VALID [2022-04-27 15:31:14,256 INFO L290 TraceCheckUtils]: 109: Hoare triple {98508#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {98508#false} is VALID [2022-04-27 15:31:14,256 INFO L290 TraceCheckUtils]: 110: Hoare triple {98508#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {98508#false} is VALID [2022-04-27 15:31:14,256 INFO L290 TraceCheckUtils]: 111: Hoare triple {98508#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {98508#false} is VALID [2022-04-27 15:31:14,256 INFO L290 TraceCheckUtils]: 112: Hoare triple {98508#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {98508#false} is VALID [2022-04-27 15:31:14,256 INFO L290 TraceCheckUtils]: 113: Hoare triple {98508#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {98508#false} is VALID [2022-04-27 15:31:14,256 INFO L290 TraceCheckUtils]: 114: Hoare triple {98508#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {98508#false} is VALID [2022-04-27 15:31:14,256 INFO L290 TraceCheckUtils]: 115: Hoare triple {98508#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {98508#false} is VALID [2022-04-27 15:31:14,256 INFO L290 TraceCheckUtils]: 116: Hoare triple {98508#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {98508#false} is VALID [2022-04-27 15:31:14,256 INFO L290 TraceCheckUtils]: 117: Hoare triple {98508#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {98508#false} is VALID [2022-04-27 15:31:14,256 INFO L290 TraceCheckUtils]: 118: Hoare triple {98508#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {98508#false} is VALID [2022-04-27 15:31:14,256 INFO L290 TraceCheckUtils]: 119: Hoare triple {98508#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {98508#false} is VALID [2022-04-27 15:31:14,257 INFO L290 TraceCheckUtils]: 120: Hoare triple {98508#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {98508#false} is VALID [2022-04-27 15:31:14,257 INFO L290 TraceCheckUtils]: 121: Hoare triple {98508#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {98508#false} is VALID [2022-04-27 15:31:14,257 INFO L290 TraceCheckUtils]: 122: Hoare triple {98508#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {98508#false} is VALID [2022-04-27 15:31:14,257 INFO L290 TraceCheckUtils]: 123: Hoare triple {98508#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {98508#false} is VALID [2022-04-27 15:31:14,257 INFO L290 TraceCheckUtils]: 124: Hoare triple {98508#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {98508#false} is VALID [2022-04-27 15:31:14,257 INFO L290 TraceCheckUtils]: 125: Hoare triple {98508#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {98508#false} is VALID [2022-04-27 15:31:14,257 INFO L290 TraceCheckUtils]: 126: Hoare triple {98508#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {98508#false} is VALID [2022-04-27 15:31:14,257 INFO L290 TraceCheckUtils]: 127: Hoare triple {98508#false} assume 8448 == #t~mem68;havoc #t~mem68; {98508#false} is VALID [2022-04-27 15:31:14,257 INFO L290 TraceCheckUtils]: 128: Hoare triple {98508#false} assume !(~num1~0 > 0); {98508#false} is VALID [2022-04-27 15:31:14,257 INFO L290 TraceCheckUtils]: 129: Hoare triple {98508#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; {98508#false} is VALID [2022-04-27 15:31:14,257 INFO L290 TraceCheckUtils]: 130: Hoare triple {98508#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); {98508#false} is VALID [2022-04-27 15:31:14,257 INFO L290 TraceCheckUtils]: 131: Hoare triple {98508#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {98508#false} is VALID [2022-04-27 15:31:14,257 INFO L290 TraceCheckUtils]: 132: Hoare triple {98508#false} ~skip~0 := 0; {98508#false} is VALID [2022-04-27 15:31:14,257 INFO L290 TraceCheckUtils]: 133: Hoare triple {98508#false} assume !false; {98508#false} is VALID [2022-04-27 15:31:14,257 INFO L290 TraceCheckUtils]: 134: Hoare triple {98508#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); {98508#false} is VALID [2022-04-27 15:31:14,257 INFO L290 TraceCheckUtils]: 135: Hoare triple {98508#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {98508#false} is VALID [2022-04-27 15:31:14,257 INFO L290 TraceCheckUtils]: 136: Hoare triple {98508#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {98508#false} is VALID [2022-04-27 15:31:14,258 INFO L290 TraceCheckUtils]: 137: Hoare triple {98508#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {98508#false} is VALID [2022-04-27 15:31:14,258 INFO L290 TraceCheckUtils]: 138: Hoare triple {98508#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {98508#false} is VALID [2022-04-27 15:31:14,258 INFO L290 TraceCheckUtils]: 139: Hoare triple {98508#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {98508#false} is VALID [2022-04-27 15:31:14,258 INFO L290 TraceCheckUtils]: 140: Hoare triple {98508#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {98508#false} is VALID [2022-04-27 15:31:14,258 INFO L290 TraceCheckUtils]: 141: Hoare triple {98508#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {98508#false} is VALID [2022-04-27 15:31:14,258 INFO L290 TraceCheckUtils]: 142: Hoare triple {98508#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {98508#false} is VALID [2022-04-27 15:31:14,258 INFO L290 TraceCheckUtils]: 143: Hoare triple {98508#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {98508#false} is VALID [2022-04-27 15:31:14,258 INFO L290 TraceCheckUtils]: 144: Hoare triple {98508#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {98508#false} is VALID [2022-04-27 15:31:14,258 INFO L290 TraceCheckUtils]: 145: Hoare triple {98508#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {98508#false} is VALID [2022-04-27 15:31:14,258 INFO L290 TraceCheckUtils]: 146: Hoare triple {98508#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {98508#false} is VALID [2022-04-27 15:31:14,258 INFO L290 TraceCheckUtils]: 147: Hoare triple {98508#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {98508#false} is VALID [2022-04-27 15:31:14,258 INFO L290 TraceCheckUtils]: 148: Hoare triple {98508#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {98508#false} is VALID [2022-04-27 15:31:14,258 INFO L290 TraceCheckUtils]: 149: Hoare triple {98508#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {98508#false} is VALID [2022-04-27 15:31:14,258 INFO L290 TraceCheckUtils]: 150: Hoare triple {98508#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {98508#false} is VALID [2022-04-27 15:31:14,258 INFO L290 TraceCheckUtils]: 151: Hoare triple {98508#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {98508#false} is VALID [2022-04-27 15:31:14,258 INFO L290 TraceCheckUtils]: 152: Hoare triple {98508#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {98508#false} is VALID [2022-04-27 15:31:14,258 INFO L290 TraceCheckUtils]: 153: Hoare triple {98508#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {98508#false} is VALID [2022-04-27 15:31:14,258 INFO L290 TraceCheckUtils]: 154: Hoare triple {98508#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {98508#false} is VALID [2022-04-27 15:31:14,259 INFO L290 TraceCheckUtils]: 155: Hoare triple {98508#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {98508#false} is VALID [2022-04-27 15:31:14,259 INFO L290 TraceCheckUtils]: 156: Hoare triple {98508#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {98508#false} is VALID [2022-04-27 15:31:14,259 INFO L290 TraceCheckUtils]: 157: Hoare triple {98508#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {98508#false} is VALID [2022-04-27 15:31:14,259 INFO L290 TraceCheckUtils]: 158: Hoare triple {98508#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {98508#false} is VALID [2022-04-27 15:31:14,259 INFO L290 TraceCheckUtils]: 159: Hoare triple {98508#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {98508#false} is VALID [2022-04-27 15:31:14,259 INFO L290 TraceCheckUtils]: 160: Hoare triple {98508#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {98508#false} is VALID [2022-04-27 15:31:14,259 INFO L290 TraceCheckUtils]: 161: Hoare triple {98508#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {98508#false} is VALID [2022-04-27 15:31:14,259 INFO L290 TraceCheckUtils]: 162: Hoare triple {98508#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {98508#false} is VALID [2022-04-27 15:31:14,259 INFO L290 TraceCheckUtils]: 163: Hoare triple {98508#false} assume 8640 == #t~mem75;havoc #t~mem75; {98508#false} is VALID [2022-04-27 15:31:14,259 INFO L290 TraceCheckUtils]: 164: Hoare triple {98508#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {98508#false} is VALID [2022-04-27 15:31:14,259 INFO L290 TraceCheckUtils]: 165: Hoare triple {98508#false} assume 4 == ~blastFlag~0; {98508#false} is VALID [2022-04-27 15:31:14,259 INFO L290 TraceCheckUtils]: 166: Hoare triple {98508#false} assume !false; {98508#false} is VALID [2022-04-27 15:31:14,260 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-27 15:31:14,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:31:14,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110646332] [2022-04-27 15:31:14,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110646332] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:31:14,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:31:14,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:31:14,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633312122] [2022-04-27 15:31:14,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:31:14,260 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-27 15:31:14,261 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:31:14,261 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:14,336 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:31:14,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:31:14,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:31:14,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:31:14,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:31:14,337 INFO L87 Difference]: Start difference. First operand 1993 states and 2981 transitions. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:18,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:31:18,499 INFO L93 Difference]: Finished difference Result 4054 states and 6059 transitions. [2022-04-27 15:31:18,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:31:18,500 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-27 15:31:18,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:31:18,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:18,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 484 transitions. [2022-04-27 15:31:18,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:18,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 484 transitions. [2022-04-27 15:31:18,503 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 484 transitions. [2022-04-27 15:31:18,814 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-27 15:31:18,948 INFO L225 Difference]: With dead ends: 4054 [2022-04-27 15:31:18,948 INFO L226 Difference]: Without dead ends: 2089 [2022-04-27 15:31:18,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:31:18,950 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 38 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.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, 1.5s IncrementalHoareTripleChecker+Time [2022-04-27 15:31:18,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 568 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-27 15:31:18,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2089 states. [2022-04-27 15:31:19,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2089 to 1993. [2022-04-27 15:31:19,058 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:31:19,060 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2089 states. Second operand has 1993 states, 1988 states have (on average 1.4954728370221329) internal successors, (2973), 1988 states have internal predecessors, (2973), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:19,061 INFO L74 IsIncluded]: Start isIncluded. First operand 2089 states. Second operand has 1993 states, 1988 states have (on average 1.4954728370221329) internal successors, (2973), 1988 states have internal predecessors, (2973), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:19,062 INFO L87 Difference]: Start difference. First operand 2089 states. Second operand has 1993 states, 1988 states have (on average 1.4954728370221329) internal successors, (2973), 1988 states have internal predecessors, (2973), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:19,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:31:19,168 INFO L93 Difference]: Finished difference Result 2089 states and 3106 transitions. [2022-04-27 15:31:19,168 INFO L276 IsEmpty]: Start isEmpty. Operand 2089 states and 3106 transitions. [2022-04-27 15:31:19,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:31:19,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:31:19,171 INFO L74 IsIncluded]: Start isIncluded. First operand has 1993 states, 1988 states have (on average 1.4954728370221329) internal successors, (2973), 1988 states have internal predecessors, (2973), 3 states have call successors, (3), 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 2089 states. [2022-04-27 15:31:19,172 INFO L87 Difference]: Start difference. First operand has 1993 states, 1988 states have (on average 1.4954728370221329) internal successors, (2973), 1988 states have internal predecessors, (2973), 3 states have call successors, (3), 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 2089 states. [2022-04-27 15:31:19,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:31:19,278 INFO L93 Difference]: Finished difference Result 2089 states and 3106 transitions. [2022-04-27 15:31:19,278 INFO L276 IsEmpty]: Start isEmpty. Operand 2089 states and 3106 transitions. [2022-04-27 15:31:19,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:31:19,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:31:19,279 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:31:19,279 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:31:19,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1993 states, 1988 states have (on average 1.4954728370221329) internal successors, (2973), 1988 states have internal predecessors, (2973), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:19,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1993 states to 1993 states and 2977 transitions. [2022-04-27 15:31:19,416 INFO L78 Accepts]: Start accepts. Automaton has 1993 states and 2977 transitions. Word has length 167 [2022-04-27 15:31:19,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:31:19,417 INFO L495 AbstractCegarLoop]: Abstraction has 1993 states and 2977 transitions. [2022-04-27 15:31:19,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:19,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1993 states and 2977 transitions. [2022-04-27 15:31:19,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-04-27 15:31:19,418 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:31:19,418 INFO L195 NwaCegarLoop]: 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-27 15:31:19,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-04-27 15:31:19,418 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:31:19,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:31:19,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1391450317, now seen corresponding path program 1 times [2022-04-27 15:31:19,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:31:19,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075294228] [2022-04-27 15:31:19,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:31:19,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:31:19,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:31:19,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:31:19,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:31:19,538 INFO L290 TraceCheckUtils]: 0: Hoare triple {109349#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {109341#true} is VALID [2022-04-27 15:31:19,538 INFO L290 TraceCheckUtils]: 1: Hoare triple {109341#true} assume true; {109341#true} is VALID [2022-04-27 15:31:19,538 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {109341#true} {109341#true} #689#return; {109341#true} is VALID [2022-04-27 15:31:19,539 INFO L272 TraceCheckUtils]: 0: Hoare triple {109341#true} call ULTIMATE.init(); {109349#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:31:19,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {109349#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {109341#true} is VALID [2022-04-27 15:31:19,539 INFO L290 TraceCheckUtils]: 2: Hoare triple {109341#true} assume true; {109341#true} is VALID [2022-04-27 15:31:19,539 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {109341#true} {109341#true} #689#return; {109341#true} is VALID [2022-04-27 15:31:19,539 INFO L272 TraceCheckUtils]: 4: Hoare triple {109341#true} call #t~ret161 := main(); {109341#true} is VALID [2022-04-27 15:31:19,539 INFO L290 TraceCheckUtils]: 5: Hoare triple {109341#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; {109341#true} is VALID [2022-04-27 15:31:19,540 INFO L290 TraceCheckUtils]: 6: Hoare triple {109341#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {109341#true} is VALID [2022-04-27 15:31:19,540 INFO L272 TraceCheckUtils]: 7: Hoare triple {109341#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {109341#true} is VALID [2022-04-27 15:31:19,540 INFO L290 TraceCheckUtils]: 8: Hoare triple {109341#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); {109341#true} is VALID [2022-04-27 15:31:19,540 INFO L290 TraceCheckUtils]: 9: Hoare triple {109341#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; {109341#true} is VALID [2022-04-27 15:31:19,540 INFO L290 TraceCheckUtils]: 10: Hoare triple {109341#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; {109341#true} is VALID [2022-04-27 15:31:19,540 INFO L290 TraceCheckUtils]: 11: Hoare triple {109341#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {109341#true} is VALID [2022-04-27 15:31:19,540 INFO L290 TraceCheckUtils]: 12: Hoare triple {109341#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {109341#true} is VALID [2022-04-27 15:31:19,540 INFO L290 TraceCheckUtils]: 13: Hoare triple {109341#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {109341#true} is VALID [2022-04-27 15:31:19,540 INFO L290 TraceCheckUtils]: 14: Hoare triple {109341#true} assume !false; {109341#true} is VALID [2022-04-27 15:31:19,540 INFO L290 TraceCheckUtils]: 15: Hoare triple {109341#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); {109341#true} is VALID [2022-04-27 15:31:19,540 INFO L290 TraceCheckUtils]: 16: Hoare triple {109341#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {109341#true} is VALID [2022-04-27 15:31:19,540 INFO L290 TraceCheckUtils]: 17: Hoare triple {109341#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {109341#true} is VALID [2022-04-27 15:31:19,540 INFO L290 TraceCheckUtils]: 18: Hoare triple {109341#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {109341#true} is VALID [2022-04-27 15:31:19,540 INFO L290 TraceCheckUtils]: 19: Hoare triple {109341#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {109341#true} is VALID [2022-04-27 15:31:19,540 INFO L290 TraceCheckUtils]: 20: Hoare triple {109341#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {109341#true} is VALID [2022-04-27 15:31:19,540 INFO L290 TraceCheckUtils]: 21: Hoare triple {109341#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {109341#true} is VALID [2022-04-27 15:31:19,540 INFO L290 TraceCheckUtils]: 22: Hoare triple {109341#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {109341#true} is VALID [2022-04-27 15:31:19,540 INFO L290 TraceCheckUtils]: 23: Hoare triple {109341#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {109341#true} is VALID [2022-04-27 15:31:19,541 INFO L290 TraceCheckUtils]: 24: Hoare triple {109341#true} assume 8464 == #t~mem55;havoc #t~mem55; {109341#true} is VALID [2022-04-27 15:31:19,541 INFO L290 TraceCheckUtils]: 25: Hoare triple {109341#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; {109341#true} is VALID [2022-04-27 15:31:19,541 INFO L290 TraceCheckUtils]: 26: Hoare triple {109341#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {109341#true} is VALID [2022-04-27 15:31:19,541 INFO L290 TraceCheckUtils]: 27: Hoare triple {109341#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); {109341#true} is VALID [2022-04-27 15:31:19,541 INFO L290 TraceCheckUtils]: 28: Hoare triple {109341#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); {109341#true} is VALID [2022-04-27 15:31:19,541 INFO L290 TraceCheckUtils]: 29: Hoare triple {109341#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {109341#true} is VALID [2022-04-27 15:31:19,541 INFO L290 TraceCheckUtils]: 30: Hoare triple {109341#true} ~skip~0 := 0; {109341#true} is VALID [2022-04-27 15:31:19,541 INFO L290 TraceCheckUtils]: 31: Hoare triple {109341#true} assume !false; {109341#true} is VALID [2022-04-27 15:31:19,541 INFO L290 TraceCheckUtils]: 32: Hoare triple {109341#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); {109341#true} is VALID [2022-04-27 15:31:19,541 INFO L290 TraceCheckUtils]: 33: Hoare triple {109341#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {109341#true} is VALID [2022-04-27 15:31:19,541 INFO L290 TraceCheckUtils]: 34: Hoare triple {109341#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {109341#true} is VALID [2022-04-27 15:31:19,541 INFO L290 TraceCheckUtils]: 35: Hoare triple {109341#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {109341#true} is VALID [2022-04-27 15:31:19,541 INFO L290 TraceCheckUtils]: 36: Hoare triple {109341#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {109341#true} is VALID [2022-04-27 15:31:19,541 INFO L290 TraceCheckUtils]: 37: Hoare triple {109341#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {109341#true} is VALID [2022-04-27 15:31:19,541 INFO L290 TraceCheckUtils]: 38: Hoare triple {109341#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {109341#true} is VALID [2022-04-27 15:31:19,541 INFO L290 TraceCheckUtils]: 39: Hoare triple {109341#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {109341#true} is VALID [2022-04-27 15:31:19,541 INFO L290 TraceCheckUtils]: 40: Hoare triple {109341#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {109341#true} is VALID [2022-04-27 15:31:19,542 INFO L290 TraceCheckUtils]: 41: Hoare triple {109341#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {109341#true} is VALID [2022-04-27 15:31:19,542 INFO L290 TraceCheckUtils]: 42: Hoare triple {109341#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {109341#true} is VALID [2022-04-27 15:31:19,542 INFO L290 TraceCheckUtils]: 43: Hoare triple {109341#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {109341#true} is VALID [2022-04-27 15:31:19,542 INFO L290 TraceCheckUtils]: 44: Hoare triple {109341#true} assume 8496 == #t~mem58;havoc #t~mem58; {109341#true} is VALID [2022-04-27 15:31:19,542 INFO L290 TraceCheckUtils]: 45: Hoare triple {109341#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {109341#true} is VALID [2022-04-27 15:31:19,542 INFO L290 TraceCheckUtils]: 46: Hoare triple {109341#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {109341#true} is VALID [2022-04-27 15:31:19,542 INFO L290 TraceCheckUtils]: 47: Hoare triple {109341#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {109341#true} is VALID [2022-04-27 15:31:19,542 INFO L290 TraceCheckUtils]: 48: Hoare triple {109341#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {109341#true} is VALID [2022-04-27 15:31:19,542 INFO L290 TraceCheckUtils]: 49: Hoare triple {109341#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {109341#true} is VALID [2022-04-27 15:31:19,542 INFO L290 TraceCheckUtils]: 50: Hoare triple {109341#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); {109341#true} is VALID [2022-04-27 15:31:19,542 INFO L290 TraceCheckUtils]: 51: Hoare triple {109341#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {109341#true} is VALID [2022-04-27 15:31:19,542 INFO L290 TraceCheckUtils]: 52: Hoare triple {109341#true} ~skip~0 := 0; {109341#true} is VALID [2022-04-27 15:31:19,542 INFO L290 TraceCheckUtils]: 53: Hoare triple {109341#true} assume !false; {109341#true} is VALID [2022-04-27 15:31:19,542 INFO L290 TraceCheckUtils]: 54: Hoare triple {109341#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); {109341#true} is VALID [2022-04-27 15:31:19,542 INFO L290 TraceCheckUtils]: 55: Hoare triple {109341#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {109341#true} is VALID [2022-04-27 15:31:19,542 INFO L290 TraceCheckUtils]: 56: Hoare triple {109341#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {109341#true} is VALID [2022-04-27 15:31:19,542 INFO L290 TraceCheckUtils]: 57: Hoare triple {109341#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {109341#true} is VALID [2022-04-27 15:31:19,542 INFO L290 TraceCheckUtils]: 58: Hoare triple {109341#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {109341#true} is VALID [2022-04-27 15:31:19,543 INFO L290 TraceCheckUtils]: 59: Hoare triple {109341#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {109341#true} is VALID [2022-04-27 15:31:19,543 INFO L290 TraceCheckUtils]: 60: Hoare triple {109341#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {109341#true} is VALID [2022-04-27 15:31:19,543 INFO L290 TraceCheckUtils]: 61: Hoare triple {109341#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {109341#true} is VALID [2022-04-27 15:31:19,543 INFO L290 TraceCheckUtils]: 62: Hoare triple {109341#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {109341#true} is VALID [2022-04-27 15:31:19,543 INFO L290 TraceCheckUtils]: 63: Hoare triple {109341#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {109341#true} is VALID [2022-04-27 15:31:19,543 INFO L290 TraceCheckUtils]: 64: Hoare triple {109341#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {109341#true} is VALID [2022-04-27 15:31:19,543 INFO L290 TraceCheckUtils]: 65: Hoare triple {109341#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {109341#true} is VALID [2022-04-27 15:31:19,543 INFO L290 TraceCheckUtils]: 66: Hoare triple {109341#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {109341#true} is VALID [2022-04-27 15:31:19,543 INFO L290 TraceCheckUtils]: 67: Hoare triple {109341#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {109341#true} is VALID [2022-04-27 15:31:19,543 INFO L290 TraceCheckUtils]: 68: Hoare triple {109341#true} assume 8512 == #t~mem60;havoc #t~mem60; {109341#true} is VALID [2022-04-27 15:31:19,543 INFO L290 TraceCheckUtils]: 69: Hoare triple {109341#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); {109341#true} is VALID [2022-04-27 15:31:19,543 INFO L290 TraceCheckUtils]: 70: Hoare triple {109341#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; {109341#true} is VALID [2022-04-27 15:31:19,543 INFO L290 TraceCheckUtils]: 71: Hoare triple {109341#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 6; {109341#true} is VALID [2022-04-27 15:31:19,543 INFO L290 TraceCheckUtils]: 72: Hoare triple {109341#true} assume !(~ret~0 <= 0); {109341#true} is VALID [2022-04-27 15:31:19,543 INFO L290 TraceCheckUtils]: 73: Hoare triple {109341#true} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {109341#true} is VALID [2022-04-27 15:31:19,543 INFO L290 TraceCheckUtils]: 74: Hoare triple {109341#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); {109341#true} is VALID [2022-04-27 15:31:19,543 INFO L290 TraceCheckUtils]: 75: Hoare triple {109341#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {109341#true} is VALID [2022-04-27 15:31:19,543 INFO L290 TraceCheckUtils]: 76: Hoare triple {109341#true} ~skip~0 := 0; {109341#true} is VALID [2022-04-27 15:31:19,544 INFO L290 TraceCheckUtils]: 77: Hoare triple {109341#true} assume !false; {109341#true} is VALID [2022-04-27 15:31:19,544 INFO L290 TraceCheckUtils]: 78: Hoare triple {109341#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); {109346#(= |ssl3_accept_#t~mem47| (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:19,544 INFO L290 TraceCheckUtils]: 79: Hoare triple {109346#(= |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); {109347#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:31:19,545 INFO L290 TraceCheckUtils]: 80: Hoare triple {109347#(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); {109347#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:31:19,545 INFO L290 TraceCheckUtils]: 81: Hoare triple {109347#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 8192 == #t~mem49;havoc #t~mem49; {109347#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:31:19,546 INFO L290 TraceCheckUtils]: 82: Hoare triple {109347#(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); {109347#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:31:19,546 INFO L290 TraceCheckUtils]: 83: Hoare triple {109347#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {109347#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:31:19,546 INFO L290 TraceCheckUtils]: 84: Hoare triple {109347#(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); {109347#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:31:19,547 INFO L290 TraceCheckUtils]: 85: Hoare triple {109347#(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); {109347#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:31:19,547 INFO L290 TraceCheckUtils]: 86: Hoare triple {109347#(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; {109347#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:31:19,548 INFO L290 TraceCheckUtils]: 87: Hoare triple {109347#(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); {109348#(not (= 12292 |ssl3_accept_#t~mem85|))} is VALID [2022-04-27 15:31:19,548 INFO L290 TraceCheckUtils]: 88: Hoare triple {109348#(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); {109342#false} is VALID [2022-04-27 15:31:19,548 INFO L290 TraceCheckUtils]: 89: Hoare triple {109342#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); {109342#false} is VALID [2022-04-27 15:31:19,548 INFO L290 TraceCheckUtils]: 90: Hoare triple {109342#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {109342#false} is VALID [2022-04-27 15:31:19,548 INFO L290 TraceCheckUtils]: 91: Hoare triple {109342#false} ~skip~0 := 0; {109342#false} is VALID [2022-04-27 15:31:19,548 INFO L290 TraceCheckUtils]: 92: Hoare triple {109342#false} assume !false; {109342#false} is VALID [2022-04-27 15:31:19,548 INFO L290 TraceCheckUtils]: 93: Hoare triple {109342#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); {109342#false} is VALID [2022-04-27 15:31:19,548 INFO L290 TraceCheckUtils]: 94: Hoare triple {109342#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {109342#false} is VALID [2022-04-27 15:31:19,548 INFO L290 TraceCheckUtils]: 95: Hoare triple {109342#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {109342#false} is VALID [2022-04-27 15:31:19,549 INFO L290 TraceCheckUtils]: 96: Hoare triple {109342#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {109342#false} is VALID [2022-04-27 15:31:19,549 INFO L290 TraceCheckUtils]: 97: Hoare triple {109342#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {109342#false} is VALID [2022-04-27 15:31:19,549 INFO L290 TraceCheckUtils]: 98: Hoare triple {109342#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {109342#false} is VALID [2022-04-27 15:31:19,549 INFO L290 TraceCheckUtils]: 99: Hoare triple {109342#false} assume 8480 == #t~mem52;havoc #t~mem52; {109342#false} is VALID [2022-04-27 15:31:19,549 INFO L290 TraceCheckUtils]: 100: Hoare triple {109342#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; {109342#false} is VALID [2022-04-27 15:31:19,549 INFO L290 TraceCheckUtils]: 101: Hoare triple {109342#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); {109342#false} is VALID [2022-04-27 15:31:19,549 INFO L290 TraceCheckUtils]: 102: Hoare triple {109342#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); {109342#false} is VALID [2022-04-27 15:31:19,549 INFO L290 TraceCheckUtils]: 103: Hoare triple {109342#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {109342#false} is VALID [2022-04-27 15:31:19,549 INFO L290 TraceCheckUtils]: 104: Hoare triple {109342#false} ~skip~0 := 0; {109342#false} is VALID [2022-04-27 15:31:19,549 INFO L290 TraceCheckUtils]: 105: Hoare triple {109342#false} assume !false; {109342#false} is VALID [2022-04-27 15:31:19,549 INFO L290 TraceCheckUtils]: 106: Hoare triple {109342#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); {109342#false} is VALID [2022-04-27 15:31:19,549 INFO L290 TraceCheckUtils]: 107: Hoare triple {109342#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {109342#false} is VALID [2022-04-27 15:31:19,549 INFO L290 TraceCheckUtils]: 108: Hoare triple {109342#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {109342#false} is VALID [2022-04-27 15:31:19,549 INFO L290 TraceCheckUtils]: 109: Hoare triple {109342#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {109342#false} is VALID [2022-04-27 15:31:19,549 INFO L290 TraceCheckUtils]: 110: Hoare triple {109342#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {109342#false} is VALID [2022-04-27 15:31:19,549 INFO L290 TraceCheckUtils]: 111: Hoare triple {109342#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {109342#false} is VALID [2022-04-27 15:31:19,549 INFO L290 TraceCheckUtils]: 112: Hoare triple {109342#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {109342#false} is VALID [2022-04-27 15:31:19,549 INFO L290 TraceCheckUtils]: 113: Hoare triple {109342#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {109342#false} is VALID [2022-04-27 15:31:19,550 INFO L290 TraceCheckUtils]: 114: Hoare triple {109342#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {109342#false} is VALID [2022-04-27 15:31:19,550 INFO L290 TraceCheckUtils]: 115: Hoare triple {109342#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {109342#false} is VALID [2022-04-27 15:31:19,550 INFO L290 TraceCheckUtils]: 116: Hoare triple {109342#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {109342#false} is VALID [2022-04-27 15:31:19,550 INFO L290 TraceCheckUtils]: 117: Hoare triple {109342#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {109342#false} is VALID [2022-04-27 15:31:19,550 INFO L290 TraceCheckUtils]: 118: Hoare triple {109342#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {109342#false} is VALID [2022-04-27 15:31:19,550 INFO L290 TraceCheckUtils]: 119: Hoare triple {109342#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {109342#false} is VALID [2022-04-27 15:31:19,550 INFO L290 TraceCheckUtils]: 120: Hoare triple {109342#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {109342#false} is VALID [2022-04-27 15:31:19,550 INFO L290 TraceCheckUtils]: 121: Hoare triple {109342#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {109342#false} is VALID [2022-04-27 15:31:19,550 INFO L290 TraceCheckUtils]: 122: Hoare triple {109342#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {109342#false} is VALID [2022-04-27 15:31:19,550 INFO L290 TraceCheckUtils]: 123: Hoare triple {109342#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {109342#false} is VALID [2022-04-27 15:31:19,550 INFO L290 TraceCheckUtils]: 124: Hoare triple {109342#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {109342#false} is VALID [2022-04-27 15:31:19,550 INFO L290 TraceCheckUtils]: 125: Hoare triple {109342#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {109342#false} is VALID [2022-04-27 15:31:19,550 INFO L290 TraceCheckUtils]: 126: Hoare triple {109342#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {109342#false} is VALID [2022-04-27 15:31:19,550 INFO L290 TraceCheckUtils]: 127: Hoare triple {109342#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {109342#false} is VALID [2022-04-27 15:31:19,550 INFO L290 TraceCheckUtils]: 128: Hoare triple {109342#false} assume 8448 == #t~mem68;havoc #t~mem68; {109342#false} is VALID [2022-04-27 15:31:19,550 INFO L290 TraceCheckUtils]: 129: Hoare triple {109342#false} assume !(~num1~0 > 0); {109342#false} is VALID [2022-04-27 15:31:19,550 INFO L290 TraceCheckUtils]: 130: Hoare triple {109342#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; {109342#false} is VALID [2022-04-27 15:31:19,550 INFO L290 TraceCheckUtils]: 131: Hoare triple {109342#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); {109342#false} is VALID [2022-04-27 15:31:19,551 INFO L290 TraceCheckUtils]: 132: Hoare triple {109342#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {109342#false} is VALID [2022-04-27 15:31:19,551 INFO L290 TraceCheckUtils]: 133: Hoare triple {109342#false} ~skip~0 := 0; {109342#false} is VALID [2022-04-27 15:31:19,551 INFO L290 TraceCheckUtils]: 134: Hoare triple {109342#false} assume !false; {109342#false} is VALID [2022-04-27 15:31:19,551 INFO L290 TraceCheckUtils]: 135: Hoare triple {109342#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); {109342#false} is VALID [2022-04-27 15:31:19,551 INFO L290 TraceCheckUtils]: 136: Hoare triple {109342#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {109342#false} is VALID [2022-04-27 15:31:19,551 INFO L290 TraceCheckUtils]: 137: Hoare triple {109342#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {109342#false} is VALID [2022-04-27 15:31:19,551 INFO L290 TraceCheckUtils]: 138: Hoare triple {109342#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {109342#false} is VALID [2022-04-27 15:31:19,551 INFO L290 TraceCheckUtils]: 139: Hoare triple {109342#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {109342#false} is VALID [2022-04-27 15:31:19,551 INFO L290 TraceCheckUtils]: 140: Hoare triple {109342#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {109342#false} is VALID [2022-04-27 15:31:19,551 INFO L290 TraceCheckUtils]: 141: Hoare triple {109342#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {109342#false} is VALID [2022-04-27 15:31:19,551 INFO L290 TraceCheckUtils]: 142: Hoare triple {109342#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {109342#false} is VALID [2022-04-27 15:31:19,551 INFO L290 TraceCheckUtils]: 143: Hoare triple {109342#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {109342#false} is VALID [2022-04-27 15:31:19,551 INFO L290 TraceCheckUtils]: 144: Hoare triple {109342#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {109342#false} is VALID [2022-04-27 15:31:19,551 INFO L290 TraceCheckUtils]: 145: Hoare triple {109342#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {109342#false} is VALID [2022-04-27 15:31:19,551 INFO L290 TraceCheckUtils]: 146: Hoare triple {109342#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {109342#false} is VALID [2022-04-27 15:31:19,551 INFO L290 TraceCheckUtils]: 147: Hoare triple {109342#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {109342#false} is VALID [2022-04-27 15:31:19,551 INFO L290 TraceCheckUtils]: 148: Hoare triple {109342#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {109342#false} is VALID [2022-04-27 15:31:19,551 INFO L290 TraceCheckUtils]: 149: Hoare triple {109342#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {109342#false} is VALID [2022-04-27 15:31:19,552 INFO L290 TraceCheckUtils]: 150: Hoare triple {109342#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {109342#false} is VALID [2022-04-27 15:31:19,552 INFO L290 TraceCheckUtils]: 151: Hoare triple {109342#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {109342#false} is VALID [2022-04-27 15:31:19,552 INFO L290 TraceCheckUtils]: 152: Hoare triple {109342#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {109342#false} is VALID [2022-04-27 15:31:19,552 INFO L290 TraceCheckUtils]: 153: Hoare triple {109342#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {109342#false} is VALID [2022-04-27 15:31:19,552 INFO L290 TraceCheckUtils]: 154: Hoare triple {109342#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {109342#false} is VALID [2022-04-27 15:31:19,552 INFO L290 TraceCheckUtils]: 155: Hoare triple {109342#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {109342#false} is VALID [2022-04-27 15:31:19,552 INFO L290 TraceCheckUtils]: 156: Hoare triple {109342#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {109342#false} is VALID [2022-04-27 15:31:19,552 INFO L290 TraceCheckUtils]: 157: Hoare triple {109342#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {109342#false} is VALID [2022-04-27 15:31:19,552 INFO L290 TraceCheckUtils]: 158: Hoare triple {109342#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {109342#false} is VALID [2022-04-27 15:31:19,552 INFO L290 TraceCheckUtils]: 159: Hoare triple {109342#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {109342#false} is VALID [2022-04-27 15:31:19,552 INFO L290 TraceCheckUtils]: 160: Hoare triple {109342#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {109342#false} is VALID [2022-04-27 15:31:19,552 INFO L290 TraceCheckUtils]: 161: Hoare triple {109342#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {109342#false} is VALID [2022-04-27 15:31:19,552 INFO L290 TraceCheckUtils]: 162: Hoare triple {109342#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {109342#false} is VALID [2022-04-27 15:31:19,552 INFO L290 TraceCheckUtils]: 163: Hoare triple {109342#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {109342#false} is VALID [2022-04-27 15:31:19,552 INFO L290 TraceCheckUtils]: 164: Hoare triple {109342#false} assume 8640 == #t~mem75;havoc #t~mem75; {109342#false} is VALID [2022-04-27 15:31:19,552 INFO L290 TraceCheckUtils]: 165: Hoare triple {109342#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {109342#false} is VALID [2022-04-27 15:31:19,552 INFO L290 TraceCheckUtils]: 166: Hoare triple {109342#false} assume 4 == ~blastFlag~0; {109342#false} is VALID [2022-04-27 15:31:19,552 INFO L290 TraceCheckUtils]: 167: Hoare triple {109342#false} assume !false; {109342#false} is VALID [2022-04-27 15:31:19,553 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-27 15:31:19,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:31:19,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075294228] [2022-04-27 15:31:19,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075294228] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:31:19,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:31:19,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 15:31:19,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420979580] [2022-04-27 15:31:19,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:31:19,554 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-27 15:31:19,554 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:31:19,554 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-27 15:31:19,623 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-27 15:31:19,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 15:31:19,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:31:19,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 15:31:19,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:31:19,623 INFO L87 Difference]: Start difference. First operand 1993 states and 2977 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-27 15:31:23,670 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:31:28,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:31:28,009 INFO L93 Difference]: Finished difference Result 3998 states and 5974 transitions. [2022-04-27 15:31:28,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 15:31:28,009 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-27 15:31:28,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:31:28,010 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-27 15:31:28,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 440 transitions. [2022-04-27 15:31:28,011 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-27 15:31:28,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 440 transitions. [2022-04-27 15:31:28,012 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 440 transitions. [2022-04-27 15:31:28,290 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-27 15:31:28,417 INFO L225 Difference]: With dead ends: 3998 [2022-04-27 15:31:28,417 INFO L226 Difference]: Without dead ends: 2033 [2022-04-27 15:31:28,419 INFO L412 NwaCegarLoop]: 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-27 15:31:28,419 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 147 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 375 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.4s IncrementalHoareTripleChecker+Time [2022-04-27 15:31:28,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 375 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-04-27 15:31:28,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2033 states. [2022-04-27 15:31:28,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2033 to 2029. [2022-04-27 15:31:28,555 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:31:28,557 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2033 states. Second operand has 2029 states, 2024 states have (on average 1.490612648221344) internal successors, (3017), 2024 states have internal predecessors, (3017), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:28,558 INFO L74 IsIncluded]: Start isIncluded. First operand 2033 states. Second operand has 2029 states, 2024 states have (on average 1.490612648221344) internal successors, (3017), 2024 states have internal predecessors, (3017), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:28,559 INFO L87 Difference]: Start difference. First operand 2033 states. Second operand has 2029 states, 2024 states have (on average 1.490612648221344) internal successors, (3017), 2024 states have internal predecessors, (3017), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:28,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:31:28,658 INFO L93 Difference]: Finished difference Result 2033 states and 3025 transitions. [2022-04-27 15:31:28,658 INFO L276 IsEmpty]: Start isEmpty. Operand 2033 states and 3025 transitions. [2022-04-27 15:31:28,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:31:28,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:31:28,661 INFO L74 IsIncluded]: Start isIncluded. First operand has 2029 states, 2024 states have (on average 1.490612648221344) internal successors, (3017), 2024 states have internal predecessors, (3017), 3 states have call successors, (3), 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 2033 states. [2022-04-27 15:31:28,662 INFO L87 Difference]: Start difference. First operand has 2029 states, 2024 states have (on average 1.490612648221344) internal successors, (3017), 2024 states have internal predecessors, (3017), 3 states have call successors, (3), 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 2033 states. [2022-04-27 15:31:28,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:31:28,763 INFO L93 Difference]: Finished difference Result 2033 states and 3025 transitions. [2022-04-27 15:31:28,763 INFO L276 IsEmpty]: Start isEmpty. Operand 2033 states and 3025 transitions. [2022-04-27 15:31:28,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:31:28,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:31:28,764 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:31:28,764 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:31:28,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2029 states, 2024 states have (on average 1.490612648221344) internal successors, (3017), 2024 states have internal predecessors, (3017), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:28,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2029 states to 2029 states and 3021 transitions. [2022-04-27 15:31:28,879 INFO L78 Accepts]: Start accepts. Automaton has 2029 states and 3021 transitions. Word has length 168 [2022-04-27 15:31:28,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:31:28,879 INFO L495 AbstractCegarLoop]: Abstraction has 2029 states and 3021 transitions. [2022-04-27 15:31:28,879 INFO L496 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-27 15:31:28,879 INFO L276 IsEmpty]: Start isEmpty. Operand 2029 states and 3021 transitions. [2022-04-27 15:31:28,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-04-27 15:31:28,880 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:31:28,880 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:31:28,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-04-27 15:31:28,881 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:31:28,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:31:28,881 INFO L85 PathProgramCache]: Analyzing trace with hash 2037465434, now seen corresponding path program 1 times [2022-04-27 15:31:28,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:31:28,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981363944] [2022-04-27 15:31:28,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:31:28,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:31:29,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:31:29,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:31:29,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:31:29,211 INFO L290 TraceCheckUtils]: 0: Hoare triple {120043#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {120034#true} is VALID [2022-04-27 15:31:29,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {120034#true} assume true; {120034#true} is VALID [2022-04-27 15:31:29,211 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {120034#true} {120034#true} #689#return; {120034#true} is VALID [2022-04-27 15:31:29,212 INFO L272 TraceCheckUtils]: 0: Hoare triple {120034#true} call ULTIMATE.init(); {120043#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:31:29,212 INFO L290 TraceCheckUtils]: 1: Hoare triple {120043#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {120034#true} is VALID [2022-04-27 15:31:29,212 INFO L290 TraceCheckUtils]: 2: Hoare triple {120034#true} assume true; {120034#true} is VALID [2022-04-27 15:31:29,212 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {120034#true} {120034#true} #689#return; {120034#true} is VALID [2022-04-27 15:31:29,212 INFO L272 TraceCheckUtils]: 4: Hoare triple {120034#true} call #t~ret161 := main(); {120034#true} is VALID [2022-04-27 15:31:29,212 INFO L290 TraceCheckUtils]: 5: Hoare triple {120034#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; {120034#true} is VALID [2022-04-27 15:31:29,213 INFO L290 TraceCheckUtils]: 6: Hoare triple {120034#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {120039#(and (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 136)) 0) (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 136)) 0))} is VALID [2022-04-27 15:31:29,213 INFO L272 TraceCheckUtils]: 7: Hoare triple {120039#(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); {120040#(and (= (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ |ssl3_accept_#in~s.offset| 136)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ssl3_accept_#in~s.base|) (+ |ssl3_accept_#in~s.offset| 136))))} is VALID [2022-04-27 15:31:29,215 INFO L290 TraceCheckUtils]: 8: Hoare triple {120040#(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); {120041#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} is VALID [2022-04-27 15:31:29,216 INFO L290 TraceCheckUtils]: 9: Hoare triple {120041#(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; {120041#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} is VALID [2022-04-27 15:31:29,217 INFO L290 TraceCheckUtils]: 10: Hoare triple {120041#(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; {120041#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} is VALID [2022-04-27 15:31:29,217 INFO L290 TraceCheckUtils]: 11: Hoare triple {120041#(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)))); {120041#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} is VALID [2022-04-27 15:31:29,217 INFO L290 TraceCheckUtils]: 12: Hoare triple {120041#(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); {120042#(and (= |ssl3_accept_#t~mem45.base| 0) (= |ssl3_accept_#t~mem45.offset| 0))} is VALID [2022-04-27 15:31:29,218 INFO L290 TraceCheckUtils]: 13: Hoare triple {120042#(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; {120035#false} is VALID [2022-04-27 15:31:29,218 INFO L290 TraceCheckUtils]: 14: Hoare triple {120035#false} assume !false; {120035#false} is VALID [2022-04-27 15:31:29,218 INFO L290 TraceCheckUtils]: 15: Hoare triple {120035#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); {120035#false} is VALID [2022-04-27 15:31:29,218 INFO L290 TraceCheckUtils]: 16: Hoare triple {120035#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,218 INFO L290 TraceCheckUtils]: 17: Hoare triple {120035#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,218 INFO L290 TraceCheckUtils]: 18: Hoare triple {120035#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,218 INFO L290 TraceCheckUtils]: 19: Hoare triple {120035#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,218 INFO L290 TraceCheckUtils]: 20: Hoare triple {120035#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,218 INFO L290 TraceCheckUtils]: 21: Hoare triple {120035#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,218 INFO L290 TraceCheckUtils]: 22: Hoare triple {120035#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,218 INFO L290 TraceCheckUtils]: 23: Hoare triple {120035#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,218 INFO L290 TraceCheckUtils]: 24: Hoare triple {120035#false} assume 8464 == #t~mem55;havoc #t~mem55; {120035#false} is VALID [2022-04-27 15:31:29,218 INFO L290 TraceCheckUtils]: 25: Hoare triple {120035#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; {120035#false} is VALID [2022-04-27 15:31:29,218 INFO L290 TraceCheckUtils]: 26: Hoare triple {120035#false} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {120035#false} is VALID [2022-04-27 15:31:29,218 INFO L290 TraceCheckUtils]: 27: Hoare triple {120035#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); {120035#false} is VALID [2022-04-27 15:31:29,218 INFO L290 TraceCheckUtils]: 28: Hoare triple {120035#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); {120035#false} is VALID [2022-04-27 15:31:29,219 INFO L290 TraceCheckUtils]: 29: Hoare triple {120035#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {120035#false} is VALID [2022-04-27 15:31:29,219 INFO L290 TraceCheckUtils]: 30: Hoare triple {120035#false} ~skip~0 := 0; {120035#false} is VALID [2022-04-27 15:31:29,219 INFO L290 TraceCheckUtils]: 31: Hoare triple {120035#false} assume !false; {120035#false} is VALID [2022-04-27 15:31:29,219 INFO L290 TraceCheckUtils]: 32: Hoare triple {120035#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); {120035#false} is VALID [2022-04-27 15:31:29,219 INFO L290 TraceCheckUtils]: 33: Hoare triple {120035#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,219 INFO L290 TraceCheckUtils]: 34: Hoare triple {120035#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,219 INFO L290 TraceCheckUtils]: 35: Hoare triple {120035#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,219 INFO L290 TraceCheckUtils]: 36: Hoare triple {120035#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,219 INFO L290 TraceCheckUtils]: 37: Hoare triple {120035#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,219 INFO L290 TraceCheckUtils]: 38: Hoare triple {120035#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,219 INFO L290 TraceCheckUtils]: 39: Hoare triple {120035#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,219 INFO L290 TraceCheckUtils]: 40: Hoare triple {120035#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,219 INFO L290 TraceCheckUtils]: 41: Hoare triple {120035#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,219 INFO L290 TraceCheckUtils]: 42: Hoare triple {120035#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,219 INFO L290 TraceCheckUtils]: 43: Hoare triple {120035#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,219 INFO L290 TraceCheckUtils]: 44: Hoare triple {120035#false} assume 8496 == #t~mem58;havoc #t~mem58; {120035#false} is VALID [2022-04-27 15:31:29,219 INFO L290 TraceCheckUtils]: 45: Hoare triple {120035#false} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {120035#false} is VALID [2022-04-27 15:31:29,220 INFO L290 TraceCheckUtils]: 46: Hoare triple {120035#false} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {120035#false} is VALID [2022-04-27 15:31:29,220 INFO L290 TraceCheckUtils]: 47: Hoare triple {120035#false} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,220 INFO L290 TraceCheckUtils]: 48: Hoare triple {120035#false} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,220 INFO L290 TraceCheckUtils]: 49: Hoare triple {120035#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,220 INFO L290 TraceCheckUtils]: 50: Hoare triple {120035#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); {120035#false} is VALID [2022-04-27 15:31:29,220 INFO L290 TraceCheckUtils]: 51: Hoare triple {120035#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {120035#false} is VALID [2022-04-27 15:31:29,220 INFO L290 TraceCheckUtils]: 52: Hoare triple {120035#false} ~skip~0 := 0; {120035#false} is VALID [2022-04-27 15:31:29,220 INFO L290 TraceCheckUtils]: 53: Hoare triple {120035#false} assume !false; {120035#false} is VALID [2022-04-27 15:31:29,220 INFO L290 TraceCheckUtils]: 54: Hoare triple {120035#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); {120035#false} is VALID [2022-04-27 15:31:29,220 INFO L290 TraceCheckUtils]: 55: Hoare triple {120035#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,220 INFO L290 TraceCheckUtils]: 56: Hoare triple {120035#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,220 INFO L290 TraceCheckUtils]: 57: Hoare triple {120035#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,220 INFO L290 TraceCheckUtils]: 58: Hoare triple {120035#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,220 INFO L290 TraceCheckUtils]: 59: Hoare triple {120035#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,220 INFO L290 TraceCheckUtils]: 60: Hoare triple {120035#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,220 INFO L290 TraceCheckUtils]: 61: Hoare triple {120035#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,220 INFO L290 TraceCheckUtils]: 62: Hoare triple {120035#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,220 INFO L290 TraceCheckUtils]: 63: Hoare triple {120035#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,221 INFO L290 TraceCheckUtils]: 64: Hoare triple {120035#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,221 INFO L290 TraceCheckUtils]: 65: Hoare triple {120035#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,221 INFO L290 TraceCheckUtils]: 66: Hoare triple {120035#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,221 INFO L290 TraceCheckUtils]: 67: Hoare triple {120035#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,221 INFO L290 TraceCheckUtils]: 68: Hoare triple {120035#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,221 INFO L290 TraceCheckUtils]: 69: Hoare triple {120035#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,221 INFO L290 TraceCheckUtils]: 70: Hoare triple {120035#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,221 INFO L290 TraceCheckUtils]: 71: Hoare triple {120035#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,221 INFO L290 TraceCheckUtils]: 72: Hoare triple {120035#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,221 INFO L290 TraceCheckUtils]: 73: Hoare triple {120035#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,221 INFO L290 TraceCheckUtils]: 74: Hoare triple {120035#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,221 INFO L290 TraceCheckUtils]: 75: Hoare triple {120035#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,221 INFO L290 TraceCheckUtils]: 76: Hoare triple {120035#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,221 INFO L290 TraceCheckUtils]: 77: Hoare triple {120035#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,221 INFO L290 TraceCheckUtils]: 78: Hoare triple {120035#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,221 INFO L290 TraceCheckUtils]: 79: Hoare triple {120035#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,221 INFO L290 TraceCheckUtils]: 80: Hoare triple {120035#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,221 INFO L290 TraceCheckUtils]: 81: Hoare triple {120035#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,222 INFO L290 TraceCheckUtils]: 82: Hoare triple {120035#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,222 INFO L290 TraceCheckUtils]: 83: Hoare triple {120035#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,222 INFO L290 TraceCheckUtils]: 84: Hoare triple {120035#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,222 INFO L290 TraceCheckUtils]: 85: Hoare triple {120035#false} assume 8656 == #t~mem77;havoc #t~mem77; {120035#false} is VALID [2022-04-27 15:31:29,222 INFO L290 TraceCheckUtils]: 86: Hoare triple {120035#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; {120035#false} is VALID [2022-04-27 15:31:29,222 INFO L290 TraceCheckUtils]: 87: Hoare triple {120035#false} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {120035#false} is VALID [2022-04-27 15:31:29,222 INFO L290 TraceCheckUtils]: 88: Hoare triple {120035#false} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {120035#false} is VALID [2022-04-27 15:31:29,222 INFO L290 TraceCheckUtils]: 89: Hoare triple {120035#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); {120035#false} is VALID [2022-04-27 15:31:29,222 INFO L290 TraceCheckUtils]: 90: Hoare triple {120035#false} assume !(0 == ~tmp___10~0); {120035#false} is VALID [2022-04-27 15:31:29,222 INFO L290 TraceCheckUtils]: 91: Hoare triple {120035#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); {120035#false} is VALID [2022-04-27 15:31:29,222 INFO L290 TraceCheckUtils]: 92: Hoare triple {120035#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {120035#false} is VALID [2022-04-27 15:31:29,222 INFO L290 TraceCheckUtils]: 93: Hoare triple {120035#false} ~skip~0 := 0; {120035#false} is VALID [2022-04-27 15:31:29,222 INFO L290 TraceCheckUtils]: 94: Hoare triple {120035#false} assume !false; {120035#false} is VALID [2022-04-27 15:31:29,222 INFO L290 TraceCheckUtils]: 95: Hoare triple {120035#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); {120035#false} is VALID [2022-04-27 15:31:29,222 INFO L290 TraceCheckUtils]: 96: Hoare triple {120035#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,222 INFO L290 TraceCheckUtils]: 97: Hoare triple {120035#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,222 INFO L290 TraceCheckUtils]: 98: Hoare triple {120035#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,223 INFO L290 TraceCheckUtils]: 99: Hoare triple {120035#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,223 INFO L290 TraceCheckUtils]: 100: Hoare triple {120035#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,223 INFO L290 TraceCheckUtils]: 101: Hoare triple {120035#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,223 INFO L290 TraceCheckUtils]: 102: Hoare triple {120035#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,223 INFO L290 TraceCheckUtils]: 103: Hoare triple {120035#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,223 INFO L290 TraceCheckUtils]: 104: Hoare triple {120035#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,223 INFO L290 TraceCheckUtils]: 105: Hoare triple {120035#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,223 INFO L290 TraceCheckUtils]: 106: Hoare triple {120035#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,223 INFO L290 TraceCheckUtils]: 107: Hoare triple {120035#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,223 INFO L290 TraceCheckUtils]: 108: Hoare triple {120035#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,223 INFO L290 TraceCheckUtils]: 109: Hoare triple {120035#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,223 INFO L290 TraceCheckUtils]: 110: Hoare triple {120035#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,223 INFO L290 TraceCheckUtils]: 111: Hoare triple {120035#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,223 INFO L290 TraceCheckUtils]: 112: Hoare triple {120035#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,223 INFO L290 TraceCheckUtils]: 113: Hoare triple {120035#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,223 INFO L290 TraceCheckUtils]: 114: Hoare triple {120035#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,223 INFO L290 TraceCheckUtils]: 115: Hoare triple {120035#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,223 INFO L290 TraceCheckUtils]: 116: Hoare triple {120035#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,224 INFO L290 TraceCheckUtils]: 117: Hoare triple {120035#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,224 INFO L290 TraceCheckUtils]: 118: Hoare triple {120035#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,224 INFO L290 TraceCheckUtils]: 119: Hoare triple {120035#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,224 INFO L290 TraceCheckUtils]: 120: Hoare triple {120035#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,224 INFO L290 TraceCheckUtils]: 121: Hoare triple {120035#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,224 INFO L290 TraceCheckUtils]: 122: Hoare triple {120035#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,224 INFO L290 TraceCheckUtils]: 123: Hoare triple {120035#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,224 INFO L290 TraceCheckUtils]: 124: Hoare triple {120035#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,224 INFO L290 TraceCheckUtils]: 125: Hoare triple {120035#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,224 INFO L290 TraceCheckUtils]: 126: Hoare triple {120035#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,224 INFO L290 TraceCheckUtils]: 127: Hoare triple {120035#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,224 INFO L290 TraceCheckUtils]: 128: Hoare triple {120035#false} assume 8672 == #t~mem79;havoc #t~mem79; {120035#false} is VALID [2022-04-27 15:31:29,224 INFO L290 TraceCheckUtils]: 129: Hoare triple {120035#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {120035#false} is VALID [2022-04-27 15:31:29,224 INFO L290 TraceCheckUtils]: 130: Hoare triple {120035#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {120035#false} is VALID [2022-04-27 15:31:29,224 INFO L290 TraceCheckUtils]: 131: Hoare triple {120035#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); {120035#false} is VALID [2022-04-27 15:31:29,224 INFO L290 TraceCheckUtils]: 132: Hoare triple {120035#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; {120035#false} is VALID [2022-04-27 15:31:29,224 INFO L290 TraceCheckUtils]: 133: Hoare triple {120035#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,224 INFO L290 TraceCheckUtils]: 134: Hoare triple {120035#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); {120035#false} is VALID [2022-04-27 15:31:29,225 INFO L290 TraceCheckUtils]: 135: Hoare triple {120035#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {120035#false} is VALID [2022-04-27 15:31:29,225 INFO L290 TraceCheckUtils]: 136: Hoare triple {120035#false} ~skip~0 := 0; {120035#false} is VALID [2022-04-27 15:31:29,225 INFO L290 TraceCheckUtils]: 137: Hoare triple {120035#false} assume !false; {120035#false} is VALID [2022-04-27 15:31:29,225 INFO L290 TraceCheckUtils]: 138: Hoare triple {120035#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); {120035#false} is VALID [2022-04-27 15:31:29,225 INFO L290 TraceCheckUtils]: 139: Hoare triple {120035#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,225 INFO L290 TraceCheckUtils]: 140: Hoare triple {120035#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,225 INFO L290 TraceCheckUtils]: 141: Hoare triple {120035#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,225 INFO L290 TraceCheckUtils]: 142: Hoare triple {120035#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,225 INFO L290 TraceCheckUtils]: 143: Hoare triple {120035#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,225 INFO L290 TraceCheckUtils]: 144: Hoare triple {120035#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,225 INFO L290 TraceCheckUtils]: 145: Hoare triple {120035#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,225 INFO L290 TraceCheckUtils]: 146: Hoare triple {120035#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,225 INFO L290 TraceCheckUtils]: 147: Hoare triple {120035#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,225 INFO L290 TraceCheckUtils]: 148: Hoare triple {120035#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,225 INFO L290 TraceCheckUtils]: 149: Hoare triple {120035#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,225 INFO L290 TraceCheckUtils]: 150: Hoare triple {120035#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,225 INFO L290 TraceCheckUtils]: 151: Hoare triple {120035#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,225 INFO L290 TraceCheckUtils]: 152: Hoare triple {120035#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,226 INFO L290 TraceCheckUtils]: 153: Hoare triple {120035#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,226 INFO L290 TraceCheckUtils]: 154: Hoare triple {120035#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,226 INFO L290 TraceCheckUtils]: 155: Hoare triple {120035#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,226 INFO L290 TraceCheckUtils]: 156: Hoare triple {120035#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,226 INFO L290 TraceCheckUtils]: 157: Hoare triple {120035#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,226 INFO L290 TraceCheckUtils]: 158: Hoare triple {120035#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,226 INFO L290 TraceCheckUtils]: 159: Hoare triple {120035#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,226 INFO L290 TraceCheckUtils]: 160: Hoare triple {120035#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,226 INFO L290 TraceCheckUtils]: 161: Hoare triple {120035#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,226 INFO L290 TraceCheckUtils]: 162: Hoare triple {120035#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,226 INFO L290 TraceCheckUtils]: 163: Hoare triple {120035#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,226 INFO L290 TraceCheckUtils]: 164: Hoare triple {120035#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,226 INFO L290 TraceCheckUtils]: 165: Hoare triple {120035#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,226 INFO L290 TraceCheckUtils]: 166: Hoare triple {120035#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {120035#false} is VALID [2022-04-27 15:31:29,226 INFO L290 TraceCheckUtils]: 167: Hoare triple {120035#false} assume 8640 == #t~mem75;havoc #t~mem75; {120035#false} is VALID [2022-04-27 15:31:29,226 INFO L290 TraceCheckUtils]: 168: Hoare triple {120035#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {120035#false} is VALID [2022-04-27 15:31:29,226 INFO L290 TraceCheckUtils]: 169: Hoare triple {120035#false} assume 4 == ~blastFlag~0; {120035#false} is VALID [2022-04-27 15:31:29,227 INFO L290 TraceCheckUtils]: 170: Hoare triple {120035#false} assume !false; {120035#false} is VALID [2022-04-27 15:31:29,227 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2022-04-27 15:31:29,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:31:29,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981363944] [2022-04-27 15:31:29,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981363944] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:31:29,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:31:29,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 15:31:29,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108873739] [2022-04-27 15:31:29,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:31:29,228 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-27 15:31:29,228 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:31:29,228 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-27 15:31:29,292 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:31:29,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 15:31:29,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:31:29,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 15:31:29,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-27 15:31:29,292 INFO L87 Difference]: Start difference. First operand 2029 states and 3021 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-27 15:31:30,923 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:31:36,976 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:31:39,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:31:39,997 INFO L93 Difference]: Finished difference Result 4051 states and 6034 transitions. [2022-04-27 15:31:39,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 15:31:39,998 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-27 15:31:39,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:31:39,998 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-27 15:31:39,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 422 transitions. [2022-04-27 15:31:39,999 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-27 15:31:40,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 422 transitions. [2022-04-27 15:31:40,001 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 422 transitions. [2022-04-27 15:31:40,276 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 422 edges. 422 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:31:40,401 INFO L225 Difference]: With dead ends: 4051 [2022-04-27 15:31:40,401 INFO L226 Difference]: Without dead ends: 2029 [2022-04-27 15:31:40,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-27 15:31:40,403 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 7 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s 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.5s IncrementalHoareTripleChecker+Time [2022-04-27 15:31:40,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 841 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-04-27 15:31:40,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2029 states. [2022-04-27 15:31:40,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2029 to 2029. [2022-04-27 15:31:40,543 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:31:40,545 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2029 states. Second operand has 2029 states, 2024 states have (on average 1.4901185770750989) internal successors, (3016), 2024 states have internal predecessors, (3016), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:40,546 INFO L74 IsIncluded]: Start isIncluded. First operand 2029 states. Second operand has 2029 states, 2024 states have (on average 1.4901185770750989) internal successors, (3016), 2024 states have internal predecessors, (3016), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:40,547 INFO L87 Difference]: Start difference. First operand 2029 states. Second operand has 2029 states, 2024 states have (on average 1.4901185770750989) internal successors, (3016), 2024 states have internal predecessors, (3016), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:40,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:31:40,648 INFO L93 Difference]: Finished difference Result 2029 states and 3020 transitions. [2022-04-27 15:31:40,648 INFO L276 IsEmpty]: Start isEmpty. Operand 2029 states and 3020 transitions. [2022-04-27 15:31:40,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:31:40,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:31:40,652 INFO L74 IsIncluded]: Start isIncluded. First operand has 2029 states, 2024 states have (on average 1.4901185770750989) internal successors, (3016), 2024 states have internal predecessors, (3016), 3 states have call successors, (3), 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 2029 states. [2022-04-27 15:31:40,653 INFO L87 Difference]: Start difference. First operand has 2029 states, 2024 states have (on average 1.4901185770750989) internal successors, (3016), 2024 states have internal predecessors, (3016), 3 states have call successors, (3), 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 2029 states. [2022-04-27 15:31:40,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:31:40,753 INFO L93 Difference]: Finished difference Result 2029 states and 3020 transitions. [2022-04-27 15:31:40,753 INFO L276 IsEmpty]: Start isEmpty. Operand 2029 states and 3020 transitions. [2022-04-27 15:31:40,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:31:40,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:31:40,754 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:31:40,754 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:31:40,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2029 states, 2024 states have (on average 1.4901185770750989) internal successors, (3016), 2024 states have internal predecessors, (3016), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:40,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2029 states to 2029 states and 3020 transitions. [2022-04-27 15:31:40,897 INFO L78 Accepts]: Start accepts. Automaton has 2029 states and 3020 transitions. Word has length 171 [2022-04-27 15:31:40,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:31:40,897 INFO L495 AbstractCegarLoop]: Abstraction has 2029 states and 3020 transitions. [2022-04-27 15:31:40,897 INFO L496 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-27 15:31:40,897 INFO L276 IsEmpty]: Start isEmpty. Operand 2029 states and 3020 transitions. [2022-04-27 15:31:40,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-04-27 15:31:40,899 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:31:40,899 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:31:40,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-04-27 15:31:40,899 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:31:40,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:31:40,899 INFO L85 PathProgramCache]: Analyzing trace with hash 114215004, now seen corresponding path program 1 times [2022-04-27 15:31:40,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:31:40,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104503470] [2022-04-27 15:31:40,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:31:40,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:31:41,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:31:41,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:31:41,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:31:41,866 INFO L290 TraceCheckUtils]: 0: Hoare triple {130797#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {130783#true} is VALID [2022-04-27 15:31:41,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {130783#true} assume true; {130783#true} is VALID [2022-04-27 15:31:41,866 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {130783#true} {130783#true} #689#return; {130783#true} is VALID [2022-04-27 15:31:41,867 INFO L272 TraceCheckUtils]: 0: Hoare triple {130783#true} call ULTIMATE.init(); {130797#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:31:41,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {130797#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {130783#true} is VALID [2022-04-27 15:31:41,867 INFO L290 TraceCheckUtils]: 2: Hoare triple {130783#true} assume true; {130783#true} is VALID [2022-04-27 15:31:41,867 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {130783#true} {130783#true} #689#return; {130783#true} is VALID [2022-04-27 15:31:41,867 INFO L272 TraceCheckUtils]: 4: Hoare triple {130783#true} call #t~ret161 := main(); {130783#true} is VALID [2022-04-27 15:31:41,879 INFO L290 TraceCheckUtils]: 5: Hoare triple {130783#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; {130788#(and (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 84)) 0) (= (select |#valid| main_~s~0.base) 1) (<= main_~s~0.offset 0) (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 176 main_~s~0.offset)))))} is VALID [2022-04-27 15:31:41,881 INFO L290 TraceCheckUtils]: 6: Hoare triple {130788#(and (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 84)) 0) (= (select |#valid| main_~s~0.base) 1) (<= main_~s~0.offset 0) (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 176 main_~s~0.offset)))))} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {130789#(and (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 84)) 0) (<= main_~s~0.offset 0) (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 176 main_~s~0.offset)))))} is VALID [2022-04-27 15:31:41,882 INFO L272 TraceCheckUtils]: 7: Hoare triple {130789#(and (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 84)) 0) (<= main_~s~0.offset 0) (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 176 main_~s~0.offset)))))} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {130790#(and (= (select (select |#memory_$Pointer$.offset| |ssl3_accept_#in~s.base|) (+ 84 |ssl3_accept_#in~s.offset|)) 0) (not (= |ssl3_accept_#in~s.base| (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ 176 |ssl3_accept_#in~s.offset|)))) (<= |ssl3_accept_#in~s.offset| 0))} is VALID [2022-04-27 15:31:41,884 INFO L290 TraceCheckUtils]: 8: Hoare triple {130790#(and (= (select (select |#memory_$Pointer$.offset| |ssl3_accept_#in~s.base|) (+ 84 |ssl3_accept_#in~s.offset|)) 0) (not (= |ssl3_accept_#in~s.base| (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ 176 |ssl3_accept_#in~s.offset|)))) (<= |ssl3_accept_#in~s.offset| 0))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {130791#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-27 15:31:41,884 INFO L290 TraceCheckUtils]: 9: Hoare triple {130791#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {130791#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-27 15:31:41,885 INFO L290 TraceCheckUtils]: 10: Hoare triple {130791#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {130791#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-27 15:31:41,886 INFO L290 TraceCheckUtils]: 11: Hoare triple {130791#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {130791#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-27 15:31:41,886 INFO L290 TraceCheckUtils]: 12: Hoare triple {130791#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {130791#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-27 15:31:41,887 INFO L290 TraceCheckUtils]: 13: Hoare triple {130791#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {130791#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-27 15:31:41,887 INFO L290 TraceCheckUtils]: 14: Hoare triple {130791#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} assume !false; {130791#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-27 15:31:41,887 INFO L290 TraceCheckUtils]: 15: Hoare triple {130791#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {130791#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-27 15:31:41,888 INFO L290 TraceCheckUtils]: 16: Hoare triple {130791#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {130791#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-27 15:31:41,888 INFO L290 TraceCheckUtils]: 17: Hoare triple {130791#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {130791#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-27 15:31:41,889 INFO L290 TraceCheckUtils]: 18: Hoare triple {130791#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {130791#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-27 15:31:41,889 INFO L290 TraceCheckUtils]: 19: Hoare triple {130791#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {130791#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-27 15:31:41,890 INFO L290 TraceCheckUtils]: 20: Hoare triple {130791#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {130791#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-27 15:31:41,890 INFO L290 TraceCheckUtils]: 21: Hoare triple {130791#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {130791#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-27 15:31:41,891 INFO L290 TraceCheckUtils]: 22: Hoare triple {130791#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {130791#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-27 15:31:41,891 INFO L290 TraceCheckUtils]: 23: Hoare triple {130791#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {130791#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-27 15:31:41,892 INFO L290 TraceCheckUtils]: 24: Hoare triple {130791#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} assume 8464 == #t~mem55;havoc #t~mem55; {130791#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-27 15:31:41,892 INFO L290 TraceCheckUtils]: 25: Hoare triple {130791#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {130791#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-27 15:31:41,893 INFO L290 TraceCheckUtils]: 26: Hoare triple {130791#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {130791#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-27 15:31:41,894 INFO L290 TraceCheckUtils]: 27: Hoare triple {130791#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {130791#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-27 15:31:41,895 INFO L290 TraceCheckUtils]: 28: Hoare triple {130791#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:31:41,895 INFO L290 TraceCheckUtils]: 29: Hoare triple {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:31:41,895 INFO L290 TraceCheckUtils]: 30: Hoare triple {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} ~skip~0 := 0; {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:31:41,896 INFO L290 TraceCheckUtils]: 31: Hoare triple {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !false; {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:31:41,896 INFO L290 TraceCheckUtils]: 32: Hoare triple {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:31:41,897 INFO L290 TraceCheckUtils]: 33: Hoare triple {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:31:41,897 INFO L290 TraceCheckUtils]: 34: Hoare triple {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:31:41,898 INFO L290 TraceCheckUtils]: 35: Hoare triple {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:31:41,898 INFO L290 TraceCheckUtils]: 36: Hoare triple {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:31:41,898 INFO L290 TraceCheckUtils]: 37: Hoare triple {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:31:41,899 INFO L290 TraceCheckUtils]: 38: Hoare triple {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:31:41,899 INFO L290 TraceCheckUtils]: 39: Hoare triple {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:31:41,900 INFO L290 TraceCheckUtils]: 40: Hoare triple {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:31:41,900 INFO L290 TraceCheckUtils]: 41: Hoare triple {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:31:41,901 INFO L290 TraceCheckUtils]: 42: Hoare triple {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:31:41,901 INFO L290 TraceCheckUtils]: 43: Hoare triple {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:31:41,901 INFO L290 TraceCheckUtils]: 44: Hoare triple {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume 8496 == #t~mem58;havoc #t~mem58; {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:31:41,902 INFO L290 TraceCheckUtils]: 45: Hoare triple {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:31:41,902 INFO L290 TraceCheckUtils]: 46: Hoare triple {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:31:41,903 INFO L290 TraceCheckUtils]: 47: Hoare triple {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:31:41,904 INFO L290 TraceCheckUtils]: 48: Hoare triple {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:31:41,904 INFO L290 TraceCheckUtils]: 49: Hoare triple {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:31:41,905 INFO L290 TraceCheckUtils]: 50: Hoare triple {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:31:41,905 INFO L290 TraceCheckUtils]: 51: Hoare triple {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:31:41,906 INFO L290 TraceCheckUtils]: 52: Hoare triple {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} ~skip~0 := 0; {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:31:41,906 INFO L290 TraceCheckUtils]: 53: Hoare triple {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !false; {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:31:41,907 INFO L290 TraceCheckUtils]: 54: Hoare triple {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:31:41,907 INFO L290 TraceCheckUtils]: 55: Hoare triple {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:31:41,908 INFO L290 TraceCheckUtils]: 56: Hoare triple {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:31:41,908 INFO L290 TraceCheckUtils]: 57: Hoare triple {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:31:41,908 INFO L290 TraceCheckUtils]: 58: Hoare triple {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:31:41,909 INFO L290 TraceCheckUtils]: 59: Hoare triple {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:31:41,909 INFO L290 TraceCheckUtils]: 60: Hoare triple {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:31:41,910 INFO L290 TraceCheckUtils]: 61: Hoare triple {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:31:41,910 INFO L290 TraceCheckUtils]: 62: Hoare triple {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:31:41,911 INFO L290 TraceCheckUtils]: 63: Hoare triple {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:31:41,911 INFO L290 TraceCheckUtils]: 64: Hoare triple {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:31:41,911 INFO L290 TraceCheckUtils]: 65: Hoare triple {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:31:41,912 INFO L290 TraceCheckUtils]: 66: Hoare triple {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:31:41,912 INFO L290 TraceCheckUtils]: 67: Hoare triple {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:31:41,913 INFO L290 TraceCheckUtils]: 68: Hoare triple {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:31:41,913 INFO L290 TraceCheckUtils]: 69: Hoare triple {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:31:41,914 INFO L290 TraceCheckUtils]: 70: Hoare triple {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:31:41,914 INFO L290 TraceCheckUtils]: 71: Hoare triple {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:31:41,915 INFO L290 TraceCheckUtils]: 72: Hoare triple {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:31:41,915 INFO L290 TraceCheckUtils]: 73: Hoare triple {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:31:41,915 INFO L290 TraceCheckUtils]: 74: Hoare triple {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:31:41,916 INFO L290 TraceCheckUtils]: 75: Hoare triple {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:31:41,916 INFO L290 TraceCheckUtils]: 76: Hoare triple {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:31:41,917 INFO L290 TraceCheckUtils]: 77: Hoare triple {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:31:41,917 INFO L290 TraceCheckUtils]: 78: Hoare triple {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:31:41,918 INFO L290 TraceCheckUtils]: 79: Hoare triple {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:31:41,918 INFO L290 TraceCheckUtils]: 80: Hoare triple {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:31:41,919 INFO L290 TraceCheckUtils]: 81: Hoare triple {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:31:41,919 INFO L290 TraceCheckUtils]: 82: Hoare triple {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:31:41,919 INFO L290 TraceCheckUtils]: 83: Hoare triple {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:31:41,920 INFO L290 TraceCheckUtils]: 84: Hoare triple {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:31:41,920 INFO L290 TraceCheckUtils]: 85: Hoare triple {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume 8656 == #t~mem77;havoc #t~mem77; {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:31:41,921 INFO L290 TraceCheckUtils]: 86: Hoare triple {130792#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} call #t~mem140.base, #t~mem140.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem141.base, #t~mem141.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem142.base, #t~mem142.offset := read~$Pointer$(#t~mem141.base, 836 + #t~mem141.offset, 4);call write~$Pointer$(#t~mem142.base, #t~mem142.offset, #t~mem140.base, 172 + #t~mem140.offset, 4);havoc #t~mem140.base, #t~mem140.offset;havoc #t~mem141.base, #t~mem141.offset;havoc #t~mem142.base, #t~mem142.offset; {130793#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:31:41,922 INFO L290 TraceCheckUtils]: 87: Hoare triple {130793#(<= 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; {130793#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:31:41,922 INFO L290 TraceCheckUtils]: 88: Hoare triple {130793#(<= 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; {130793#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:31:41,923 INFO L290 TraceCheckUtils]: 89: Hoare triple {130793#(<= 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); {130793#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:31:41,923 INFO L290 TraceCheckUtils]: 90: Hoare triple {130793#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(0 == ~tmp___10~0); {130793#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:31:41,924 INFO L290 TraceCheckUtils]: 91: Hoare triple {130793#(<= 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); {130793#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:31:41,924 INFO L290 TraceCheckUtils]: 92: Hoare triple {130793#(<= 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; {130793#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:31:41,924 INFO L290 TraceCheckUtils]: 93: Hoare triple {130793#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} ~skip~0 := 0; {130793#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:31:41,925 INFO L290 TraceCheckUtils]: 94: Hoare triple {130793#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !false; {130793#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:31:41,925 INFO L290 TraceCheckUtils]: 95: Hoare triple {130793#(<= 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); {130793#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:31:41,925 INFO L290 TraceCheckUtils]: 96: Hoare triple {130793#(<= 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); {130793#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:31:41,926 INFO L290 TraceCheckUtils]: 97: Hoare triple {130793#(<= 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); {130793#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:31:41,926 INFO L290 TraceCheckUtils]: 98: Hoare triple {130793#(<= 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); {130793#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:31:41,927 INFO L290 TraceCheckUtils]: 99: Hoare triple {130793#(<= 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); {130793#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:31:41,927 INFO L290 TraceCheckUtils]: 100: Hoare triple {130793#(<= 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); {130793#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:31:41,927 INFO L290 TraceCheckUtils]: 101: Hoare triple {130793#(<= 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); {130793#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:31:41,928 INFO L290 TraceCheckUtils]: 102: Hoare triple {130793#(<= 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); {130793#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:31:41,928 INFO L290 TraceCheckUtils]: 103: Hoare triple {130793#(<= 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); {130793#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:31:41,928 INFO L290 TraceCheckUtils]: 104: Hoare triple {130793#(<= 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); {130793#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:31:41,929 INFO L290 TraceCheckUtils]: 105: Hoare triple {130793#(<= 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); {130793#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:31:41,929 INFO L290 TraceCheckUtils]: 106: Hoare triple {130793#(<= 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); {130793#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:31:41,929 INFO L290 TraceCheckUtils]: 107: Hoare triple {130793#(<= 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); {130793#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:31:41,930 INFO L290 TraceCheckUtils]: 108: Hoare triple {130793#(<= 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); {130793#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:31:41,930 INFO L290 TraceCheckUtils]: 109: Hoare triple {130793#(<= 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); {130793#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:31:41,931 INFO L290 TraceCheckUtils]: 110: Hoare triple {130793#(<= 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); {130793#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:31:41,931 INFO L290 TraceCheckUtils]: 111: Hoare triple {130793#(<= 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); {130793#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:31:41,931 INFO L290 TraceCheckUtils]: 112: Hoare triple {130793#(<= 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); {130793#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:31:41,932 INFO L290 TraceCheckUtils]: 113: Hoare triple {130793#(<= 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); {130793#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:31:41,932 INFO L290 TraceCheckUtils]: 114: Hoare triple {130793#(<= 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); {130793#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:31:41,932 INFO L290 TraceCheckUtils]: 115: Hoare triple {130793#(<= 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); {130793#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:31:41,933 INFO L290 TraceCheckUtils]: 116: Hoare triple {130793#(<= 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); {130793#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:31:41,933 INFO L290 TraceCheckUtils]: 117: Hoare triple {130793#(<= 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); {130793#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:31:41,934 INFO L290 TraceCheckUtils]: 118: Hoare triple {130793#(<= 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); {130793#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:31:41,934 INFO L290 TraceCheckUtils]: 119: Hoare triple {130793#(<= 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); {130793#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:31:41,934 INFO L290 TraceCheckUtils]: 120: Hoare triple {130793#(<= 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); {130793#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:31:41,935 INFO L290 TraceCheckUtils]: 121: Hoare triple {130793#(<= 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); {130793#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:31:41,935 INFO L290 TraceCheckUtils]: 122: Hoare triple {130793#(<= 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); {130793#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:31:41,935 INFO L290 TraceCheckUtils]: 123: Hoare triple {130793#(<= 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); {130793#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:31:41,936 INFO L290 TraceCheckUtils]: 124: Hoare triple {130793#(<= 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); {130793#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:31:41,936 INFO L290 TraceCheckUtils]: 125: Hoare triple {130793#(<= 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); {130793#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:31:41,937 INFO L290 TraceCheckUtils]: 126: Hoare triple {130793#(<= 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); {130793#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:31:41,937 INFO L290 TraceCheckUtils]: 127: Hoare triple {130793#(<= 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); {130793#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:31:41,937 INFO L290 TraceCheckUtils]: 128: Hoare triple {130793#(<= 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; {130793#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:31:41,938 INFO L290 TraceCheckUtils]: 129: Hoare triple {130793#(<= 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; {130793#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:31:41,938 INFO L290 TraceCheckUtils]: 130: Hoare triple {130793#(<= 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; {130793#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:31:41,939 INFO L290 TraceCheckUtils]: 131: Hoare triple {130793#(<= 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); {130794#(and (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))) (not (= (+ (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 792) ssl3_accept_~s.offset)))} is VALID [2022-04-27 15:31:41,940 INFO L290 TraceCheckUtils]: 132: Hoare triple {130794#(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; {130795#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:41,940 INFO L290 TraceCheckUtils]: 133: Hoare triple {130795#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {130795#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:41,941 INFO L290 TraceCheckUtils]: 134: Hoare triple {130795#(= 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); {130795#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:41,941 INFO L290 TraceCheckUtils]: 135: Hoare triple {130795#(= 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; {130795#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:41,941 INFO L290 TraceCheckUtils]: 136: Hoare triple {130795#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {130795#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:41,942 INFO L290 TraceCheckUtils]: 137: Hoare triple {130795#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {130795#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:41,942 INFO L290 TraceCheckUtils]: 138: Hoare triple {130795#(= 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); {130795#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:41,942 INFO L290 TraceCheckUtils]: 139: Hoare triple {130795#(= 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); {130795#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:41,943 INFO L290 TraceCheckUtils]: 140: Hoare triple {130795#(= 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); {130795#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:41,943 INFO L290 TraceCheckUtils]: 141: Hoare triple {130795#(= 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); {130795#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:41,944 INFO L290 TraceCheckUtils]: 142: Hoare triple {130795#(= 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); {130795#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:41,944 INFO L290 TraceCheckUtils]: 143: Hoare triple {130795#(= 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); {130795#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:41,944 INFO L290 TraceCheckUtils]: 144: Hoare triple {130795#(= 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); {130795#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:41,945 INFO L290 TraceCheckUtils]: 145: Hoare triple {130795#(= 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); {130795#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:41,945 INFO L290 TraceCheckUtils]: 146: Hoare triple {130795#(= 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); {130795#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:41,945 INFO L290 TraceCheckUtils]: 147: Hoare triple {130795#(= 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); {130795#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:41,946 INFO L290 TraceCheckUtils]: 148: Hoare triple {130795#(= 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); {130795#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:41,946 INFO L290 TraceCheckUtils]: 149: Hoare triple {130795#(= 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); {130795#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:41,946 INFO L290 TraceCheckUtils]: 150: Hoare triple {130795#(= 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); {130795#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:41,947 INFO L290 TraceCheckUtils]: 151: Hoare triple {130795#(= 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); {130795#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:41,947 INFO L290 TraceCheckUtils]: 152: Hoare triple {130795#(= 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); {130795#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:41,948 INFO L290 TraceCheckUtils]: 153: Hoare triple {130795#(= 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); {130795#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:41,948 INFO L290 TraceCheckUtils]: 154: Hoare triple {130795#(= 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); {130795#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:41,948 INFO L290 TraceCheckUtils]: 155: Hoare triple {130795#(= 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); {130795#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:41,949 INFO L290 TraceCheckUtils]: 156: Hoare triple {130795#(= 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); {130795#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:41,949 INFO L290 TraceCheckUtils]: 157: Hoare triple {130795#(= 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); {130795#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:41,949 INFO L290 TraceCheckUtils]: 158: Hoare triple {130795#(= 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); {130795#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:41,950 INFO L290 TraceCheckUtils]: 159: Hoare triple {130795#(= 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); {130796#(= 8448 |ssl3_accept_#t~mem68|)} is VALID [2022-04-27 15:31:41,950 INFO L290 TraceCheckUtils]: 160: Hoare triple {130796#(= 8448 |ssl3_accept_#t~mem68|)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {130784#false} is VALID [2022-04-27 15:31:41,950 INFO L290 TraceCheckUtils]: 161: Hoare triple {130784#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {130784#false} is VALID [2022-04-27 15:31:41,950 INFO L290 TraceCheckUtils]: 162: Hoare triple {130784#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {130784#false} is VALID [2022-04-27 15:31:41,950 INFO L290 TraceCheckUtils]: 163: Hoare triple {130784#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {130784#false} is VALID [2022-04-27 15:31:41,950 INFO L290 TraceCheckUtils]: 164: Hoare triple {130784#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {130784#false} is VALID [2022-04-27 15:31:41,950 INFO L290 TraceCheckUtils]: 165: Hoare triple {130784#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {130784#false} is VALID [2022-04-27 15:31:41,950 INFO L290 TraceCheckUtils]: 166: Hoare triple {130784#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {130784#false} is VALID [2022-04-27 15:31:41,950 INFO L290 TraceCheckUtils]: 167: Hoare triple {130784#false} assume 8640 == #t~mem75;havoc #t~mem75; {130784#false} is VALID [2022-04-27 15:31:41,950 INFO L290 TraceCheckUtils]: 168: Hoare triple {130784#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {130784#false} is VALID [2022-04-27 15:31:41,950 INFO L290 TraceCheckUtils]: 169: Hoare triple {130784#false} assume 4 == ~blastFlag~0; {130784#false} is VALID [2022-04-27 15:31:41,951 INFO L290 TraceCheckUtils]: 170: Hoare triple {130784#false} assume !false; {130784#false} is VALID [2022-04-27 15:31:41,952 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 14 proven. 169 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 15:31:41,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:31:41,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104503470] [2022-04-27 15:31:41,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104503470] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 15:31:41,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607389195] [2022-04-27 15:31:41,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:31:41,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 15:31:41,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 15:31:41,954 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 15:31:41,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 15:31:42,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:31:42,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 1153 conjuncts, 238 conjunts are in the unsatisfiable core [2022-04-27 15:31:42,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:31:42,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 15:31:44,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:31:44,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:31:44,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:31:44,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:31:44,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:31:44,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:31:44,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:31:44,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:31:44,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:31:44,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:31:44,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:31:44,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:31:44,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:31:44,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:31:44,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:31:44,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:31:44,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:31:44,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:31:44,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:31:44,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:31:44,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:31:44,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:31:44,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 17 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46491 treesize of output 42234 [2022-04-27 15:31:45,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:31:45,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:31:45,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:31:45,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:31:45,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:31:45,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:31:45,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:31:45,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:31:45,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:31:45,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:31:45,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:31:45,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:31:45,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:31:45,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:31:45,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:31:45,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:31:45,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:31:45,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:31:45,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:31:45,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:31:45,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:31:45,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:31:45,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:31:45,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:31:45,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:31:45,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:31:45,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:31:45,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:31:45,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:31:45,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:31:45,851 INFO L356 Elim1Store]: treesize reduction 353, result has 4.1 percent of original size [2022-04-27 15:31:45,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 24 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 10732225021 treesize of output 2265432804