/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/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/openssl/s3_srvr.blast.15.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 15:32:32,158 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 15:32:32,184 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 15:32:32,222 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 15:32:32,222 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 15:32:32,223 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 15:32:32,226 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 15:32:32,227 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 15:32:32,228 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 15:32:32,232 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 15:32:32,232 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 15:32:32,233 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 15:32:32,233 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 15:32:32,235 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 15:32:32,236 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 15:32:32,238 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 15:32:32,239 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 15:32:32,239 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 15:32:32,241 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 15:32:32,243 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 15:32:32,244 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 15:32:32,246 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 15:32:32,247 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 15:32:32,247 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 15:32:32,248 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 15:32:32,249 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 15:32:32,249 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 15:32:32,249 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 15:32:32,250 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 15:32:32,250 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 15:32:32,251 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 15:32:32,251 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 15:32:32,255 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 15:32:32,255 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 15:32:32,256 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 15:32:32,256 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 15:32:32,256 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 15:32:32,257 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 15:32:32,257 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 15:32:32,257 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 15:32:32,258 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 15:32:32,259 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 15:32:32,260 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 15:32:32,268 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 15:32:32,268 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 15:32:32,269 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 15:32:32,269 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 15:32:32,269 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 15:32:32,269 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 15:32:32,269 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 15:32:32,269 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 15:32:32,269 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 15:32:32,270 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 15:32:32,270 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 15:32:32,270 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 15:32:32,270 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 15:32:32,270 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 15:32:32,270 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 15:32:32,271 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 15:32:32,271 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 15:32:32,271 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 15:32:32,271 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 15:32:32,271 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 15:32:32,271 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 15:32:32,271 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 15:32:32,271 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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-28 15:32:32,451 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 15:32:32,469 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 15:32:32,470 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 15:32:32,471 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 15:32:32,472 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 15:32:32,472 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_srvr.blast.15.i.cil-1.c [2022-04-28 15:32:32,520 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8522ef8e6/f68c5a102547459797673b4be04720a0/FLAG51247de80 [2022-04-28 15:32:32,903 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 15:32:32,903 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.15.i.cil-1.c [2022-04-28 15:32:32,928 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8522ef8e6/f68c5a102547459797673b4be04720a0/FLAG51247de80 [2022-04-28 15:32:33,246 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8522ef8e6/f68c5a102547459797673b4be04720a0 [2022-04-28 15:32:33,248 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 15:32:33,249 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 15:32:33,250 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 15:32:33,250 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 15:32:33,252 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 15:32:33,253 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:32:33" (1/1) ... [2022-04-28 15:32:33,254 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a9df223 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:32:33, skipping insertion in model container [2022-04-28 15:32:33,254 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:32:33" (1/1) ... [2022-04-28 15:32:33,258 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 15:32:33,318 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 15:32:33,663 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.15.i.cil-1.c[75550,75563] [2022-04-28 15:32:33,679 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 15:32:33,693 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 15:32:33,804 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.15.i.cil-1.c[75550,75563] [2022-04-28 15:32:33,805 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 15:32:33,818 INFO L208 MainTranslator]: Completed translation [2022-04-28 15:32:33,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:32:33 WrapperNode [2022-04-28 15:32:33,819 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 15:32:33,820 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 15:32:33,820 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 15:32:33,821 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 15:32:33,828 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:32:33" (1/1) ... [2022-04-28 15:32:33,828 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:32:33" (1/1) ... [2022-04-28 15:32:33,843 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:32:33" (1/1) ... [2022-04-28 15:32:33,843 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:32:33" (1/1) ... [2022-04-28 15:32:33,887 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:32:33" (1/1) ... [2022-04-28 15:32:33,894 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:32:33" (1/1) ... [2022-04-28 15:32:33,896 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:32:33" (1/1) ... [2022-04-28 15:32:33,900 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 15:32:33,900 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 15:32:33,900 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 15:32:33,901 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 15:32:33,901 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:32:33" (1/1) ... [2022-04-28 15:32:33,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 15:32:33,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 15:32:33,923 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-28 15:32:33,943 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-28 15:32:33,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 15:32:33,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 15:32:33,965 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 15:32:33,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2022-04-28 15:32:33,965 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2022-04-28 15:32:33,965 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 15:32:33,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-04-28 15:32:33,965 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-28 15:32:33,965 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-28 15:32:33,966 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-28 15:32:33,966 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 15:32:33,966 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 15:32:33,966 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 15:32:33,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 15:32:33,966 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-28 15:32:33,966 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-28 15:32:33,966 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 15:32:33,966 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-28 15:32:33,966 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-28 15:32:33,966 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-28 15:32:33,966 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2022-04-28 15:32:33,967 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-28 15:32:33,967 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-04-28 15:32:33,967 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2022-04-28 15:32:33,967 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-28 15:32:33,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-28 15:32:33,967 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 15:32:33,967 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-28 15:32:33,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 15:32:33,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-28 15:32:33,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 15:32:33,967 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-28 15:32:33,967 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-28 15:32:33,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 15:32:33,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 15:32:33,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 15:32:33,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-28 15:32:33,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-28 15:32:33,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-28 15:32:33,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-28 15:32:33,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 15:32:34,113 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 15:32:34,114 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 15:32:34,542 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 15:32:34,979 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2022-04-28 15:32:34,979 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2022-04-28 15:32:34,990 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 15:32:34,999 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 15:32:34,999 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 15:32:35,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:32:35 BoogieIcfgContainer [2022-04-28 15:32:35,001 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 15:32:35,003 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 15:32:35,003 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 15:32:35,005 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 15:32:35,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 03:32:33" (1/3) ... [2022-04-28 15:32:35,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fa97847 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:32:35, skipping insertion in model container [2022-04-28 15:32:35,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:32:33" (2/3) ... [2022-04-28 15:32:35,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fa97847 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:32:35, skipping insertion in model container [2022-04-28 15:32:35,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:32:35" (3/3) ... [2022-04-28 15:32:35,007 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.15.i.cil-1.c [2022-04-28 15:32:35,017 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 15:32:35,017 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 15:32:35,045 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 15:32:35,049 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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@3eb88fd5, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4f9b6a74 [2022-04-28 15:32:35,049 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 15:32:35,055 INFO L276 IsEmpty]: Start isEmpty. Operand has 161 states, 153 states have (on average 1.7124183006535947) internal successors, (262), 154 states have internal predecessors, (262), 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-28 15:32:35,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 15:32:35,062 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:32:35,062 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:32:35,062 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:32:35,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:32:35,065 INFO L85 PathProgramCache]: Analyzing trace with hash 80900235, now seen corresponding path program 1 times [2022-04-28 15:32:35,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:32:35,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [205850515] [2022-04-28 15:32:35,076 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:32:35,077 INFO L85 PathProgramCache]: Analyzing trace with hash 80900235, now seen corresponding path program 2 times [2022-04-28 15:32:35,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:32:35,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200661932] [2022-04-28 15:32:35,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:32:35,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:32:35,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:32:35,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:32:35,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:32:35,471 INFO L290 TraceCheckUtils]: 0: Hoare triple {171#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {164#true} is VALID [2022-04-28 15:32:35,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {164#true} assume true; {164#true} is VALID [2022-04-28 15:32:35,472 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {164#true} {164#true} #703#return; {164#true} is VALID [2022-04-28 15:32:35,473 INFO L272 TraceCheckUtils]: 0: Hoare triple {164#true} call ULTIMATE.init(); {171#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-28 15:32:35,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {171#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {164#true} is VALID [2022-04-28 15:32:35,474 INFO L290 TraceCheckUtils]: 2: Hoare triple {164#true} assume true; {164#true} is VALID [2022-04-28 15:32:35,474 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {164#true} {164#true} #703#return; {164#true} is VALID [2022-04-28 15:32:35,474 INFO L272 TraceCheckUtils]: 4: Hoare triple {164#true} call #t~ret161 := main(); {164#true} is VALID [2022-04-28 15:32:35,475 INFO L290 TraceCheckUtils]: 5: Hoare triple {164#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {164#true} is VALID [2022-04-28 15:32:35,475 INFO L290 TraceCheckUtils]: 6: Hoare triple {164#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {164#true} is VALID [2022-04-28 15:32:35,475 INFO L272 TraceCheckUtils]: 7: Hoare triple {164#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {164#true} is VALID [2022-04-28 15:32:35,482 INFO L290 TraceCheckUtils]: 8: Hoare triple {164#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {169#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:32:35,483 INFO L290 TraceCheckUtils]: 9: Hoare triple {169#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {169#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:32:35,484 INFO L290 TraceCheckUtils]: 10: Hoare triple {169#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {169#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:32:35,484 INFO L290 TraceCheckUtils]: 11: Hoare triple {169#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {169#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:32:35,485 INFO L290 TraceCheckUtils]: 12: Hoare triple {169#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {169#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:32:35,485 INFO L290 TraceCheckUtils]: 13: Hoare triple {169#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {169#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:32:35,486 INFO L290 TraceCheckUtils]: 14: Hoare triple {169#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {169#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:32:35,486 INFO L290 TraceCheckUtils]: 15: Hoare triple {169#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {169#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:32:35,487 INFO L290 TraceCheckUtils]: 16: Hoare triple {169#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {169#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:32:35,487 INFO L290 TraceCheckUtils]: 17: Hoare triple {169#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {169#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:32:35,488 INFO L290 TraceCheckUtils]: 18: Hoare triple {169#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {169#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:32:35,490 INFO L290 TraceCheckUtils]: 19: Hoare triple {169#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {169#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:32:35,490 INFO L290 TraceCheckUtils]: 20: Hoare triple {169#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {169#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:32:35,491 INFO L290 TraceCheckUtils]: 21: Hoare triple {169#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {169#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:32:35,491 INFO L290 TraceCheckUtils]: 22: Hoare triple {169#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {169#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:32:35,492 INFO L290 TraceCheckUtils]: 23: Hoare triple {169#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {170#(= 8464 |ssl3_accept_#t~mem55|)} is VALID [2022-04-28 15:32:35,492 INFO L290 TraceCheckUtils]: 24: Hoare triple {170#(= 8464 |ssl3_accept_#t~mem55|)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {165#false} is VALID [2022-04-28 15:32:35,493 INFO L290 TraceCheckUtils]: 25: Hoare triple {165#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {165#false} is VALID [2022-04-28 15:32:35,521 INFO L290 TraceCheckUtils]: 26: Hoare triple {165#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {165#false} is VALID [2022-04-28 15:32:35,521 INFO L290 TraceCheckUtils]: 27: Hoare triple {165#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {165#false} is VALID [2022-04-28 15:32:35,521 INFO L290 TraceCheckUtils]: 28: Hoare triple {165#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {165#false} is VALID [2022-04-28 15:32:35,522 INFO L290 TraceCheckUtils]: 29: Hoare triple {165#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {165#false} is VALID [2022-04-28 15:32:35,522 INFO L290 TraceCheckUtils]: 30: Hoare triple {165#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {165#false} is VALID [2022-04-28 15:32:35,522 INFO L290 TraceCheckUtils]: 31: Hoare triple {165#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {165#false} is VALID [2022-04-28 15:32:35,522 INFO L290 TraceCheckUtils]: 32: Hoare triple {165#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {165#false} is VALID [2022-04-28 15:32:35,522 INFO L290 TraceCheckUtils]: 33: Hoare triple {165#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {165#false} is VALID [2022-04-28 15:32:35,522 INFO L290 TraceCheckUtils]: 34: Hoare triple {165#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {165#false} is VALID [2022-04-28 15:32:35,523 INFO L290 TraceCheckUtils]: 35: Hoare triple {165#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {165#false} is VALID [2022-04-28 15:32:35,523 INFO L290 TraceCheckUtils]: 36: Hoare triple {165#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {165#false} is VALID [2022-04-28 15:32:35,523 INFO L290 TraceCheckUtils]: 37: Hoare triple {165#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {165#false} is VALID [2022-04-28 15:32:35,523 INFO L290 TraceCheckUtils]: 38: Hoare triple {165#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {165#false} is VALID [2022-04-28 15:32:35,523 INFO L290 TraceCheckUtils]: 39: Hoare triple {165#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {165#false} is VALID [2022-04-28 15:32:35,523 INFO L290 TraceCheckUtils]: 40: Hoare triple {165#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {165#false} is VALID [2022-04-28 15:32:35,523 INFO L290 TraceCheckUtils]: 41: Hoare triple {165#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {165#false} is VALID [2022-04-28 15:32:35,524 INFO L290 TraceCheckUtils]: 42: Hoare triple {165#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {165#false} is VALID [2022-04-28 15:32:35,524 INFO L290 TraceCheckUtils]: 43: Hoare triple {165#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {165#false} is VALID [2022-04-28 15:32:35,524 INFO L290 TraceCheckUtils]: 44: Hoare triple {165#false} assume 8640 == #t~mem75;havoc #t~mem75; {165#false} is VALID [2022-04-28 15:32:35,524 INFO L290 TraceCheckUtils]: 45: Hoare triple {165#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {165#false} is VALID [2022-04-28 15:32:35,524 INFO L290 TraceCheckUtils]: 46: Hoare triple {165#false} assume !(4 == ~blastFlag~0); {165#false} is VALID [2022-04-28 15:32:35,524 INFO L290 TraceCheckUtils]: 47: Hoare triple {165#false} assume !(7 == ~blastFlag~0); {165#false} is VALID [2022-04-28 15:32:35,524 INFO L290 TraceCheckUtils]: 48: Hoare triple {165#false} assume !(10 == ~blastFlag~0); {165#false} is VALID [2022-04-28 15:32:35,525 INFO L290 TraceCheckUtils]: 49: Hoare triple {165#false} assume !false; {165#false} is VALID [2022-04-28 15:32:35,525 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-28 15:32:35,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:32:35,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200661932] [2022-04-28 15:32:35,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200661932] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:32:35,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:32:35,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:32:35,532 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:32:35,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [205850515] [2022-04-28 15:32:35,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [205850515] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:32:35,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:32:35,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:32:35,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661808544] [2022-04-28 15:32:35,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:32:35,541 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-28 15:32:35,542 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:32:35,544 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:32:35,587 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:32:35,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:32:35,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:32:35,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:32:35,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:32:35,602 INFO L87 Difference]: Start difference. First operand has 161 states, 153 states have (on average 1.7124183006535947) internal successors, (262), 154 states have internal predecessors, (262), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:32:37,569 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:32:41,114 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:32:45,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:32:45,528 INFO L93 Difference]: Finished difference Result 340 states and 572 transitions. [2022-04-28 15:32:45,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:32:45,528 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-28 15:32:45,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:32:45,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:32:45,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 572 transitions. [2022-04-28 15:32:45,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:32:45,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 572 transitions. [2022-04-28 15:32:45,565 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 572 transitions. [2022-04-28 15:32:45,979 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 572 edges. 572 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:32:45,994 INFO L225 Difference]: With dead ends: 340 [2022-04-28 15:32:45,994 INFO L226 Difference]: Without dead ends: 173 [2022-04-28 15:32:45,997 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-28 15:32:46,003 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 34 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:32:46,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 625 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-04-28 15:32:46,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-04-28 15:32:46,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 156. [2022-04-28 15:32:46,041 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:32:46,046 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand has 156 states, 151 states have (on average 1.5629139072847682) internal successors, (236), 151 states have internal predecessors, (236), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:32:46,047 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand has 156 states, 151 states have (on average 1.5629139072847682) internal successors, (236), 151 states have internal predecessors, (236), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:32:46,048 INFO L87 Difference]: Start difference. First operand 173 states. Second operand has 156 states, 151 states have (on average 1.5629139072847682) internal successors, (236), 151 states have internal predecessors, (236), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:32:46,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:32:46,057 INFO L93 Difference]: Finished difference Result 173 states and 261 transitions. [2022-04-28 15:32:46,057 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 261 transitions. [2022-04-28 15:32:46,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:32:46,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:32:46,063 INFO L74 IsIncluded]: Start isIncluded. First operand has 156 states, 151 states have (on average 1.5629139072847682) internal successors, (236), 151 states have internal predecessors, (236), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 173 states. [2022-04-28 15:32:46,064 INFO L87 Difference]: Start difference. First operand has 156 states, 151 states have (on average 1.5629139072847682) internal successors, (236), 151 states have internal predecessors, (236), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 173 states. [2022-04-28 15:32:46,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:32:46,070 INFO L93 Difference]: Finished difference Result 173 states and 261 transitions. [2022-04-28 15:32:46,070 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 261 transitions. [2022-04-28 15:32:46,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:32:46,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:32:46,071 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:32:46,071 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:32:46,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 151 states have (on average 1.5629139072847682) internal successors, (236), 151 states have internal predecessors, (236), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:32:46,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 240 transitions. [2022-04-28 15:32:46,077 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 240 transitions. Word has length 50 [2022-04-28 15:32:46,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:32:46,077 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 240 transitions. [2022-04-28 15:32:46,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:32:46,077 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 156 states and 240 transitions. [2022-04-28 15:32:46,234 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 240 edges. 240 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:32:46,235 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 240 transitions. [2022-04-28 15:32:46,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-28 15:32:46,237 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:32:46,238 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:32:46,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 15:32:46,239 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:32:46,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:32:46,239 INFO L85 PathProgramCache]: Analyzing trace with hash -450854301, now seen corresponding path program 1 times [2022-04-28 15:32:46,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:32:46,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [642055493] [2022-04-28 15:32:46,257 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:32:46,258 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:32:46,258 INFO L85 PathProgramCache]: Analyzing trace with hash -450854301, now seen corresponding path program 2 times [2022-04-28 15:32:46,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:32:46,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732093098] [2022-04-28 15:32:46,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:32:46,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:32:46,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:32:46,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:32:46,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:32:46,464 INFO L290 TraceCheckUtils]: 0: Hoare triple {1521#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {1514#true} is VALID [2022-04-28 15:32:46,464 INFO L290 TraceCheckUtils]: 1: Hoare triple {1514#true} assume true; {1514#true} is VALID [2022-04-28 15:32:46,464 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1514#true} {1514#true} #703#return; {1514#true} is VALID [2022-04-28 15:32:46,465 INFO L272 TraceCheckUtils]: 0: Hoare triple {1514#true} call ULTIMATE.init(); {1521#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-28 15:32:46,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {1521#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {1514#true} is VALID [2022-04-28 15:32:46,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {1514#true} assume true; {1514#true} is VALID [2022-04-28 15:32:46,467 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1514#true} {1514#true} #703#return; {1514#true} is VALID [2022-04-28 15:32:46,467 INFO L272 TraceCheckUtils]: 4: Hoare triple {1514#true} call #t~ret161 := main(); {1514#true} is VALID [2022-04-28 15:32:46,467 INFO L290 TraceCheckUtils]: 5: Hoare triple {1514#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {1514#true} is VALID [2022-04-28 15:32:46,468 INFO L290 TraceCheckUtils]: 6: Hoare triple {1514#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {1514#true} is VALID [2022-04-28 15:32:46,468 INFO L272 TraceCheckUtils]: 7: Hoare triple {1514#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {1514#true} is VALID [2022-04-28 15:32:46,470 INFO L290 TraceCheckUtils]: 8: Hoare triple {1514#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {1519#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:32:46,470 INFO L290 TraceCheckUtils]: 9: Hoare triple {1519#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {1519#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:32:46,471 INFO L290 TraceCheckUtils]: 10: Hoare triple {1519#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {1519#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:32:46,472 INFO L290 TraceCheckUtils]: 11: Hoare triple {1519#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {1519#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:32:46,472 INFO L290 TraceCheckUtils]: 12: Hoare triple {1519#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {1519#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:32:46,473 INFO L290 TraceCheckUtils]: 13: Hoare triple {1519#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {1519#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:32:46,473 INFO L290 TraceCheckUtils]: 14: Hoare triple {1519#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {1519#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:32:46,473 INFO L290 TraceCheckUtils]: 15: Hoare triple {1519#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {1519#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:32:46,474 INFO L290 TraceCheckUtils]: 16: Hoare triple {1519#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {1519#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:32:46,474 INFO L290 TraceCheckUtils]: 17: Hoare triple {1519#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {1519#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:32:46,475 INFO L290 TraceCheckUtils]: 18: Hoare triple {1519#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {1519#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:32:46,477 INFO L290 TraceCheckUtils]: 19: Hoare triple {1519#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {1519#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:32:46,478 INFO L290 TraceCheckUtils]: 20: Hoare triple {1519#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {1520#(= 8464 |ssl3_accept_#t~mem52|)} is VALID [2022-04-28 15:32:46,478 INFO L290 TraceCheckUtils]: 21: Hoare triple {1520#(= 8464 |ssl3_accept_#t~mem52|)} assume 8480 == #t~mem52;havoc #t~mem52; {1515#false} is VALID [2022-04-28 15:32:46,479 INFO L290 TraceCheckUtils]: 22: Hoare triple {1515#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {1515#false} is VALID [2022-04-28 15:32:46,479 INFO L290 TraceCheckUtils]: 23: Hoare triple {1515#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8482, #t~mem91.base, 904 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {1515#false} is VALID [2022-04-28 15:32:46,479 INFO L290 TraceCheckUtils]: 24: Hoare triple {1515#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {1515#false} is VALID [2022-04-28 15:32:46,479 INFO L290 TraceCheckUtils]: 25: Hoare triple {1515#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {1515#false} is VALID [2022-04-28 15:32:46,479 INFO L290 TraceCheckUtils]: 26: Hoare triple {1515#false} ~skip~0 := 0; {1515#false} is VALID [2022-04-28 15:32:46,479 INFO L290 TraceCheckUtils]: 27: Hoare triple {1515#false} assume !false; {1515#false} is VALID [2022-04-28 15:32:46,479 INFO L290 TraceCheckUtils]: 28: Hoare triple {1515#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {1515#false} is VALID [2022-04-28 15:32:46,480 INFO L290 TraceCheckUtils]: 29: Hoare triple {1515#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {1515#false} is VALID [2022-04-28 15:32:46,480 INFO L290 TraceCheckUtils]: 30: Hoare triple {1515#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {1515#false} is VALID [2022-04-28 15:32:46,480 INFO L290 TraceCheckUtils]: 31: Hoare triple {1515#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {1515#false} is VALID [2022-04-28 15:32:46,480 INFO L290 TraceCheckUtils]: 32: Hoare triple {1515#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {1515#false} is VALID [2022-04-28 15:32:46,480 INFO L290 TraceCheckUtils]: 33: Hoare triple {1515#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {1515#false} is VALID [2022-04-28 15:32:46,480 INFO L290 TraceCheckUtils]: 34: Hoare triple {1515#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {1515#false} is VALID [2022-04-28 15:32:46,480 INFO L290 TraceCheckUtils]: 35: Hoare triple {1515#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {1515#false} is VALID [2022-04-28 15:32:46,480 INFO L290 TraceCheckUtils]: 36: Hoare triple {1515#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {1515#false} is VALID [2022-04-28 15:32:46,481 INFO L290 TraceCheckUtils]: 37: Hoare triple {1515#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {1515#false} is VALID [2022-04-28 15:32:46,481 INFO L290 TraceCheckUtils]: 38: Hoare triple {1515#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {1515#false} is VALID [2022-04-28 15:32:46,481 INFO L290 TraceCheckUtils]: 39: Hoare triple {1515#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {1515#false} is VALID [2022-04-28 15:32:46,481 INFO L290 TraceCheckUtils]: 40: Hoare triple {1515#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {1515#false} is VALID [2022-04-28 15:32:46,482 INFO L290 TraceCheckUtils]: 41: Hoare triple {1515#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {1515#false} is VALID [2022-04-28 15:32:46,483 INFO L290 TraceCheckUtils]: 42: Hoare triple {1515#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {1515#false} is VALID [2022-04-28 15:32:46,484 INFO L290 TraceCheckUtils]: 43: Hoare triple {1515#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {1515#false} is VALID [2022-04-28 15:32:46,485 INFO L290 TraceCheckUtils]: 44: Hoare triple {1515#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {1515#false} is VALID [2022-04-28 15:32:46,485 INFO L290 TraceCheckUtils]: 45: Hoare triple {1515#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {1515#false} is VALID [2022-04-28 15:32:46,485 INFO L290 TraceCheckUtils]: 46: Hoare triple {1515#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {1515#false} is VALID [2022-04-28 15:32:46,485 INFO L290 TraceCheckUtils]: 47: Hoare triple {1515#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {1515#false} is VALID [2022-04-28 15:32:46,487 INFO L290 TraceCheckUtils]: 48: Hoare triple {1515#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {1515#false} is VALID [2022-04-28 15:32:46,487 INFO L290 TraceCheckUtils]: 49: Hoare triple {1515#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {1515#false} is VALID [2022-04-28 15:32:46,487 INFO L290 TraceCheckUtils]: 50: Hoare triple {1515#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {1515#false} is VALID [2022-04-28 15:32:46,488 INFO L290 TraceCheckUtils]: 51: Hoare triple {1515#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {1515#false} is VALID [2022-04-28 15:32:46,488 INFO L290 TraceCheckUtils]: 52: Hoare triple {1515#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {1515#false} is VALID [2022-04-28 15:32:46,488 INFO L290 TraceCheckUtils]: 53: Hoare triple {1515#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {1515#false} is VALID [2022-04-28 15:32:46,488 INFO L290 TraceCheckUtils]: 54: Hoare triple {1515#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {1515#false} is VALID [2022-04-28 15:32:46,488 INFO L290 TraceCheckUtils]: 55: Hoare triple {1515#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {1515#false} is VALID [2022-04-28 15:32:46,488 INFO L290 TraceCheckUtils]: 56: Hoare triple {1515#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {1515#false} is VALID [2022-04-28 15:32:46,488 INFO L290 TraceCheckUtils]: 57: Hoare triple {1515#false} assume 8640 == #t~mem75;havoc #t~mem75; {1515#false} is VALID [2022-04-28 15:32:46,488 INFO L290 TraceCheckUtils]: 58: Hoare triple {1515#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {1515#false} is VALID [2022-04-28 15:32:46,489 INFO L290 TraceCheckUtils]: 59: Hoare triple {1515#false} assume !(4 == ~blastFlag~0); {1515#false} is VALID [2022-04-28 15:32:46,489 INFO L290 TraceCheckUtils]: 60: Hoare triple {1515#false} assume !(7 == ~blastFlag~0); {1515#false} is VALID [2022-04-28 15:32:46,490 INFO L290 TraceCheckUtils]: 61: Hoare triple {1515#false} assume !(10 == ~blastFlag~0); {1515#false} is VALID [2022-04-28 15:32:46,490 INFO L290 TraceCheckUtils]: 62: Hoare triple {1515#false} assume !false; {1515#false} is VALID [2022-04-28 15:32:46,491 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:32:46,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:32:46,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732093098] [2022-04-28 15:32:46,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732093098] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:32:46,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:32:46,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:32:46,492 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:32:46,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [642055493] [2022-04-28 15:32:46,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [642055493] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:32:46,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:32:46,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:32:46,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795680693] [2022-04-28 15:32:46,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:32:46,493 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2022-04-28 15:32:46,493 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:32:46,494 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-28 15:32:46,546 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-28 15:32:46,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:32:46,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:32:46,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:32:46,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:32:46,548 INFO L87 Difference]: Start difference. First operand 156 states and 240 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-28 15:32:54,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:32:54,576 INFO L93 Difference]: Finished difference Result 303 states and 463 transitions. [2022-04-28 15:32:54,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:32:54,577 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2022-04-28 15:32:54,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:32:54,577 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-28 15:32:54,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 463 transitions. [2022-04-28 15:32:54,582 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-28 15:32:54,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 463 transitions. [2022-04-28 15:32:54,586 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 463 transitions. [2022-04-28 15:32:54,949 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 463 edges. 463 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:32:54,955 INFO L225 Difference]: With dead ends: 303 [2022-04-28 15:32:54,955 INFO L226 Difference]: Without dead ends: 173 [2022-04-28 15:32:54,955 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-28 15:32:54,956 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 24 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:32:54,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 501 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 15:32:54,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-04-28 15:32:54,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 156. [2022-04-28 15:32:54,968 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:32:54,969 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand has 156 states, 151 states have (on average 1.5562913907284768) internal successors, (235), 151 states have internal predecessors, (235), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:32:54,969 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand has 156 states, 151 states have (on average 1.5562913907284768) internal successors, (235), 151 states have internal predecessors, (235), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:32:54,970 INFO L87 Difference]: Start difference. First operand 173 states. Second operand has 156 states, 151 states have (on average 1.5562913907284768) internal successors, (235), 151 states have internal predecessors, (235), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:32:54,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:32:54,979 INFO L93 Difference]: Finished difference Result 173 states and 260 transitions. [2022-04-28 15:32:54,979 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 260 transitions. [2022-04-28 15:32:54,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:32:54,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:32:54,980 INFO L74 IsIncluded]: Start isIncluded. First operand has 156 states, 151 states have (on average 1.5562913907284768) internal successors, (235), 151 states have internal predecessors, (235), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 173 states. [2022-04-28 15:32:54,980 INFO L87 Difference]: Start difference. First operand has 156 states, 151 states have (on average 1.5562913907284768) internal successors, (235), 151 states have internal predecessors, (235), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 173 states. [2022-04-28 15:32:54,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:32:54,986 INFO L93 Difference]: Finished difference Result 173 states and 260 transitions. [2022-04-28 15:32:54,986 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 260 transitions. [2022-04-28 15:32:54,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:32:54,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:32:54,986 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:32:54,986 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:32:54,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 151 states have (on average 1.5562913907284768) internal successors, (235), 151 states have internal predecessors, (235), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:32:54,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 239 transitions. [2022-04-28 15:32:54,993 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 239 transitions. Word has length 63 [2022-04-28 15:32:54,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:32:54,994 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 239 transitions. [2022-04-28 15:32:54,994 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-28 15:32:54,994 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 156 states and 239 transitions. [2022-04-28 15:32:55,151 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 239 edges. 239 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:32:55,151 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 239 transitions. [2022-04-28 15:32:55,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-28 15:32:55,152 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:32:55,152 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:32:55,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 15:32:55,152 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:32:55,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:32:55,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1137075757, now seen corresponding path program 1 times [2022-04-28 15:32:55,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:32:55,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1690627413] [2022-04-28 15:32:55,180 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:32:55,180 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:32:55,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1137075757, now seen corresponding path program 2 times [2022-04-28 15:32:55,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:32:55,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769180770] [2022-04-28 15:32:55,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:32:55,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:32:55,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:32:55,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:32:55,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:32:55,298 INFO L290 TraceCheckUtils]: 0: Hoare triple {2797#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {2790#true} is VALID [2022-04-28 15:32:55,298 INFO L290 TraceCheckUtils]: 1: Hoare triple {2790#true} assume true; {2790#true} is VALID [2022-04-28 15:32:55,298 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2790#true} {2790#true} #703#return; {2790#true} is VALID [2022-04-28 15:32:55,299 INFO L272 TraceCheckUtils]: 0: Hoare triple {2790#true} call ULTIMATE.init(); {2797#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-28 15:32:55,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {2797#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {2790#true} is VALID [2022-04-28 15:32:55,299 INFO L290 TraceCheckUtils]: 2: Hoare triple {2790#true} assume true; {2790#true} is VALID [2022-04-28 15:32:55,299 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2790#true} {2790#true} #703#return; {2790#true} is VALID [2022-04-28 15:32:55,299 INFO L272 TraceCheckUtils]: 4: Hoare triple {2790#true} call #t~ret161 := main(); {2790#true} is VALID [2022-04-28 15:32:55,299 INFO L290 TraceCheckUtils]: 5: Hoare triple {2790#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {2790#true} is VALID [2022-04-28 15:32:55,300 INFO L290 TraceCheckUtils]: 6: Hoare triple {2790#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {2790#true} is VALID [2022-04-28 15:32:55,300 INFO L272 TraceCheckUtils]: 7: Hoare triple {2790#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {2790#true} is VALID [2022-04-28 15:32:55,302 INFO L290 TraceCheckUtils]: 8: Hoare triple {2790#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {2795#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:32:55,302 INFO L290 TraceCheckUtils]: 9: Hoare triple {2795#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {2795#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:32:55,303 INFO L290 TraceCheckUtils]: 10: Hoare triple {2795#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {2795#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:32:55,303 INFO L290 TraceCheckUtils]: 11: Hoare triple {2795#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {2795#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:32:55,304 INFO L290 TraceCheckUtils]: 12: Hoare triple {2795#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {2795#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:32:55,304 INFO L290 TraceCheckUtils]: 13: Hoare triple {2795#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {2795#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:32:55,304 INFO L290 TraceCheckUtils]: 14: Hoare triple {2795#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {2795#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:32:55,305 INFO L290 TraceCheckUtils]: 15: Hoare triple {2795#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {2796#(not (= 12292 |ssl3_accept_#t~mem47|))} is VALID [2022-04-28 15:32:55,305 INFO L290 TraceCheckUtils]: 16: Hoare triple {2796#(not (= 12292 |ssl3_accept_#t~mem47|))} assume 12292 == #t~mem47;havoc #t~mem47; {2791#false} is VALID [2022-04-28 15:32:55,305 INFO L290 TraceCheckUtils]: 17: Hoare triple {2791#false} call write~int(1, ~s.base, 60 + ~s.offset, 4); {2791#false} is VALID [2022-04-28 15:32:55,305 INFO L290 TraceCheckUtils]: 18: Hoare triple {2791#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {2791#false} is VALID [2022-04-28 15:32:55,305 INFO L290 TraceCheckUtils]: 19: Hoare triple {2791#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {2791#false} is VALID [2022-04-28 15:32:55,306 INFO L290 TraceCheckUtils]: 20: Hoare triple {2791#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {2791#false} is VALID [2022-04-28 15:32:55,306 INFO L290 TraceCheckUtils]: 21: Hoare triple {2791#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, 80 + ~s.offset, 8); {2791#false} is VALID [2022-04-28 15:32:55,306 INFO L290 TraceCheckUtils]: 22: Hoare triple {2791#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {2791#false} is VALID [2022-04-28 15:32:55,306 INFO L290 TraceCheckUtils]: 23: Hoare triple {2791#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {2791#false} is VALID [2022-04-28 15:32:55,306 INFO L290 TraceCheckUtils]: 24: Hoare triple {2791#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem89 := read~int(#t~mem88.base, 132 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 132 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 72 + ~s.offset, 4); {2791#false} is VALID [2022-04-28 15:32:55,306 INFO L290 TraceCheckUtils]: 25: Hoare triple {2791#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {2791#false} is VALID [2022-04-28 15:32:55,306 INFO L290 TraceCheckUtils]: 26: Hoare triple {2791#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {2791#false} is VALID [2022-04-28 15:32:55,306 INFO L290 TraceCheckUtils]: 27: Hoare triple {2791#false} ~skip~0 := 0; {2791#false} is VALID [2022-04-28 15:32:55,307 INFO L290 TraceCheckUtils]: 28: Hoare triple {2791#false} assume !false; {2791#false} is VALID [2022-04-28 15:32:55,307 INFO L290 TraceCheckUtils]: 29: Hoare triple {2791#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {2791#false} is VALID [2022-04-28 15:32:55,307 INFO L290 TraceCheckUtils]: 30: Hoare triple {2791#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {2791#false} is VALID [2022-04-28 15:32:55,307 INFO L290 TraceCheckUtils]: 31: Hoare triple {2791#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {2791#false} is VALID [2022-04-28 15:32:55,307 INFO L290 TraceCheckUtils]: 32: Hoare triple {2791#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {2791#false} is VALID [2022-04-28 15:32:55,307 INFO L290 TraceCheckUtils]: 33: Hoare triple {2791#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {2791#false} is VALID [2022-04-28 15:32:55,307 INFO L290 TraceCheckUtils]: 34: Hoare triple {2791#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {2791#false} is VALID [2022-04-28 15:32:55,307 INFO L290 TraceCheckUtils]: 35: Hoare triple {2791#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {2791#false} is VALID [2022-04-28 15:32:55,307 INFO L290 TraceCheckUtils]: 36: Hoare triple {2791#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {2791#false} is VALID [2022-04-28 15:32:55,307 INFO L290 TraceCheckUtils]: 37: Hoare triple {2791#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {2791#false} is VALID [2022-04-28 15:32:55,308 INFO L290 TraceCheckUtils]: 38: Hoare triple {2791#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {2791#false} is VALID [2022-04-28 15:32:55,308 INFO L290 TraceCheckUtils]: 39: Hoare triple {2791#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {2791#false} is VALID [2022-04-28 15:32:55,308 INFO L290 TraceCheckUtils]: 40: Hoare triple {2791#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {2791#false} is VALID [2022-04-28 15:32:55,308 INFO L290 TraceCheckUtils]: 41: Hoare triple {2791#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {2791#false} is VALID [2022-04-28 15:32:55,308 INFO L290 TraceCheckUtils]: 42: Hoare triple {2791#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {2791#false} is VALID [2022-04-28 15:32:55,308 INFO L290 TraceCheckUtils]: 43: Hoare triple {2791#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {2791#false} is VALID [2022-04-28 15:32:55,308 INFO L290 TraceCheckUtils]: 44: Hoare triple {2791#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {2791#false} is VALID [2022-04-28 15:32:55,308 INFO L290 TraceCheckUtils]: 45: Hoare triple {2791#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {2791#false} is VALID [2022-04-28 15:32:55,308 INFO L290 TraceCheckUtils]: 46: Hoare triple {2791#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {2791#false} is VALID [2022-04-28 15:32:55,308 INFO L290 TraceCheckUtils]: 47: Hoare triple {2791#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {2791#false} is VALID [2022-04-28 15:32:55,309 INFO L290 TraceCheckUtils]: 48: Hoare triple {2791#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {2791#false} is VALID [2022-04-28 15:32:55,309 INFO L290 TraceCheckUtils]: 49: Hoare triple {2791#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {2791#false} is VALID [2022-04-28 15:32:55,309 INFO L290 TraceCheckUtils]: 50: Hoare triple {2791#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {2791#false} is VALID [2022-04-28 15:32:55,309 INFO L290 TraceCheckUtils]: 51: Hoare triple {2791#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {2791#false} is VALID [2022-04-28 15:32:55,309 INFO L290 TraceCheckUtils]: 52: Hoare triple {2791#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {2791#false} is VALID [2022-04-28 15:32:55,309 INFO L290 TraceCheckUtils]: 53: Hoare triple {2791#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {2791#false} is VALID [2022-04-28 15:32:55,309 INFO L290 TraceCheckUtils]: 54: Hoare triple {2791#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {2791#false} is VALID [2022-04-28 15:32:55,309 INFO L290 TraceCheckUtils]: 55: Hoare triple {2791#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {2791#false} is VALID [2022-04-28 15:32:55,309 INFO L290 TraceCheckUtils]: 56: Hoare triple {2791#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {2791#false} is VALID [2022-04-28 15:32:55,309 INFO L290 TraceCheckUtils]: 57: Hoare triple {2791#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {2791#false} is VALID [2022-04-28 15:32:55,310 INFO L290 TraceCheckUtils]: 58: Hoare triple {2791#false} assume 8640 == #t~mem75;havoc #t~mem75; {2791#false} is VALID [2022-04-28 15:32:55,310 INFO L290 TraceCheckUtils]: 59: Hoare triple {2791#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {2791#false} is VALID [2022-04-28 15:32:55,310 INFO L290 TraceCheckUtils]: 60: Hoare triple {2791#false} assume !(4 == ~blastFlag~0); {2791#false} is VALID [2022-04-28 15:32:55,310 INFO L290 TraceCheckUtils]: 61: Hoare triple {2791#false} assume !(7 == ~blastFlag~0); {2791#false} is VALID [2022-04-28 15:32:55,310 INFO L290 TraceCheckUtils]: 62: Hoare triple {2791#false} assume !(10 == ~blastFlag~0); {2791#false} is VALID [2022-04-28 15:32:55,310 INFO L290 TraceCheckUtils]: 63: Hoare triple {2791#false} assume !false; {2791#false} is VALID [2022-04-28 15:32:55,310 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:32:55,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:32:55,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769180770] [2022-04-28 15:32:55,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769180770] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:32:55,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:32:55,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:32:55,311 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:32:55,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1690627413] [2022-04-28 15:32:55,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1690627413] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:32:55,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:32:55,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:32:55,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635230130] [2022-04-28 15:32:55,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:32:55,312 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-28 15:32:55,312 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:32:55,312 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-28 15:32:55,363 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-28 15:32:55,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:32:55,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:32:55,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:32:55,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:32:55,364 INFO L87 Difference]: Start difference. First operand 156 states and 239 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-28 15:32:59,795 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:33:02,170 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:33:04,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:33:04,404 INFO L93 Difference]: Finished difference Result 404 states and 626 transitions. [2022-04-28 15:33:04,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:33:04,405 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-28 15:33:04,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:33:04,405 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-28 15:33:04,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 608 transitions. [2022-04-28 15:33:04,409 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-28 15:33:04,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 608 transitions. [2022-04-28 15:33:04,413 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 608 transitions. [2022-04-28 15:33:04,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 608 edges. 608 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:33:04,827 INFO L225 Difference]: With dead ends: 404 [2022-04-28 15:33:04,827 INFO L226 Difference]: Without dead ends: 274 [2022-04-28 15:33:04,828 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-28 15:33:04,828 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 152 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:33:04,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 362 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 480 Invalid, 1 Unknown, 0 Unchecked, 5.0s Time] [2022-04-28 15:33:04,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2022-04-28 15:33:04,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 167. [2022-04-28 15:33:04,840 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:33:04,841 INFO L82 GeneralOperation]: Start isEquivalent. First operand 274 states. Second operand has 167 states, 162 states have (on average 1.5432098765432098) internal successors, (250), 162 states have internal predecessors, (250), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:33:04,841 INFO L74 IsIncluded]: Start isIncluded. First operand 274 states. Second operand has 167 states, 162 states have (on average 1.5432098765432098) internal successors, (250), 162 states have internal predecessors, (250), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:33:04,841 INFO L87 Difference]: Start difference. First operand 274 states. Second operand has 167 states, 162 states have (on average 1.5432098765432098) internal successors, (250), 162 states have internal predecessors, (250), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:33:04,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:33:04,848 INFO L93 Difference]: Finished difference Result 274 states and 422 transitions. [2022-04-28 15:33:04,848 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 422 transitions. [2022-04-28 15:33:04,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:33:04,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:33:04,849 INFO L74 IsIncluded]: Start isIncluded. First operand has 167 states, 162 states have (on average 1.5432098765432098) internal successors, (250), 162 states have internal predecessors, (250), 3 states have call successors, (3), 3 states 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-28 15:33:04,850 INFO L87 Difference]: Start difference. First operand has 167 states, 162 states have (on average 1.5432098765432098) internal successors, (250), 162 states have internal predecessors, (250), 3 states have call successors, (3), 3 states 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-28 15:33:04,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:33:04,865 INFO L93 Difference]: Finished difference Result 274 states and 422 transitions. [2022-04-28 15:33:04,865 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 422 transitions. [2022-04-28 15:33:04,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:33:04,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:33:04,865 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:33:04,865 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:33:04,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 162 states have (on average 1.5432098765432098) internal successors, (250), 162 states have internal predecessors, (250), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:33:04,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 254 transitions. [2022-04-28 15:33:04,869 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 254 transitions. Word has length 64 [2022-04-28 15:33:04,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:33:04,869 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 254 transitions. [2022-04-28 15:33:04,869 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-28 15:33:04,869 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 167 states and 254 transitions. [2022-04-28 15:33:05,072 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 254 edges. 254 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:33:05,073 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 254 transitions. [2022-04-28 15:33:05,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-28 15:33:05,073 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:33:05,073 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:33:05,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 15:33:05,074 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:33:05,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:33:05,074 INFO L85 PathProgramCache]: Analyzing trace with hash 749827687, now seen corresponding path program 1 times [2022-04-28 15:33:05,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:33:05,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1881868609] [2022-04-28 15:33:05,093 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 15:33:05,093 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:33:05,093 INFO L85 PathProgramCache]: Analyzing trace with hash 749827687, now seen corresponding path program 2 times [2022-04-28 15:33:05,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:33:05,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544749180] [2022-04-28 15:33:05,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:33:05,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:33:05,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:33:05,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:33:05,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:33:05,268 INFO L290 TraceCheckUtils]: 0: Hoare triple {4499#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {4492#true} is VALID [2022-04-28 15:33:05,268 INFO L290 TraceCheckUtils]: 1: Hoare triple {4492#true} assume true; {4492#true} is VALID [2022-04-28 15:33:05,268 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4492#true} {4492#true} #703#return; {4492#true} is VALID [2022-04-28 15:33:05,272 INFO L272 TraceCheckUtils]: 0: Hoare triple {4492#true} call ULTIMATE.init(); {4499#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-28 15:33:05,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {4499#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {4492#true} is VALID [2022-04-28 15:33:05,272 INFO L290 TraceCheckUtils]: 2: Hoare triple {4492#true} assume true; {4492#true} is VALID [2022-04-28 15:33:05,272 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4492#true} {4492#true} #703#return; {4492#true} is VALID [2022-04-28 15:33:05,273 INFO L272 TraceCheckUtils]: 4: Hoare triple {4492#true} call #t~ret161 := main(); {4492#true} is VALID [2022-04-28 15:33:05,273 INFO L290 TraceCheckUtils]: 5: Hoare triple {4492#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {4492#true} is VALID [2022-04-28 15:33:05,273 INFO L290 TraceCheckUtils]: 6: Hoare triple {4492#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {4492#true} is VALID [2022-04-28 15:33:05,273 INFO L272 TraceCheckUtils]: 7: Hoare triple {4492#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {4492#true} is VALID [2022-04-28 15:33:05,276 INFO L290 TraceCheckUtils]: 8: Hoare triple {4492#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {4497#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-28 15:33:05,276 INFO L290 TraceCheckUtils]: 9: Hoare triple {4497#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {4497#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-28 15:33:05,277 INFO L290 TraceCheckUtils]: 10: Hoare triple {4497#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {4497#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-28 15:33:05,277 INFO L290 TraceCheckUtils]: 11: Hoare triple {4497#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {4497#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-28 15:33:05,278 INFO L290 TraceCheckUtils]: 12: Hoare triple {4497#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {4497#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-28 15:33:05,278 INFO L290 TraceCheckUtils]: 13: Hoare triple {4497#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {4497#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-28 15:33:05,285 INFO L290 TraceCheckUtils]: 14: Hoare triple {4497#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} assume !false; {4497#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-28 15:33:05,286 INFO L290 TraceCheckUtils]: 15: Hoare triple {4497#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {4497#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-28 15:33:05,286 INFO L290 TraceCheckUtils]: 16: Hoare triple {4497#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {4498#(not (= |ssl3_accept_#t~mem48| 16384))} is VALID [2022-04-28 15:33:05,286 INFO L290 TraceCheckUtils]: 17: Hoare triple {4498#(not (= |ssl3_accept_#t~mem48| 16384))} assume 16384 == #t~mem48;havoc #t~mem48; {4493#false} is VALID [2022-04-28 15:33:05,286 INFO L290 TraceCheckUtils]: 18: Hoare triple {4493#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {4493#false} is VALID [2022-04-28 15:33:05,287 INFO L290 TraceCheckUtils]: 19: Hoare triple {4493#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {4493#false} is VALID [2022-04-28 15:33:05,287 INFO L290 TraceCheckUtils]: 20: Hoare triple {4493#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {4493#false} is VALID [2022-04-28 15:33:05,287 INFO L290 TraceCheckUtils]: 21: Hoare triple {4493#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, 80 + ~s.offset, 8); {4493#false} is VALID [2022-04-28 15:33:05,287 INFO L290 TraceCheckUtils]: 22: Hoare triple {4493#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {4493#false} is VALID [2022-04-28 15:33:05,287 INFO L290 TraceCheckUtils]: 23: Hoare triple {4493#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {4493#false} is VALID [2022-04-28 15:33:05,287 INFO L290 TraceCheckUtils]: 24: Hoare triple {4493#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem89 := read~int(#t~mem88.base, 132 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 132 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 72 + ~s.offset, 4); {4493#false} is VALID [2022-04-28 15:33:05,287 INFO L290 TraceCheckUtils]: 25: Hoare triple {4493#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {4493#false} is VALID [2022-04-28 15:33:05,287 INFO L290 TraceCheckUtils]: 26: Hoare triple {4493#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {4493#false} is VALID [2022-04-28 15:33:05,287 INFO L290 TraceCheckUtils]: 27: Hoare triple {4493#false} ~skip~0 := 0; {4493#false} is VALID [2022-04-28 15:33:05,287 INFO L290 TraceCheckUtils]: 28: Hoare triple {4493#false} assume !false; {4493#false} is VALID [2022-04-28 15:33:05,287 INFO L290 TraceCheckUtils]: 29: Hoare triple {4493#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {4493#false} is VALID [2022-04-28 15:33:05,288 INFO L290 TraceCheckUtils]: 30: Hoare triple {4493#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {4493#false} is VALID [2022-04-28 15:33:05,288 INFO L290 TraceCheckUtils]: 31: Hoare triple {4493#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {4493#false} is VALID [2022-04-28 15:33:05,288 INFO L290 TraceCheckUtils]: 32: Hoare triple {4493#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {4493#false} is VALID [2022-04-28 15:33:05,288 INFO L290 TraceCheckUtils]: 33: Hoare triple {4493#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {4493#false} is VALID [2022-04-28 15:33:05,288 INFO L290 TraceCheckUtils]: 34: Hoare triple {4493#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {4493#false} is VALID [2022-04-28 15:33:05,288 INFO L290 TraceCheckUtils]: 35: Hoare triple {4493#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {4493#false} is VALID [2022-04-28 15:33:05,288 INFO L290 TraceCheckUtils]: 36: Hoare triple {4493#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {4493#false} is VALID [2022-04-28 15:33:05,288 INFO L290 TraceCheckUtils]: 37: Hoare triple {4493#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {4493#false} is VALID [2022-04-28 15:33:05,288 INFO L290 TraceCheckUtils]: 38: Hoare triple {4493#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {4493#false} is VALID [2022-04-28 15:33:05,288 INFO L290 TraceCheckUtils]: 39: Hoare triple {4493#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {4493#false} is VALID [2022-04-28 15:33:05,288 INFO L290 TraceCheckUtils]: 40: Hoare triple {4493#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {4493#false} is VALID [2022-04-28 15:33:05,289 INFO L290 TraceCheckUtils]: 41: Hoare triple {4493#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {4493#false} is VALID [2022-04-28 15:33:05,289 INFO L290 TraceCheckUtils]: 42: Hoare triple {4493#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {4493#false} is VALID [2022-04-28 15:33:05,316 INFO L290 TraceCheckUtils]: 43: Hoare triple {4493#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {4493#false} is VALID [2022-04-28 15:33:05,316 INFO L290 TraceCheckUtils]: 44: Hoare triple {4493#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {4493#false} is VALID [2022-04-28 15:33:05,316 INFO L290 TraceCheckUtils]: 45: Hoare triple {4493#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {4493#false} is VALID [2022-04-28 15:33:05,317 INFO L290 TraceCheckUtils]: 46: Hoare triple {4493#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {4493#false} is VALID [2022-04-28 15:33:05,317 INFO L290 TraceCheckUtils]: 47: Hoare triple {4493#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {4493#false} is VALID [2022-04-28 15:33:05,318 INFO L290 TraceCheckUtils]: 48: Hoare triple {4493#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {4493#false} is VALID [2022-04-28 15:33:05,318 INFO L290 TraceCheckUtils]: 49: Hoare triple {4493#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {4493#false} is VALID [2022-04-28 15:33:05,318 INFO L290 TraceCheckUtils]: 50: Hoare triple {4493#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {4493#false} is VALID [2022-04-28 15:33:05,318 INFO L290 TraceCheckUtils]: 51: Hoare triple {4493#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {4493#false} is VALID [2022-04-28 15:33:05,318 INFO L290 TraceCheckUtils]: 52: Hoare triple {4493#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {4493#false} is VALID [2022-04-28 15:33:05,318 INFO L290 TraceCheckUtils]: 53: Hoare triple {4493#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {4493#false} is VALID [2022-04-28 15:33:05,318 INFO L290 TraceCheckUtils]: 54: Hoare triple {4493#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {4493#false} is VALID [2022-04-28 15:33:05,318 INFO L290 TraceCheckUtils]: 55: Hoare triple {4493#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {4493#false} is VALID [2022-04-28 15:33:05,318 INFO L290 TraceCheckUtils]: 56: Hoare triple {4493#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {4493#false} is VALID [2022-04-28 15:33:05,318 INFO L290 TraceCheckUtils]: 57: Hoare triple {4493#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {4493#false} is VALID [2022-04-28 15:33:05,318 INFO L290 TraceCheckUtils]: 58: Hoare triple {4493#false} assume 8640 == #t~mem75;havoc #t~mem75; {4493#false} is VALID [2022-04-28 15:33:05,319 INFO L290 TraceCheckUtils]: 59: Hoare triple {4493#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {4493#false} is VALID [2022-04-28 15:33:05,319 INFO L290 TraceCheckUtils]: 60: Hoare triple {4493#false} assume !(4 == ~blastFlag~0); {4493#false} is VALID [2022-04-28 15:33:05,319 INFO L290 TraceCheckUtils]: 61: Hoare triple {4493#false} assume !(7 == ~blastFlag~0); {4493#false} is VALID [2022-04-28 15:33:05,319 INFO L290 TraceCheckUtils]: 62: Hoare triple {4493#false} assume !(10 == ~blastFlag~0); {4493#false} is VALID [2022-04-28 15:33:05,319 INFO L290 TraceCheckUtils]: 63: Hoare triple {4493#false} assume !false; {4493#false} is VALID [2022-04-28 15:33:05,319 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:33:05,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:33:05,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544749180] [2022-04-28 15:33:05,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544749180] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:33:05,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:33:05,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:33:05,320 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:33:05,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1881868609] [2022-04-28 15:33:05,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1881868609] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:33:05,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:33:05,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:33:05,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054426091] [2022-04-28 15:33:05,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:33:05,321 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-28 15:33:05,321 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:33:05,321 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-28 15:33:05,368 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-28 15:33:05,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:33:05,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:33:05,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:33:05,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:33:05,370 INFO L87 Difference]: Start difference. First operand 167 states and 254 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-28 15:33:11,314 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:33:15,233 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:33:16,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:33:16,421 INFO L93 Difference]: Finished difference Result 415 states and 640 transitions. [2022-04-28 15:33:16,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:33:16,421 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-28 15:33:16,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:33:16,421 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-28 15:33:16,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 607 transitions. [2022-04-28 15:33:16,424 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-28 15:33:16,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 607 transitions. [2022-04-28 15:33:16,427 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 607 transitions. [2022-04-28 15:33:16,806 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-28 15:33:16,810 INFO L225 Difference]: With dead ends: 415 [2022-04-28 15:33:16,810 INFO L226 Difference]: Without dead ends: 274 [2022-04-28 15:33:16,811 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-28 15:33:16,811 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 150 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-04-28 15:33:16,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 362 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-04-28 15:33:16,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2022-04-28 15:33:16,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 168. [2022-04-28 15:33:16,828 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:33:16,828 INFO L82 GeneralOperation]: Start isEquivalent. First operand 274 states. Second operand has 168 states, 163 states have (on average 1.5337423312883436) internal successors, (250), 163 states have internal predecessors, (250), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:33:16,829 INFO L74 IsIncluded]: Start isIncluded. First operand 274 states. Second operand has 168 states, 163 states have (on average 1.5337423312883436) internal successors, (250), 163 states have internal predecessors, (250), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:33:16,829 INFO L87 Difference]: Start difference. First operand 274 states. Second operand has 168 states, 163 states have (on average 1.5337423312883436) internal successors, (250), 163 states have internal predecessors, (250), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:33:16,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:33:16,838 INFO L93 Difference]: Finished difference Result 274 states and 420 transitions. [2022-04-28 15:33:16,838 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 420 transitions. [2022-04-28 15:33:16,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:33:16,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:33:16,839 INFO L74 IsIncluded]: Start isIncluded. First operand has 168 states, 163 states have (on average 1.5337423312883436) internal successors, (250), 163 states have internal predecessors, (250), 3 states have call successors, (3), 3 states 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-28 15:33:16,839 INFO L87 Difference]: Start difference. First operand has 168 states, 163 states have (on average 1.5337423312883436) internal successors, (250), 163 states have internal predecessors, (250), 3 states have call successors, (3), 3 states 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-28 15:33:16,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:33:16,843 INFO L93 Difference]: Finished difference Result 274 states and 420 transitions. [2022-04-28 15:33:16,843 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 420 transitions. [2022-04-28 15:33:16,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:33:16,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:33:16,844 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:33:16,844 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:33:16,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 163 states have (on average 1.5337423312883436) internal successors, (250), 163 states have internal predecessors, (250), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:33:16,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 254 transitions. [2022-04-28 15:33:16,847 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 254 transitions. Word has length 64 [2022-04-28 15:33:16,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:33:16,847 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 254 transitions. [2022-04-28 15:33:16,847 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-28 15:33:16,847 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 168 states and 254 transitions. [2022-04-28 15:33:17,083 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 254 edges. 254 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:33:17,083 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 254 transitions. [2022-04-28 15:33:17,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-28 15:33:17,084 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:33:17,084 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:33:17,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 15:33:17,084 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:33:17,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:33:17,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1864834526, now seen corresponding path program 1 times [2022-04-28 15:33:17,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:33:17,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1119627871] [2022-04-28 15:33:17,104 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:33:17,104 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:33:17,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1864834526, now seen corresponding path program 2 times [2022-04-28 15:33:17,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:33:17,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440467326] [2022-04-28 15:33:17,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:33:17,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:33:17,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:33:17,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:33:17,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:33:17,220 INFO L290 TraceCheckUtils]: 0: Hoare triple {6225#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {6218#true} is VALID [2022-04-28 15:33:17,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {6218#true} assume true; {6218#true} is VALID [2022-04-28 15:33:17,223 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6218#true} {6218#true} #703#return; {6218#true} is VALID [2022-04-28 15:33:17,224 INFO L272 TraceCheckUtils]: 0: Hoare triple {6218#true} call ULTIMATE.init(); {6225#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-28 15:33:17,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {6225#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {6218#true} is VALID [2022-04-28 15:33:17,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {6218#true} assume true; {6218#true} is VALID [2022-04-28 15:33:17,226 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6218#true} {6218#true} #703#return; {6218#true} is VALID [2022-04-28 15:33:17,226 INFO L272 TraceCheckUtils]: 4: Hoare triple {6218#true} call #t~ret161 := main(); {6218#true} is VALID [2022-04-28 15:33:17,226 INFO L290 TraceCheckUtils]: 5: Hoare triple {6218#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {6218#true} is VALID [2022-04-28 15:33:17,226 INFO L290 TraceCheckUtils]: 6: Hoare triple {6218#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {6218#true} is VALID [2022-04-28 15:33:17,226 INFO L272 TraceCheckUtils]: 7: Hoare triple {6218#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {6218#true} is VALID [2022-04-28 15:33:17,228 INFO L290 TraceCheckUtils]: 8: Hoare triple {6218#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {6223#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-28 15:33:17,228 INFO L290 TraceCheckUtils]: 9: Hoare triple {6223#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {6223#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-28 15:33:17,229 INFO L290 TraceCheckUtils]: 10: Hoare triple {6223#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {6223#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-28 15:33:17,229 INFO L290 TraceCheckUtils]: 11: Hoare triple {6223#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {6223#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-28 15:33:17,230 INFO L290 TraceCheckUtils]: 12: Hoare triple {6223#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {6223#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-28 15:33:17,230 INFO L290 TraceCheckUtils]: 13: Hoare triple {6223#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {6223#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-28 15:33:17,230 INFO L290 TraceCheckUtils]: 14: Hoare triple {6223#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} assume !false; {6223#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-28 15:33:17,231 INFO L290 TraceCheckUtils]: 15: Hoare triple {6223#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {6223#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-28 15:33:17,231 INFO L290 TraceCheckUtils]: 16: Hoare triple {6223#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {6223#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-28 15:33:17,231 INFO L290 TraceCheckUtils]: 17: Hoare triple {6223#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {6223#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-28 15:33:17,232 INFO L290 TraceCheckUtils]: 18: Hoare triple {6223#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {6223#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-28 15:33:17,232 INFO L290 TraceCheckUtils]: 19: Hoare triple {6223#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {6223#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-28 15:33:17,233 INFO L290 TraceCheckUtils]: 20: Hoare triple {6223#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {6223#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-28 15:33:17,233 INFO L290 TraceCheckUtils]: 21: Hoare triple {6223#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {6224#(not (= |ssl3_accept_#t~mem53| 8481))} is VALID [2022-04-28 15:33:17,234 INFO L290 TraceCheckUtils]: 22: Hoare triple {6224#(not (= |ssl3_accept_#t~mem53| 8481))} assume 8481 == #t~mem53;havoc #t~mem53; {6219#false} is VALID [2022-04-28 15:33:17,234 INFO L290 TraceCheckUtils]: 23: Hoare triple {6219#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {6219#false} is VALID [2022-04-28 15:33:17,234 INFO L290 TraceCheckUtils]: 24: Hoare triple {6219#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8482, #t~mem91.base, 904 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {6219#false} is VALID [2022-04-28 15:33:17,234 INFO L290 TraceCheckUtils]: 25: Hoare triple {6219#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {6219#false} is VALID [2022-04-28 15:33:17,234 INFO L290 TraceCheckUtils]: 26: Hoare triple {6219#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {6219#false} is VALID [2022-04-28 15:33:17,234 INFO L290 TraceCheckUtils]: 27: Hoare triple {6219#false} ~skip~0 := 0; {6219#false} is VALID [2022-04-28 15:33:17,234 INFO L290 TraceCheckUtils]: 28: Hoare triple {6219#false} assume !false; {6219#false} is VALID [2022-04-28 15:33:17,234 INFO L290 TraceCheckUtils]: 29: Hoare triple {6219#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {6219#false} is VALID [2022-04-28 15:33:17,234 INFO L290 TraceCheckUtils]: 30: Hoare triple {6219#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {6219#false} is VALID [2022-04-28 15:33:17,234 INFO L290 TraceCheckUtils]: 31: Hoare triple {6219#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {6219#false} is VALID [2022-04-28 15:33:17,234 INFO L290 TraceCheckUtils]: 32: Hoare triple {6219#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {6219#false} is VALID [2022-04-28 15:33:17,235 INFO L290 TraceCheckUtils]: 33: Hoare triple {6219#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {6219#false} is VALID [2022-04-28 15:33:17,235 INFO L290 TraceCheckUtils]: 34: Hoare triple {6219#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {6219#false} is VALID [2022-04-28 15:33:17,235 INFO L290 TraceCheckUtils]: 35: Hoare triple {6219#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {6219#false} is VALID [2022-04-28 15:33:17,235 INFO L290 TraceCheckUtils]: 36: Hoare triple {6219#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {6219#false} is VALID [2022-04-28 15:33:17,235 INFO L290 TraceCheckUtils]: 37: Hoare triple {6219#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {6219#false} is VALID [2022-04-28 15:33:17,235 INFO L290 TraceCheckUtils]: 38: Hoare triple {6219#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {6219#false} is VALID [2022-04-28 15:33:17,235 INFO L290 TraceCheckUtils]: 39: Hoare triple {6219#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {6219#false} is VALID [2022-04-28 15:33:17,235 INFO L290 TraceCheckUtils]: 40: Hoare triple {6219#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {6219#false} is VALID [2022-04-28 15:33:17,235 INFO L290 TraceCheckUtils]: 41: Hoare triple {6219#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {6219#false} is VALID [2022-04-28 15:33:17,235 INFO L290 TraceCheckUtils]: 42: Hoare triple {6219#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {6219#false} is VALID [2022-04-28 15:33:17,235 INFO L290 TraceCheckUtils]: 43: Hoare triple {6219#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {6219#false} is VALID [2022-04-28 15:33:17,235 INFO L290 TraceCheckUtils]: 44: Hoare triple {6219#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {6219#false} is VALID [2022-04-28 15:33:17,236 INFO L290 TraceCheckUtils]: 45: Hoare triple {6219#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {6219#false} is VALID [2022-04-28 15:33:17,236 INFO L290 TraceCheckUtils]: 46: Hoare triple {6219#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {6219#false} is VALID [2022-04-28 15:33:17,236 INFO L290 TraceCheckUtils]: 47: Hoare triple {6219#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {6219#false} is VALID [2022-04-28 15:33:17,236 INFO L290 TraceCheckUtils]: 48: Hoare triple {6219#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {6219#false} is VALID [2022-04-28 15:33:17,236 INFO L290 TraceCheckUtils]: 49: Hoare triple {6219#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {6219#false} is VALID [2022-04-28 15:33:17,236 INFO L290 TraceCheckUtils]: 50: Hoare triple {6219#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {6219#false} is VALID [2022-04-28 15:33:17,236 INFO L290 TraceCheckUtils]: 51: Hoare triple {6219#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {6219#false} is VALID [2022-04-28 15:33:17,236 INFO L290 TraceCheckUtils]: 52: Hoare triple {6219#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {6219#false} is VALID [2022-04-28 15:33:17,236 INFO L290 TraceCheckUtils]: 53: Hoare triple {6219#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {6219#false} is VALID [2022-04-28 15:33:17,236 INFO L290 TraceCheckUtils]: 54: Hoare triple {6219#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {6219#false} is VALID [2022-04-28 15:33:17,236 INFO L290 TraceCheckUtils]: 55: Hoare triple {6219#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {6219#false} is VALID [2022-04-28 15:33:17,236 INFO L290 TraceCheckUtils]: 56: Hoare triple {6219#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {6219#false} is VALID [2022-04-28 15:33:17,236 INFO L290 TraceCheckUtils]: 57: Hoare triple {6219#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {6219#false} is VALID [2022-04-28 15:33:17,237 INFO L290 TraceCheckUtils]: 58: Hoare triple {6219#false} assume 8640 == #t~mem75;havoc #t~mem75; {6219#false} is VALID [2022-04-28 15:33:17,237 INFO L290 TraceCheckUtils]: 59: Hoare triple {6219#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {6219#false} is VALID [2022-04-28 15:33:17,237 INFO L290 TraceCheckUtils]: 60: Hoare triple {6219#false} assume !(4 == ~blastFlag~0); {6219#false} is VALID [2022-04-28 15:33:17,237 INFO L290 TraceCheckUtils]: 61: Hoare triple {6219#false} assume !(7 == ~blastFlag~0); {6219#false} is VALID [2022-04-28 15:33:17,237 INFO L290 TraceCheckUtils]: 62: Hoare triple {6219#false} assume !(10 == ~blastFlag~0); {6219#false} is VALID [2022-04-28 15:33:17,237 INFO L290 TraceCheckUtils]: 63: Hoare triple {6219#false} assume !false; {6219#false} is VALID [2022-04-28 15:33:17,238 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:33:17,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:33:17,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440467326] [2022-04-28 15:33:17,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440467326] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:33:17,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:33:17,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:33:17,239 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:33:17,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1119627871] [2022-04-28 15:33:17,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1119627871] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:33:17,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:33:17,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:33:17,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992279998] [2022-04-28 15:33:17,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:33:17,243 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-28 15:33:17,243 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:33:17,244 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-28 15:33:17,289 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-28 15:33:17,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:33:17,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:33:17,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:33:17,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:33:17,290 INFO L87 Difference]: Start difference. First operand 168 states and 254 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-28 15:33:20,235 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-28 15:33:22,241 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:33:26,410 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:33:27,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:33:27,490 INFO L93 Difference]: Finished difference Result 416 states and 639 transitions. [2022-04-28 15:33:27,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:33:27,491 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-28 15:33:27,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:33:27,491 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-28 15:33:27,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 606 transitions. [2022-04-28 15:33:27,494 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-28 15:33:27,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 606 transitions. [2022-04-28 15:33:27,499 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 606 transitions. [2022-04-28 15:33:27,929 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 606 edges. 606 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:33:27,933 INFO L225 Difference]: With dead ends: 416 [2022-04-28 15:33:27,933 INFO L226 Difference]: Without dead ends: 274 [2022-04-28 15:33:27,934 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-28 15:33:27,934 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 144 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-04-28 15:33:27,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 362 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 480 Invalid, 1 Unknown, 0 Unchecked, 5.7s Time] [2022-04-28 15:33:27,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2022-04-28 15:33:27,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 173. [2022-04-28 15:33:27,942 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:33:27,942 INFO L82 GeneralOperation]: Start isEquivalent. First operand 274 states. Second operand has 173 states, 168 states have (on average 1.5357142857142858) internal successors, (258), 168 states have internal predecessors, (258), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:33:27,942 INFO L74 IsIncluded]: Start isIncluded. First operand 274 states. Second operand has 173 states, 168 states have (on average 1.5357142857142858) internal successors, (258), 168 states have internal predecessors, (258), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:33:27,943 INFO L87 Difference]: Start difference. First operand 274 states. Second operand has 173 states, 168 states have (on average 1.5357142857142858) internal successors, (258), 168 states have internal predecessors, (258), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:33:27,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:33:27,947 INFO L93 Difference]: Finished difference Result 274 states and 418 transitions. [2022-04-28 15:33:27,947 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 418 transitions. [2022-04-28 15:33:27,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:33:27,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:33:27,948 INFO L74 IsIncluded]: Start isIncluded. First operand has 173 states, 168 states have (on average 1.5357142857142858) internal successors, (258), 168 states have internal predecessors, (258), 3 states have call successors, (3), 3 states 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-28 15:33:27,948 INFO L87 Difference]: Start difference. First operand has 173 states, 168 states have (on average 1.5357142857142858) internal successors, (258), 168 states have internal predecessors, (258), 3 states have call successors, (3), 3 states 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-28 15:33:27,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:33:27,952 INFO L93 Difference]: Finished difference Result 274 states and 418 transitions. [2022-04-28 15:33:27,952 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 418 transitions. [2022-04-28 15:33:27,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:33:27,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:33:27,953 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:33:27,953 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:33:27,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 168 states have (on average 1.5357142857142858) internal successors, (258), 168 states have internal predecessors, (258), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:33:27,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 262 transitions. [2022-04-28 15:33:27,956 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 262 transitions. Word has length 64 [2022-04-28 15:33:27,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:33:27,956 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 262 transitions. [2022-04-28 15:33:27,956 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-28 15:33:27,956 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 173 states and 262 transitions. [2022-04-28 15:33:28,137 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 262 edges. 262 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:33:28,137 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 262 transitions. [2022-04-28 15:33:28,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-28 15:33:28,137 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:33:28,138 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:33:28,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 15:33:28,138 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:33:28,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:33:28,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1932394527, now seen corresponding path program 1 times [2022-04-28 15:33:28,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:33:28,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1160350549] [2022-04-28 15:33:28,149 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:33:28,149 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:33:28,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1932394527, now seen corresponding path program 2 times [2022-04-28 15:33:28,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:33:28,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034141568] [2022-04-28 15:33:28,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:33:28,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:33:28,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:33:28,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:33:28,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:33:28,252 INFO L290 TraceCheckUtils]: 0: Hoare triple {7963#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {7956#true} is VALID [2022-04-28 15:33:28,252 INFO L290 TraceCheckUtils]: 1: Hoare triple {7956#true} assume true; {7956#true} is VALID [2022-04-28 15:33:28,252 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7956#true} {7956#true} #703#return; {7956#true} is VALID [2022-04-28 15:33:28,252 INFO L272 TraceCheckUtils]: 0: Hoare triple {7956#true} call ULTIMATE.init(); {7963#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-28 15:33:28,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {7963#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {7956#true} is VALID [2022-04-28 15:33:28,253 INFO L290 TraceCheckUtils]: 2: Hoare triple {7956#true} assume true; {7956#true} is VALID [2022-04-28 15:33:28,253 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7956#true} {7956#true} #703#return; {7956#true} is VALID [2022-04-28 15:33:28,253 INFO L272 TraceCheckUtils]: 4: Hoare triple {7956#true} call #t~ret161 := main(); {7956#true} is VALID [2022-04-28 15:33:28,253 INFO L290 TraceCheckUtils]: 5: Hoare triple {7956#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {7956#true} is VALID [2022-04-28 15:33:28,253 INFO L290 TraceCheckUtils]: 6: Hoare triple {7956#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {7956#true} is VALID [2022-04-28 15:33:28,254 INFO L272 TraceCheckUtils]: 7: Hoare triple {7956#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {7956#true} is VALID [2022-04-28 15:33:28,256 INFO L290 TraceCheckUtils]: 8: Hoare triple {7956#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {7961#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:33:28,257 INFO L290 TraceCheckUtils]: 9: Hoare triple {7961#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {7961#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:33:28,257 INFO L290 TraceCheckUtils]: 10: Hoare triple {7961#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {7961#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:33:28,258 INFO L290 TraceCheckUtils]: 11: Hoare triple {7961#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {7961#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:33:28,258 INFO L290 TraceCheckUtils]: 12: Hoare triple {7961#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {7961#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:33:28,258 INFO L290 TraceCheckUtils]: 13: Hoare triple {7961#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {7961#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:33:28,262 INFO L290 TraceCheckUtils]: 14: Hoare triple {7961#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {7961#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:33:28,263 INFO L290 TraceCheckUtils]: 15: Hoare triple {7961#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {7961#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:33:28,263 INFO L290 TraceCheckUtils]: 16: Hoare triple {7961#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {7961#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:33:28,264 INFO L290 TraceCheckUtils]: 17: Hoare triple {7961#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {7961#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:33:28,264 INFO L290 TraceCheckUtils]: 18: Hoare triple {7961#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {7961#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:33:28,264 INFO L290 TraceCheckUtils]: 19: Hoare triple {7961#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {7961#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:33:28,265 INFO L290 TraceCheckUtils]: 20: Hoare triple {7961#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {7961#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:33:28,265 INFO L290 TraceCheckUtils]: 21: Hoare triple {7961#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {7961#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:33:28,265 INFO L290 TraceCheckUtils]: 22: Hoare triple {7961#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {7962#(not (= |ssl3_accept_#t~mem54| 8482))} is VALID [2022-04-28 15:33:28,265 INFO L290 TraceCheckUtils]: 23: Hoare triple {7962#(not (= |ssl3_accept_#t~mem54| 8482))} assume 8482 == #t~mem54;havoc #t~mem54; {7957#false} is VALID [2022-04-28 15:33:28,266 INFO L290 TraceCheckUtils]: 24: Hoare triple {7957#false} call write~int(3, ~s.base, 72 + ~s.offset, 4); {7957#false} is VALID [2022-04-28 15:33:28,266 INFO L290 TraceCheckUtils]: 25: Hoare triple {7957#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {7957#false} is VALID [2022-04-28 15:33:28,266 INFO L290 TraceCheckUtils]: 26: Hoare triple {7957#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {7957#false} is VALID [2022-04-28 15:33:28,266 INFO L290 TraceCheckUtils]: 27: Hoare triple {7957#false} ~skip~0 := 0; {7957#false} is VALID [2022-04-28 15:33:28,266 INFO L290 TraceCheckUtils]: 28: Hoare triple {7957#false} assume !false; {7957#false} is VALID [2022-04-28 15:33:28,266 INFO L290 TraceCheckUtils]: 29: Hoare triple {7957#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {7957#false} is VALID [2022-04-28 15:33:28,266 INFO L290 TraceCheckUtils]: 30: Hoare triple {7957#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {7957#false} is VALID [2022-04-28 15:33:28,266 INFO L290 TraceCheckUtils]: 31: Hoare triple {7957#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {7957#false} is VALID [2022-04-28 15:33:28,266 INFO L290 TraceCheckUtils]: 32: Hoare triple {7957#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {7957#false} is VALID [2022-04-28 15:33:28,266 INFO L290 TraceCheckUtils]: 33: Hoare triple {7957#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {7957#false} is VALID [2022-04-28 15:33:28,266 INFO L290 TraceCheckUtils]: 34: Hoare triple {7957#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {7957#false} is VALID [2022-04-28 15:33:28,266 INFO L290 TraceCheckUtils]: 35: Hoare triple {7957#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {7957#false} is VALID [2022-04-28 15:33:28,267 INFO L290 TraceCheckUtils]: 36: Hoare triple {7957#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {7957#false} is VALID [2022-04-28 15:33:28,267 INFO L290 TraceCheckUtils]: 37: Hoare triple {7957#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {7957#false} is VALID [2022-04-28 15:33:28,267 INFO L290 TraceCheckUtils]: 38: Hoare triple {7957#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {7957#false} is VALID [2022-04-28 15:33:28,267 INFO L290 TraceCheckUtils]: 39: Hoare triple {7957#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {7957#false} is VALID [2022-04-28 15:33:28,267 INFO L290 TraceCheckUtils]: 40: Hoare triple {7957#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {7957#false} is VALID [2022-04-28 15:33:28,267 INFO L290 TraceCheckUtils]: 41: Hoare triple {7957#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {7957#false} is VALID [2022-04-28 15:33:28,267 INFO L290 TraceCheckUtils]: 42: Hoare triple {7957#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {7957#false} is VALID [2022-04-28 15:33:28,267 INFO L290 TraceCheckUtils]: 43: Hoare triple {7957#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {7957#false} is VALID [2022-04-28 15:33:28,267 INFO L290 TraceCheckUtils]: 44: Hoare triple {7957#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {7957#false} is VALID [2022-04-28 15:33:28,267 INFO L290 TraceCheckUtils]: 45: Hoare triple {7957#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {7957#false} is VALID [2022-04-28 15:33:28,267 INFO L290 TraceCheckUtils]: 46: Hoare triple {7957#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {7957#false} is VALID [2022-04-28 15:33:28,267 INFO L290 TraceCheckUtils]: 47: Hoare triple {7957#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {7957#false} is VALID [2022-04-28 15:33:28,268 INFO L290 TraceCheckUtils]: 48: Hoare triple {7957#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {7957#false} is VALID [2022-04-28 15:33:28,268 INFO L290 TraceCheckUtils]: 49: Hoare triple {7957#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {7957#false} is VALID [2022-04-28 15:33:28,268 INFO L290 TraceCheckUtils]: 50: Hoare triple {7957#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {7957#false} is VALID [2022-04-28 15:33:28,268 INFO L290 TraceCheckUtils]: 51: Hoare triple {7957#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {7957#false} is VALID [2022-04-28 15:33:28,268 INFO L290 TraceCheckUtils]: 52: Hoare triple {7957#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {7957#false} is VALID [2022-04-28 15:33:28,268 INFO L290 TraceCheckUtils]: 53: Hoare triple {7957#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {7957#false} is VALID [2022-04-28 15:33:28,270 INFO L290 TraceCheckUtils]: 54: Hoare triple {7957#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {7957#false} is VALID [2022-04-28 15:33:28,270 INFO L290 TraceCheckUtils]: 55: Hoare triple {7957#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {7957#false} is VALID [2022-04-28 15:33:28,274 INFO L290 TraceCheckUtils]: 56: Hoare triple {7957#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {7957#false} is VALID [2022-04-28 15:33:28,275 INFO L290 TraceCheckUtils]: 57: Hoare triple {7957#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {7957#false} is VALID [2022-04-28 15:33:28,276 INFO L290 TraceCheckUtils]: 58: Hoare triple {7957#false} assume 8640 == #t~mem75;havoc #t~mem75; {7957#false} is VALID [2022-04-28 15:33:28,276 INFO L290 TraceCheckUtils]: 59: Hoare triple {7957#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {7957#false} is VALID [2022-04-28 15:33:28,276 INFO L290 TraceCheckUtils]: 60: Hoare triple {7957#false} assume !(4 == ~blastFlag~0); {7957#false} is VALID [2022-04-28 15:33:28,276 INFO L290 TraceCheckUtils]: 61: Hoare triple {7957#false} assume !(7 == ~blastFlag~0); {7957#false} is VALID [2022-04-28 15:33:28,276 INFO L290 TraceCheckUtils]: 62: Hoare triple {7957#false} assume !(10 == ~blastFlag~0); {7957#false} is VALID [2022-04-28 15:33:28,276 INFO L290 TraceCheckUtils]: 63: Hoare triple {7957#false} assume !false; {7957#false} is VALID [2022-04-28 15:33:28,277 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:33:28,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:33:28,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034141568] [2022-04-28 15:33:28,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034141568] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:33:28,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:33:28,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:33:28,277 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:33:28,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1160350549] [2022-04-28 15:33:28,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1160350549] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:33:28,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:33:28,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:33:28,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727690508] [2022-04-28 15:33:28,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:33:28,278 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-28 15:33:28,278 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:33:28,278 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-28 15:33:28,337 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-28 15:33:28,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:33:28,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:33:28,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:33:28,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:33:28,339 INFO L87 Difference]: Start difference. First operand 173 states and 262 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-28 15:33:31,146 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:33:36,453 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:33:37,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:33:37,626 INFO L93 Difference]: Finished difference Result 420 states and 645 transitions. [2022-04-28 15:33:37,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:33:37,626 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-28 15:33:37,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:33:37,626 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-28 15:33:37,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 604 transitions. [2022-04-28 15:33:37,629 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-28 15:33:37,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 604 transitions. [2022-04-28 15:33:37,631 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 604 transitions. [2022-04-28 15:33:38,013 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 604 edges. 604 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:33:38,017 INFO L225 Difference]: With dead ends: 420 [2022-04-28 15:33:38,017 INFO L226 Difference]: Without dead ends: 273 [2022-04-28 15:33:38,017 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-28 15:33:38,018 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 142 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 62 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-04-28 15:33:38,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 364 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 478 Invalid, 1 Unknown, 0 Unchecked, 5.6s Time] [2022-04-28 15:33:38,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-04-28 15:33:38,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 174. [2022-04-28 15:33:38,023 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:33:38,023 INFO L82 GeneralOperation]: Start isEquivalent. First operand 273 states. Second operand has 174 states, 169 states have (on average 1.5266272189349113) internal successors, (258), 169 states have internal predecessors, (258), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:33:38,024 INFO L74 IsIncluded]: Start isIncluded. First operand 273 states. Second operand has 174 states, 169 states have (on average 1.5266272189349113) internal successors, (258), 169 states have internal predecessors, (258), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:33:38,024 INFO L87 Difference]: Start difference. First operand 273 states. Second operand has 174 states, 169 states have (on average 1.5266272189349113) internal successors, (258), 169 states have internal predecessors, (258), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:33:38,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:33:38,028 INFO L93 Difference]: Finished difference Result 273 states and 415 transitions. [2022-04-28 15:33:38,028 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 415 transitions. [2022-04-28 15:33:38,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:33:38,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:33:38,028 INFO L74 IsIncluded]: Start isIncluded. First operand has 174 states, 169 states have (on average 1.5266272189349113) internal successors, (258), 169 states have internal predecessors, (258), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 273 states. [2022-04-28 15:33:38,029 INFO L87 Difference]: Start difference. First operand has 174 states, 169 states have (on average 1.5266272189349113) internal successors, (258), 169 states have internal predecessors, (258), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 273 states. [2022-04-28 15:33:38,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:33:38,032 INFO L93 Difference]: Finished difference Result 273 states and 415 transitions. [2022-04-28 15:33:38,032 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 415 transitions. [2022-04-28 15:33:38,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:33:38,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:33:38,033 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:33:38,033 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:33:38,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 169 states have (on average 1.5266272189349113) internal successors, (258), 169 states have internal predecessors, (258), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:33:38,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 262 transitions. [2022-04-28 15:33:38,035 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 262 transitions. Word has length 64 [2022-04-28 15:33:38,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:33:38,036 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 262 transitions. [2022-04-28 15:33:38,036 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-28 15:33:38,036 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 174 states and 262 transitions. [2022-04-28 15:33:38,210 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 262 edges. 262 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:33:38,210 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 262 transitions. [2022-04-28 15:33:38,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-28 15:33:38,211 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:33:38,211 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:33:38,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 15:33:38,211 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:33:38,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:33:38,212 INFO L85 PathProgramCache]: Analyzing trace with hash -165707508, now seen corresponding path program 1 times [2022-04-28 15:33:38,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:33:38,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1639265810] [2022-04-28 15:33:38,231 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 15:33:38,231 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:33:38,231 INFO L85 PathProgramCache]: Analyzing trace with hash -165707508, now seen corresponding path program 2 times [2022-04-28 15:33:38,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:33:38,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181505674] [2022-04-28 15:33:38,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:33:38,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:33:38,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:33:38,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:33:38,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:33:38,353 INFO L290 TraceCheckUtils]: 0: Hoare triple {9709#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {9702#true} is VALID [2022-04-28 15:33:38,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {9702#true} assume true; {9702#true} is VALID [2022-04-28 15:33:38,354 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9702#true} {9702#true} #703#return; {9702#true} is VALID [2022-04-28 15:33:38,354 INFO L272 TraceCheckUtils]: 0: Hoare triple {9702#true} call ULTIMATE.init(); {9709#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-28 15:33:38,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {9709#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {9702#true} is VALID [2022-04-28 15:33:38,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {9702#true} assume true; {9702#true} is VALID [2022-04-28 15:33:38,355 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9702#true} {9702#true} #703#return; {9702#true} is VALID [2022-04-28 15:33:38,355 INFO L272 TraceCheckUtils]: 4: Hoare triple {9702#true} call #t~ret161 := main(); {9702#true} is VALID [2022-04-28 15:33:38,355 INFO L290 TraceCheckUtils]: 5: Hoare triple {9702#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {9702#true} is VALID [2022-04-28 15:33:38,355 INFO L290 TraceCheckUtils]: 6: Hoare triple {9702#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {9702#true} is VALID [2022-04-28 15:33:38,355 INFO L272 TraceCheckUtils]: 7: Hoare triple {9702#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {9702#true} is VALID [2022-04-28 15:33:38,357 INFO L290 TraceCheckUtils]: 8: Hoare triple {9702#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {9707#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:33:38,357 INFO L290 TraceCheckUtils]: 9: Hoare triple {9707#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {9707#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:33:38,358 INFO L290 TraceCheckUtils]: 10: Hoare triple {9707#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {9707#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:33:38,358 INFO L290 TraceCheckUtils]: 11: Hoare triple {9707#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {9707#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:33:38,359 INFO L290 TraceCheckUtils]: 12: Hoare triple {9707#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {9707#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:33:38,359 INFO L290 TraceCheckUtils]: 13: Hoare triple {9707#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {9707#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:33:38,359 INFO L290 TraceCheckUtils]: 14: Hoare triple {9707#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {9707#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:33:38,360 INFO L290 TraceCheckUtils]: 15: Hoare triple {9707#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {9707#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:33:38,360 INFO L290 TraceCheckUtils]: 16: Hoare triple {9707#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {9707#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:33:38,360 INFO L290 TraceCheckUtils]: 17: Hoare triple {9707#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {9708#(= 8464 |ssl3_accept_#t~mem49|)} is VALID [2022-04-28 15:33:38,361 INFO L290 TraceCheckUtils]: 18: Hoare triple {9708#(= 8464 |ssl3_accept_#t~mem49|)} assume 8192 == #t~mem49;havoc #t~mem49; {9703#false} is VALID [2022-04-28 15:33:38,361 INFO L290 TraceCheckUtils]: 19: Hoare triple {9703#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {9703#false} is VALID [2022-04-28 15:33:38,361 INFO L290 TraceCheckUtils]: 20: Hoare triple {9703#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {9703#false} is VALID [2022-04-28 15:33:38,361 INFO L290 TraceCheckUtils]: 21: Hoare triple {9703#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {9703#false} is VALID [2022-04-28 15:33:38,361 INFO L290 TraceCheckUtils]: 22: Hoare triple {9703#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, 80 + ~s.offset, 8); {9703#false} is VALID [2022-04-28 15:33:38,361 INFO L290 TraceCheckUtils]: 23: Hoare triple {9703#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {9703#false} is VALID [2022-04-28 15:33:38,361 INFO L290 TraceCheckUtils]: 24: Hoare triple {9703#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {9703#false} is VALID [2022-04-28 15:33:38,362 INFO L290 TraceCheckUtils]: 25: Hoare triple {9703#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem89 := read~int(#t~mem88.base, 132 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 132 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 72 + ~s.offset, 4); {9703#false} is VALID [2022-04-28 15:33:38,362 INFO L290 TraceCheckUtils]: 26: Hoare triple {9703#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {9703#false} is VALID [2022-04-28 15:33:38,362 INFO L290 TraceCheckUtils]: 27: Hoare triple {9703#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {9703#false} is VALID [2022-04-28 15:33:38,362 INFO L290 TraceCheckUtils]: 28: Hoare triple {9703#false} ~skip~0 := 0; {9703#false} is VALID [2022-04-28 15:33:38,362 INFO L290 TraceCheckUtils]: 29: Hoare triple {9703#false} assume !false; {9703#false} is VALID [2022-04-28 15:33:38,362 INFO L290 TraceCheckUtils]: 30: Hoare triple {9703#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {9703#false} is VALID [2022-04-28 15:33:38,362 INFO L290 TraceCheckUtils]: 31: Hoare triple {9703#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {9703#false} is VALID [2022-04-28 15:33:38,362 INFO L290 TraceCheckUtils]: 32: Hoare triple {9703#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {9703#false} is VALID [2022-04-28 15:33:38,362 INFO L290 TraceCheckUtils]: 33: Hoare triple {9703#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {9703#false} is VALID [2022-04-28 15:33:38,363 INFO L290 TraceCheckUtils]: 34: Hoare triple {9703#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {9703#false} is VALID [2022-04-28 15:33:38,363 INFO L290 TraceCheckUtils]: 35: Hoare triple {9703#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {9703#false} is VALID [2022-04-28 15:33:38,363 INFO L290 TraceCheckUtils]: 36: Hoare triple {9703#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {9703#false} is VALID [2022-04-28 15:33:38,363 INFO L290 TraceCheckUtils]: 37: Hoare triple {9703#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {9703#false} is VALID [2022-04-28 15:33:38,363 INFO L290 TraceCheckUtils]: 38: Hoare triple {9703#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {9703#false} is VALID [2022-04-28 15:33:38,363 INFO L290 TraceCheckUtils]: 39: Hoare triple {9703#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {9703#false} is VALID [2022-04-28 15:33:38,363 INFO L290 TraceCheckUtils]: 40: Hoare triple {9703#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {9703#false} is VALID [2022-04-28 15:33:38,363 INFO L290 TraceCheckUtils]: 41: Hoare triple {9703#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {9703#false} is VALID [2022-04-28 15:33:38,363 INFO L290 TraceCheckUtils]: 42: Hoare triple {9703#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {9703#false} is VALID [2022-04-28 15:33:38,363 INFO L290 TraceCheckUtils]: 43: Hoare triple {9703#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {9703#false} is VALID [2022-04-28 15:33:38,363 INFO L290 TraceCheckUtils]: 44: Hoare triple {9703#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {9703#false} is VALID [2022-04-28 15:33:38,363 INFO L290 TraceCheckUtils]: 45: Hoare triple {9703#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {9703#false} is VALID [2022-04-28 15:33:38,363 INFO L290 TraceCheckUtils]: 46: Hoare triple {9703#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {9703#false} is VALID [2022-04-28 15:33:38,363 INFO L290 TraceCheckUtils]: 47: Hoare triple {9703#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {9703#false} is VALID [2022-04-28 15:33:38,364 INFO L290 TraceCheckUtils]: 48: Hoare triple {9703#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {9703#false} is VALID [2022-04-28 15:33:38,364 INFO L290 TraceCheckUtils]: 49: Hoare triple {9703#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {9703#false} is VALID [2022-04-28 15:33:38,364 INFO L290 TraceCheckUtils]: 50: Hoare triple {9703#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {9703#false} is VALID [2022-04-28 15:33:38,364 INFO L290 TraceCheckUtils]: 51: Hoare triple {9703#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {9703#false} is VALID [2022-04-28 15:33:38,364 INFO L290 TraceCheckUtils]: 52: Hoare triple {9703#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {9703#false} is VALID [2022-04-28 15:33:38,364 INFO L290 TraceCheckUtils]: 53: Hoare triple {9703#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {9703#false} is VALID [2022-04-28 15:33:38,364 INFO L290 TraceCheckUtils]: 54: Hoare triple {9703#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {9703#false} is VALID [2022-04-28 15:33:38,364 INFO L290 TraceCheckUtils]: 55: Hoare triple {9703#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {9703#false} is VALID [2022-04-28 15:33:38,364 INFO L290 TraceCheckUtils]: 56: Hoare triple {9703#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {9703#false} is VALID [2022-04-28 15:33:38,364 INFO L290 TraceCheckUtils]: 57: Hoare triple {9703#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {9703#false} is VALID [2022-04-28 15:33:38,364 INFO L290 TraceCheckUtils]: 58: Hoare triple {9703#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {9703#false} is VALID [2022-04-28 15:33:38,364 INFO L290 TraceCheckUtils]: 59: Hoare triple {9703#false} assume 8640 == #t~mem75;havoc #t~mem75; {9703#false} is VALID [2022-04-28 15:33:38,364 INFO L290 TraceCheckUtils]: 60: Hoare triple {9703#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {9703#false} is VALID [2022-04-28 15:33:38,365 INFO L290 TraceCheckUtils]: 61: Hoare triple {9703#false} assume !(4 == ~blastFlag~0); {9703#false} is VALID [2022-04-28 15:33:38,365 INFO L290 TraceCheckUtils]: 62: Hoare triple {9703#false} assume !(7 == ~blastFlag~0); {9703#false} is VALID [2022-04-28 15:33:38,365 INFO L290 TraceCheckUtils]: 63: Hoare triple {9703#false} assume !(10 == ~blastFlag~0); {9703#false} is VALID [2022-04-28 15:33:38,365 INFO L290 TraceCheckUtils]: 64: Hoare triple {9703#false} assume !false; {9703#false} is VALID [2022-04-28 15:33:38,365 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:33:38,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:33:38,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181505674] [2022-04-28 15:33:38,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181505674] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:33:38,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:33:38,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:33:38,366 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:33:38,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1639265810] [2022-04-28 15:33:38,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1639265810] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:33:38,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:33:38,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:33:38,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089005882] [2022-04-28 15:33:38,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:33:38,367 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-28 15:33:38,367 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:33:38,367 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-28 15:33:38,413 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-28 15:33:38,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:33:38,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:33:38,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:33:38,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:33:38,414 INFO L87 Difference]: Start difference. First operand 174 states and 262 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-28 15:33:41,525 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:33:48,245 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:33:50,251 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:33:51,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:33:51,136 INFO L93 Difference]: Finished difference Result 335 states and 508 transitions. [2022-04-28 15:33:51,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:33:51,136 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-28 15:33:51,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:33:51,136 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-28 15:33:51,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 454 transitions. [2022-04-28 15:33:51,139 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-28 15:33:51,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 454 transitions. [2022-04-28 15:33:51,142 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 454 transitions. [2022-04-28 15:33:51,438 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 454 edges. 454 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:33:51,441 INFO L225 Difference]: With dead ends: 335 [2022-04-28 15:33:51,441 INFO L226 Difference]: Without dead ends: 187 [2022-04-28 15:33:51,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:33:51,442 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 22 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-04-28 15:33:51,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 509 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 361 Invalid, 1 Unknown, 0 Unchecked, 6.9s Time] [2022-04-28 15:33:51,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-04-28 15:33:51,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 174. [2022-04-28 15:33:51,446 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:33:51,447 INFO L82 GeneralOperation]: Start isEquivalent. First operand 187 states. Second operand has 174 states, 169 states have (on average 1.5207100591715976) internal successors, (257), 169 states have internal predecessors, (257), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:33:51,448 INFO L74 IsIncluded]: Start isIncluded. First operand 187 states. Second operand has 174 states, 169 states have (on average 1.5207100591715976) internal successors, (257), 169 states have internal predecessors, (257), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:33:51,449 INFO L87 Difference]: Start difference. First operand 187 states. Second operand has 174 states, 169 states have (on average 1.5207100591715976) internal successors, (257), 169 states have internal predecessors, (257), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:33:51,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:33:51,454 INFO L93 Difference]: Finished difference Result 187 states and 278 transitions. [2022-04-28 15:33:51,455 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 278 transitions. [2022-04-28 15:33:51,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:33:51,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:33:51,455 INFO L74 IsIncluded]: Start isIncluded. First operand has 174 states, 169 states have (on average 1.5207100591715976) internal successors, (257), 169 states have internal predecessors, (257), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 187 states. [2022-04-28 15:33:51,456 INFO L87 Difference]: Start difference. First operand has 174 states, 169 states have (on average 1.5207100591715976) internal successors, (257), 169 states have internal predecessors, (257), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 187 states. [2022-04-28 15:33:51,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:33:51,458 INFO L93 Difference]: Finished difference Result 187 states and 278 transitions. [2022-04-28 15:33:51,458 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 278 transitions. [2022-04-28 15:33:51,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:33:51,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:33:51,458 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:33:51,458 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:33:51,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 169 states have (on average 1.5207100591715976) internal successors, (257), 169 states have internal predecessors, (257), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:33:51,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 261 transitions. [2022-04-28 15:33:51,461 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 261 transitions. Word has length 65 [2022-04-28 15:33:51,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:33:51,461 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 261 transitions. [2022-04-28 15:33:51,461 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-28 15:33:51,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 174 states and 261 transitions. [2022-04-28 15:33:51,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 261 edges. 261 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:33:51,641 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 261 transitions. [2022-04-28 15:33:51,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-28 15:33:51,642 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:33:51,642 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:33:51,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 15:33:51,642 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:33:51,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:33:51,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1512732084, now seen corresponding path program 1 times [2022-04-28 15:33:51,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:33:51,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2128864909] [2022-04-28 15:33:51,661 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 15:33:51,661 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:33:51,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1512732084, now seen corresponding path program 2 times [2022-04-28 15:33:51,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:33:51,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32558254] [2022-04-28 15:33:51,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:33:51,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:33:51,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:33:51,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:33:51,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:33:51,763 INFO L290 TraceCheckUtils]: 0: Hoare triple {11113#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {11106#true} is VALID [2022-04-28 15:33:51,763 INFO L290 TraceCheckUtils]: 1: Hoare triple {11106#true} assume true; {11106#true} is VALID [2022-04-28 15:33:51,764 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11106#true} {11106#true} #703#return; {11106#true} is VALID [2022-04-28 15:33:51,764 INFO L272 TraceCheckUtils]: 0: Hoare triple {11106#true} call ULTIMATE.init(); {11113#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-28 15:33:51,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {11113#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {11106#true} is VALID [2022-04-28 15:33:51,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {11106#true} assume true; {11106#true} is VALID [2022-04-28 15:33:51,765 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11106#true} {11106#true} #703#return; {11106#true} is VALID [2022-04-28 15:33:51,765 INFO L272 TraceCheckUtils]: 4: Hoare triple {11106#true} call #t~ret161 := main(); {11106#true} is VALID [2022-04-28 15:33:51,765 INFO L290 TraceCheckUtils]: 5: Hoare triple {11106#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {11106#true} is VALID [2022-04-28 15:33:51,765 INFO L290 TraceCheckUtils]: 6: Hoare triple {11106#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {11106#true} is VALID [2022-04-28 15:33:51,765 INFO L272 TraceCheckUtils]: 7: Hoare triple {11106#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {11106#true} is VALID [2022-04-28 15:33:51,767 INFO L290 TraceCheckUtils]: 8: Hoare triple {11106#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {11111#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:33:51,767 INFO L290 TraceCheckUtils]: 9: Hoare triple {11111#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {11111#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:33:51,768 INFO L290 TraceCheckUtils]: 10: Hoare triple {11111#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {11111#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:33:51,768 INFO L290 TraceCheckUtils]: 11: Hoare triple {11111#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {11111#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:33:51,769 INFO L290 TraceCheckUtils]: 12: Hoare triple {11111#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {11111#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:33:51,769 INFO L290 TraceCheckUtils]: 13: Hoare triple {11111#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {11111#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:33:51,769 INFO L290 TraceCheckUtils]: 14: Hoare triple {11111#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {11111#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:33:51,770 INFO L290 TraceCheckUtils]: 15: Hoare triple {11111#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {11111#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:33:51,770 INFO L290 TraceCheckUtils]: 16: Hoare triple {11111#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {11111#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:33:51,770 INFO L290 TraceCheckUtils]: 17: Hoare triple {11111#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {11111#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:33:51,771 INFO L290 TraceCheckUtils]: 18: Hoare triple {11111#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {11112#(= 8464 |ssl3_accept_#t~mem50|)} is VALID [2022-04-28 15:33:51,771 INFO L290 TraceCheckUtils]: 19: Hoare triple {11112#(= 8464 |ssl3_accept_#t~mem50|)} assume 24576 == #t~mem50;havoc #t~mem50; {11107#false} is VALID [2022-04-28 15:33:51,771 INFO L290 TraceCheckUtils]: 20: Hoare triple {11107#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {11107#false} is VALID [2022-04-28 15:33:51,771 INFO L290 TraceCheckUtils]: 21: Hoare triple {11107#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {11107#false} is VALID [2022-04-28 15:33:51,771 INFO L290 TraceCheckUtils]: 22: Hoare triple {11107#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {11107#false} is VALID [2022-04-28 15:33:51,771 INFO L290 TraceCheckUtils]: 23: Hoare triple {11107#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, 80 + ~s.offset, 8); {11107#false} is VALID [2022-04-28 15:33:51,772 INFO L290 TraceCheckUtils]: 24: Hoare triple {11107#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {11107#false} is VALID [2022-04-28 15:33:51,772 INFO L290 TraceCheckUtils]: 25: Hoare triple {11107#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {11107#false} is VALID [2022-04-28 15:33:51,772 INFO L290 TraceCheckUtils]: 26: Hoare triple {11107#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem89 := read~int(#t~mem88.base, 132 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 132 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 72 + ~s.offset, 4); {11107#false} is VALID [2022-04-28 15:33:51,772 INFO L290 TraceCheckUtils]: 27: Hoare triple {11107#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {11107#false} is VALID [2022-04-28 15:33:51,772 INFO L290 TraceCheckUtils]: 28: Hoare triple {11107#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {11107#false} is VALID [2022-04-28 15:33:51,772 INFO L290 TraceCheckUtils]: 29: Hoare triple {11107#false} ~skip~0 := 0; {11107#false} is VALID [2022-04-28 15:33:51,772 INFO L290 TraceCheckUtils]: 30: Hoare triple {11107#false} assume !false; {11107#false} is VALID [2022-04-28 15:33:51,772 INFO L290 TraceCheckUtils]: 31: Hoare triple {11107#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {11107#false} is VALID [2022-04-28 15:33:51,772 INFO L290 TraceCheckUtils]: 32: Hoare triple {11107#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {11107#false} is VALID [2022-04-28 15:33:51,772 INFO L290 TraceCheckUtils]: 33: Hoare triple {11107#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {11107#false} is VALID [2022-04-28 15:33:51,772 INFO L290 TraceCheckUtils]: 34: Hoare triple {11107#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {11107#false} is VALID [2022-04-28 15:33:51,772 INFO L290 TraceCheckUtils]: 35: Hoare triple {11107#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {11107#false} is VALID [2022-04-28 15:33:51,772 INFO L290 TraceCheckUtils]: 36: Hoare triple {11107#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {11107#false} is VALID [2022-04-28 15:33:51,772 INFO L290 TraceCheckUtils]: 37: Hoare triple {11107#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {11107#false} is VALID [2022-04-28 15:33:51,773 INFO L290 TraceCheckUtils]: 38: Hoare triple {11107#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {11107#false} is VALID [2022-04-28 15:33:51,773 INFO L290 TraceCheckUtils]: 39: Hoare triple {11107#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {11107#false} is VALID [2022-04-28 15:33:51,773 INFO L290 TraceCheckUtils]: 40: Hoare triple {11107#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {11107#false} is VALID [2022-04-28 15:33:51,773 INFO L290 TraceCheckUtils]: 41: Hoare triple {11107#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {11107#false} is VALID [2022-04-28 15:33:51,773 INFO L290 TraceCheckUtils]: 42: Hoare triple {11107#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {11107#false} is VALID [2022-04-28 15:33:51,773 INFO L290 TraceCheckUtils]: 43: Hoare triple {11107#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {11107#false} is VALID [2022-04-28 15:33:51,773 INFO L290 TraceCheckUtils]: 44: Hoare triple {11107#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {11107#false} is VALID [2022-04-28 15:33:51,773 INFO L290 TraceCheckUtils]: 45: Hoare triple {11107#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {11107#false} is VALID [2022-04-28 15:33:51,773 INFO L290 TraceCheckUtils]: 46: Hoare triple {11107#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {11107#false} is VALID [2022-04-28 15:33:51,773 INFO L290 TraceCheckUtils]: 47: Hoare triple {11107#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {11107#false} is VALID [2022-04-28 15:33:51,773 INFO L290 TraceCheckUtils]: 48: Hoare triple {11107#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {11107#false} is VALID [2022-04-28 15:33:51,773 INFO L290 TraceCheckUtils]: 49: Hoare triple {11107#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {11107#false} is VALID [2022-04-28 15:33:51,773 INFO L290 TraceCheckUtils]: 50: Hoare triple {11107#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {11107#false} is VALID [2022-04-28 15:33:51,773 INFO L290 TraceCheckUtils]: 51: Hoare triple {11107#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {11107#false} is VALID [2022-04-28 15:33:51,774 INFO L290 TraceCheckUtils]: 52: Hoare triple {11107#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {11107#false} is VALID [2022-04-28 15:33:51,774 INFO L290 TraceCheckUtils]: 53: Hoare triple {11107#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {11107#false} is VALID [2022-04-28 15:33:51,774 INFO L290 TraceCheckUtils]: 54: Hoare triple {11107#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {11107#false} is VALID [2022-04-28 15:33:51,774 INFO L290 TraceCheckUtils]: 55: Hoare triple {11107#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {11107#false} is VALID [2022-04-28 15:33:51,774 INFO L290 TraceCheckUtils]: 56: Hoare triple {11107#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {11107#false} is VALID [2022-04-28 15:33:51,774 INFO L290 TraceCheckUtils]: 57: Hoare triple {11107#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {11107#false} is VALID [2022-04-28 15:33:51,774 INFO L290 TraceCheckUtils]: 58: Hoare triple {11107#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {11107#false} is VALID [2022-04-28 15:33:51,774 INFO L290 TraceCheckUtils]: 59: Hoare triple {11107#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {11107#false} is VALID [2022-04-28 15:33:51,774 INFO L290 TraceCheckUtils]: 60: Hoare triple {11107#false} assume 8640 == #t~mem75;havoc #t~mem75; {11107#false} is VALID [2022-04-28 15:33:51,774 INFO L290 TraceCheckUtils]: 61: Hoare triple {11107#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {11107#false} is VALID [2022-04-28 15:33:51,774 INFO L290 TraceCheckUtils]: 62: Hoare triple {11107#false} assume !(4 == ~blastFlag~0); {11107#false} is VALID [2022-04-28 15:33:51,774 INFO L290 TraceCheckUtils]: 63: Hoare triple {11107#false} assume !(7 == ~blastFlag~0); {11107#false} is VALID [2022-04-28 15:33:51,774 INFO L290 TraceCheckUtils]: 64: Hoare triple {11107#false} assume !(10 == ~blastFlag~0); {11107#false} is VALID [2022-04-28 15:33:51,774 INFO L290 TraceCheckUtils]: 65: Hoare triple {11107#false} assume !false; {11107#false} is VALID [2022-04-28 15:33:51,775 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:33:51,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:33:51,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32558254] [2022-04-28 15:33:51,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32558254] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:33:51,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:33:51,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:33:51,775 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:33:51,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2128864909] [2022-04-28 15:33:51,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2128864909] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:33:51,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:33:51,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:33:51,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357849205] [2022-04-28 15:33:51,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:33:51,776 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-28 15:33:51,776 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:33:51,776 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-28 15:33:51,820 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-28 15:33:51,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:33:51,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:33:51,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:33:51,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:33:51,821 INFO L87 Difference]: Start difference. First operand 174 states and 261 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-28 15:33:59,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:33:59,346 INFO L93 Difference]: Finished difference Result 335 states and 507 transitions. [2022-04-28 15:33:59,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:33:59,346 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-28 15:33:59,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:33:59,347 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-28 15:33:59,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 453 transitions. [2022-04-28 15:33:59,349 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-28 15:33:59,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 453 transitions. [2022-04-28 15:33:59,352 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 453 transitions. [2022-04-28 15:33:59,643 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 453 edges. 453 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:33:59,646 INFO L225 Difference]: With dead ends: 335 [2022-04-28 15:33:59,646 INFO L226 Difference]: Without dead ends: 187 [2022-04-28 15:33:59,646 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-28 15:33:59,647 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 20 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 15:33:59,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 509 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 15:33:59,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-04-28 15:33:59,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 174. [2022-04-28 15:33:59,651 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:33:59,651 INFO L82 GeneralOperation]: Start isEquivalent. First operand 187 states. Second operand has 174 states, 169 states have (on average 1.514792899408284) internal successors, (256), 169 states have internal predecessors, (256), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:33:59,652 INFO L74 IsIncluded]: Start isIncluded. First operand 187 states. Second operand has 174 states, 169 states have (on average 1.514792899408284) internal successors, (256), 169 states have internal predecessors, (256), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:33:59,652 INFO L87 Difference]: Start difference. First operand 187 states. Second operand has 174 states, 169 states have (on average 1.514792899408284) internal successors, (256), 169 states have internal predecessors, (256), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:33:59,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:33:59,654 INFO L93 Difference]: Finished difference Result 187 states and 277 transitions. [2022-04-28 15:33:59,654 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 277 transitions. [2022-04-28 15:33:59,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:33:59,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:33:59,655 INFO L74 IsIncluded]: Start isIncluded. First operand has 174 states, 169 states have (on average 1.514792899408284) internal successors, (256), 169 states have internal predecessors, (256), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 187 states. [2022-04-28 15:33:59,656 INFO L87 Difference]: Start difference. First operand has 174 states, 169 states have (on average 1.514792899408284) internal successors, (256), 169 states have internal predecessors, (256), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 187 states. [2022-04-28 15:33:59,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:33:59,659 INFO L93 Difference]: Finished difference Result 187 states and 277 transitions. [2022-04-28 15:33:59,659 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 277 transitions. [2022-04-28 15:33:59,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:33:59,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:33:59,659 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:33:59,659 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:33:59,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 169 states have (on average 1.514792899408284) internal successors, (256), 169 states have internal predecessors, (256), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:33:59,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 260 transitions. [2022-04-28 15:33:59,667 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 260 transitions. Word has length 66 [2022-04-28 15:33:59,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:33:59,667 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 260 transitions. [2022-04-28 15:33:59,668 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-28 15:33:59,668 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 174 states and 260 transitions. [2022-04-28 15:33:59,865 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 260 edges. 260 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:33:59,866 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 260 transitions. [2022-04-28 15:33:59,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-28 15:33:59,866 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:33:59,866 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:33:59,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-28 15:33:59,866 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:33:59,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:33:59,867 INFO L85 PathProgramCache]: Analyzing trace with hash 943941713, now seen corresponding path program 1 times [2022-04-28 15:33:59,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:33:59,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [872705718] [2022-04-28 15:33:59,885 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 15:33:59,886 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:33:59,886 INFO L85 PathProgramCache]: Analyzing trace with hash 943941713, now seen corresponding path program 2 times [2022-04-28 15:33:59,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:33:59,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670710785] [2022-04-28 15:33:59,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:33:59,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:33:59,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:33:59,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:33:59,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:34:00,001 INFO L290 TraceCheckUtils]: 0: Hoare triple {12517#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {12510#true} is VALID [2022-04-28 15:34:00,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {12510#true} assume true; {12510#true} is VALID [2022-04-28 15:34:00,001 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12510#true} {12510#true} #703#return; {12510#true} is VALID [2022-04-28 15:34:00,002 INFO L272 TraceCheckUtils]: 0: Hoare triple {12510#true} call ULTIMATE.init(); {12517#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-28 15:34:00,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {12517#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {12510#true} is VALID [2022-04-28 15:34:00,002 INFO L290 TraceCheckUtils]: 2: Hoare triple {12510#true} assume true; {12510#true} is VALID [2022-04-28 15:34:00,002 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12510#true} {12510#true} #703#return; {12510#true} is VALID [2022-04-28 15:34:00,002 INFO L272 TraceCheckUtils]: 4: Hoare triple {12510#true} call #t~ret161 := main(); {12510#true} is VALID [2022-04-28 15:34:00,002 INFO L290 TraceCheckUtils]: 5: Hoare triple {12510#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {12510#true} is VALID [2022-04-28 15:34:00,002 INFO L290 TraceCheckUtils]: 6: Hoare triple {12510#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {12510#true} is VALID [2022-04-28 15:34:00,002 INFO L272 TraceCheckUtils]: 7: Hoare triple {12510#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {12510#true} is VALID [2022-04-28 15:34:00,004 INFO L290 TraceCheckUtils]: 8: Hoare triple {12510#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {12515#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:00,005 INFO L290 TraceCheckUtils]: 9: Hoare triple {12515#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {12515#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:00,005 INFO L290 TraceCheckUtils]: 10: Hoare triple {12515#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {12515#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:00,006 INFO L290 TraceCheckUtils]: 11: Hoare triple {12515#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {12515#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:00,006 INFO L290 TraceCheckUtils]: 12: Hoare triple {12515#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {12515#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:00,006 INFO L290 TraceCheckUtils]: 13: Hoare triple {12515#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {12515#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:00,007 INFO L290 TraceCheckUtils]: 14: Hoare triple {12515#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {12515#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:00,007 INFO L290 TraceCheckUtils]: 15: Hoare triple {12515#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {12515#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:00,007 INFO L290 TraceCheckUtils]: 16: Hoare triple {12515#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {12515#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:00,008 INFO L290 TraceCheckUtils]: 17: Hoare triple {12515#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {12515#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:00,008 INFO L290 TraceCheckUtils]: 18: Hoare triple {12515#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {12515#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:00,009 INFO L290 TraceCheckUtils]: 19: Hoare triple {12515#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {12516#(= 8464 |ssl3_accept_#t~mem51|)} is VALID [2022-04-28 15:34:00,009 INFO L290 TraceCheckUtils]: 20: Hoare triple {12516#(= 8464 |ssl3_accept_#t~mem51|)} assume 8195 == #t~mem51;havoc #t~mem51; {12511#false} is VALID [2022-04-28 15:34:00,009 INFO L290 TraceCheckUtils]: 21: Hoare triple {12511#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {12511#false} is VALID [2022-04-28 15:34:00,009 INFO L290 TraceCheckUtils]: 22: Hoare triple {12511#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {12511#false} is VALID [2022-04-28 15:34:00,009 INFO L290 TraceCheckUtils]: 23: Hoare triple {12511#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {12511#false} is VALID [2022-04-28 15:34:00,009 INFO L290 TraceCheckUtils]: 24: Hoare triple {12511#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, 80 + ~s.offset, 8); {12511#false} is VALID [2022-04-28 15:34:00,009 INFO L290 TraceCheckUtils]: 25: Hoare triple {12511#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {12511#false} is VALID [2022-04-28 15:34:00,009 INFO L290 TraceCheckUtils]: 26: Hoare triple {12511#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {12511#false} is VALID [2022-04-28 15:34:00,009 INFO L290 TraceCheckUtils]: 27: Hoare triple {12511#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem89 := read~int(#t~mem88.base, 132 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 132 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 72 + ~s.offset, 4); {12511#false} is VALID [2022-04-28 15:34:00,009 INFO L290 TraceCheckUtils]: 28: Hoare triple {12511#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {12511#false} is VALID [2022-04-28 15:34:00,010 INFO L290 TraceCheckUtils]: 29: Hoare triple {12511#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {12511#false} is VALID [2022-04-28 15:34:00,010 INFO L290 TraceCheckUtils]: 30: Hoare triple {12511#false} ~skip~0 := 0; {12511#false} is VALID [2022-04-28 15:34:00,010 INFO L290 TraceCheckUtils]: 31: Hoare triple {12511#false} assume !false; {12511#false} is VALID [2022-04-28 15:34:00,010 INFO L290 TraceCheckUtils]: 32: Hoare triple {12511#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {12511#false} is VALID [2022-04-28 15:34:00,010 INFO L290 TraceCheckUtils]: 33: Hoare triple {12511#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {12511#false} is VALID [2022-04-28 15:34:00,010 INFO L290 TraceCheckUtils]: 34: Hoare triple {12511#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {12511#false} is VALID [2022-04-28 15:34:00,010 INFO L290 TraceCheckUtils]: 35: Hoare triple {12511#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {12511#false} is VALID [2022-04-28 15:34:00,010 INFO L290 TraceCheckUtils]: 36: Hoare triple {12511#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {12511#false} is VALID [2022-04-28 15:34:00,010 INFO L290 TraceCheckUtils]: 37: Hoare triple {12511#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {12511#false} is VALID [2022-04-28 15:34:00,010 INFO L290 TraceCheckUtils]: 38: Hoare triple {12511#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {12511#false} is VALID [2022-04-28 15:34:00,010 INFO L290 TraceCheckUtils]: 39: Hoare triple {12511#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {12511#false} is VALID [2022-04-28 15:34:00,010 INFO L290 TraceCheckUtils]: 40: Hoare triple {12511#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {12511#false} is VALID [2022-04-28 15:34:00,010 INFO L290 TraceCheckUtils]: 41: Hoare triple {12511#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {12511#false} is VALID [2022-04-28 15:34:00,010 INFO L290 TraceCheckUtils]: 42: Hoare triple {12511#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {12511#false} is VALID [2022-04-28 15:34:00,011 INFO L290 TraceCheckUtils]: 43: Hoare triple {12511#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {12511#false} is VALID [2022-04-28 15:34:00,011 INFO L290 TraceCheckUtils]: 44: Hoare triple {12511#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {12511#false} is VALID [2022-04-28 15:34:00,011 INFO L290 TraceCheckUtils]: 45: Hoare triple {12511#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {12511#false} is VALID [2022-04-28 15:34:00,011 INFO L290 TraceCheckUtils]: 46: Hoare triple {12511#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {12511#false} is VALID [2022-04-28 15:34:00,011 INFO L290 TraceCheckUtils]: 47: Hoare triple {12511#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {12511#false} is VALID [2022-04-28 15:34:00,011 INFO L290 TraceCheckUtils]: 48: Hoare triple {12511#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {12511#false} is VALID [2022-04-28 15:34:00,011 INFO L290 TraceCheckUtils]: 49: Hoare triple {12511#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {12511#false} is VALID [2022-04-28 15:34:00,011 INFO L290 TraceCheckUtils]: 50: Hoare triple {12511#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {12511#false} is VALID [2022-04-28 15:34:00,011 INFO L290 TraceCheckUtils]: 51: Hoare triple {12511#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {12511#false} is VALID [2022-04-28 15:34:00,011 INFO L290 TraceCheckUtils]: 52: Hoare triple {12511#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {12511#false} is VALID [2022-04-28 15:34:00,011 INFO L290 TraceCheckUtils]: 53: Hoare triple {12511#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {12511#false} is VALID [2022-04-28 15:34:00,011 INFO L290 TraceCheckUtils]: 54: Hoare triple {12511#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {12511#false} is VALID [2022-04-28 15:34:00,011 INFO L290 TraceCheckUtils]: 55: Hoare triple {12511#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {12511#false} is VALID [2022-04-28 15:34:00,011 INFO L290 TraceCheckUtils]: 56: Hoare triple {12511#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {12511#false} is VALID [2022-04-28 15:34:00,011 INFO L290 TraceCheckUtils]: 57: Hoare triple {12511#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {12511#false} is VALID [2022-04-28 15:34:00,012 INFO L290 TraceCheckUtils]: 58: Hoare triple {12511#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {12511#false} is VALID [2022-04-28 15:34:00,012 INFO L290 TraceCheckUtils]: 59: Hoare triple {12511#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {12511#false} is VALID [2022-04-28 15:34:00,012 INFO L290 TraceCheckUtils]: 60: Hoare triple {12511#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {12511#false} is VALID [2022-04-28 15:34:00,012 INFO L290 TraceCheckUtils]: 61: Hoare triple {12511#false} assume 8640 == #t~mem75;havoc #t~mem75; {12511#false} is VALID [2022-04-28 15:34:00,012 INFO L290 TraceCheckUtils]: 62: Hoare triple {12511#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {12511#false} is VALID [2022-04-28 15:34:00,012 INFO L290 TraceCheckUtils]: 63: Hoare triple {12511#false} assume !(4 == ~blastFlag~0); {12511#false} is VALID [2022-04-28 15:34:00,012 INFO L290 TraceCheckUtils]: 64: Hoare triple {12511#false} assume !(7 == ~blastFlag~0); {12511#false} is VALID [2022-04-28 15:34:00,012 INFO L290 TraceCheckUtils]: 65: Hoare triple {12511#false} assume !(10 == ~blastFlag~0); {12511#false} is VALID [2022-04-28 15:34:00,012 INFO L290 TraceCheckUtils]: 66: Hoare triple {12511#false} assume !false; {12511#false} is VALID [2022-04-28 15:34:00,012 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:34:00,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:34:00,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670710785] [2022-04-28 15:34:00,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670710785] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:34:00,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:34:00,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:34:00,013 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:34:00,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [872705718] [2022-04-28 15:34:00,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [872705718] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:34:00,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:34:00,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:34:00,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383034021] [2022-04-28 15:34:00,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:34:00,014 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-28 15:34:00,014 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:34:00,014 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-28 15:34:00,062 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-28 15:34:00,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:34:00,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:34:00,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:34:00,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:34:00,063 INFO L87 Difference]: Start difference. First operand 174 states and 260 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-28 15:34:02,082 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:34:02,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:34:02,883 INFO L93 Difference]: Finished difference Result 325 states and 493 transitions. [2022-04-28 15:34:02,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:34:02,883 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-28 15:34:02,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:34:02,883 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-28 15:34:02,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 439 transitions. [2022-04-28 15:34:02,887 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-28 15:34:02,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 439 transitions. [2022-04-28 15:34:02,890 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 439 transitions. [2022-04-28 15:34:03,187 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 439 edges. 439 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:34:03,189 INFO L225 Difference]: With dead ends: 325 [2022-04-28 15:34:03,189 INFO L226 Difference]: Without dead ends: 177 [2022-04-28 15:34:03,190 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-28 15:34:03,190 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 11 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-28 15:34:03,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 523 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 344 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-28 15:34:03,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-04-28 15:34:03,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 174. [2022-04-28 15:34:03,194 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:34:03,195 INFO L82 GeneralOperation]: Start isEquivalent. First operand 177 states. Second operand has 174 states, 169 states have (on average 1.5088757396449703) internal successors, (255), 169 states have internal predecessors, (255), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:03,195 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand has 174 states, 169 states have (on average 1.5088757396449703) internal successors, (255), 169 states have internal predecessors, (255), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:03,195 INFO L87 Difference]: Start difference. First operand 177 states. Second operand has 174 states, 169 states have (on average 1.5088757396449703) internal successors, (255), 169 states have internal predecessors, (255), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:03,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:34:03,198 INFO L93 Difference]: Finished difference Result 177 states and 263 transitions. [2022-04-28 15:34:03,198 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 263 transitions. [2022-04-28 15:34:03,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:34:03,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:34:03,199 INFO L74 IsIncluded]: Start isIncluded. First operand has 174 states, 169 states have (on average 1.5088757396449703) internal successors, (255), 169 states have internal predecessors, (255), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 177 states. [2022-04-28 15:34:03,199 INFO L87 Difference]: Start difference. First operand has 174 states, 169 states have (on average 1.5088757396449703) internal successors, (255), 169 states have internal predecessors, (255), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 177 states. [2022-04-28 15:34:03,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:34:03,202 INFO L93 Difference]: Finished difference Result 177 states and 263 transitions. [2022-04-28 15:34:03,202 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 263 transitions. [2022-04-28 15:34:03,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:34:03,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:34:03,202 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:34:03,202 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:34:03,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 169 states have (on average 1.5088757396449703) internal successors, (255), 169 states have internal predecessors, (255), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:03,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 259 transitions. [2022-04-28 15:34:03,205 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 259 transitions. Word has length 67 [2022-04-28 15:34:03,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:34:03,205 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 259 transitions. [2022-04-28 15:34:03,205 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-28 15:34:03,205 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 174 states and 259 transitions. [2022-04-28 15:34:03,384 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 259 edges. 259 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:34:03,384 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 259 transitions. [2022-04-28 15:34:03,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-28 15:34:03,385 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:34:03,385 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:34:03,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-28 15:34:03,385 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:34:03,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:34:03,385 INFO L85 PathProgramCache]: Analyzing trace with hash -116628358, now seen corresponding path program 1 times [2022-04-28 15:34:03,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:34:03,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2043167030] [2022-04-28 15:34:03,400 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:34:03,401 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:34:03,401 INFO L85 PathProgramCache]: Analyzing trace with hash -116628358, now seen corresponding path program 2 times [2022-04-28 15:34:03,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:34:03,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189917609] [2022-04-28 15:34:03,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:34:03,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:34:03,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:34:03,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:34:03,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:34:03,494 INFO L290 TraceCheckUtils]: 0: Hoare triple {13881#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {13874#true} is VALID [2022-04-28 15:34:03,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {13874#true} assume true; {13874#true} is VALID [2022-04-28 15:34:03,494 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13874#true} {13874#true} #703#return; {13874#true} is VALID [2022-04-28 15:34:03,495 INFO L272 TraceCheckUtils]: 0: Hoare triple {13874#true} call ULTIMATE.init(); {13881#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-28 15:34:03,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {13881#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {13874#true} is VALID [2022-04-28 15:34:03,495 INFO L290 TraceCheckUtils]: 2: Hoare triple {13874#true} assume true; {13874#true} is VALID [2022-04-28 15:34:03,495 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13874#true} {13874#true} #703#return; {13874#true} is VALID [2022-04-28 15:34:03,495 INFO L272 TraceCheckUtils]: 4: Hoare triple {13874#true} call #t~ret161 := main(); {13874#true} is VALID [2022-04-28 15:34:03,495 INFO L290 TraceCheckUtils]: 5: Hoare triple {13874#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {13874#true} is VALID [2022-04-28 15:34:03,495 INFO L290 TraceCheckUtils]: 6: Hoare triple {13874#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {13874#true} is VALID [2022-04-28 15:34:03,495 INFO L272 TraceCheckUtils]: 7: Hoare triple {13874#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {13874#true} is VALID [2022-04-28 15:34:03,495 INFO L290 TraceCheckUtils]: 8: Hoare triple {13874#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {13874#true} is VALID [2022-04-28 15:34:03,495 INFO L290 TraceCheckUtils]: 9: Hoare triple {13874#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {13874#true} is VALID [2022-04-28 15:34:03,495 INFO L290 TraceCheckUtils]: 10: Hoare triple {13874#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {13874#true} is VALID [2022-04-28 15:34:03,495 INFO L290 TraceCheckUtils]: 11: Hoare triple {13874#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {13874#true} is VALID [2022-04-28 15:34:03,496 INFO L290 TraceCheckUtils]: 12: Hoare triple {13874#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {13874#true} is VALID [2022-04-28 15:34:03,496 INFO L290 TraceCheckUtils]: 13: Hoare triple {13874#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {13874#true} is VALID [2022-04-28 15:34:03,496 INFO L290 TraceCheckUtils]: 14: Hoare triple {13874#true} assume !false; {13874#true} is VALID [2022-04-28 15:34:03,496 INFO L290 TraceCheckUtils]: 15: Hoare triple {13874#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {13874#true} is VALID [2022-04-28 15:34:03,496 INFO L290 TraceCheckUtils]: 16: Hoare triple {13874#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {13874#true} is VALID [2022-04-28 15:34:03,496 INFO L290 TraceCheckUtils]: 17: Hoare triple {13874#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {13874#true} is VALID [2022-04-28 15:34:03,496 INFO L290 TraceCheckUtils]: 18: Hoare triple {13874#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {13874#true} is VALID [2022-04-28 15:34:03,496 INFO L290 TraceCheckUtils]: 19: Hoare triple {13874#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {13874#true} is VALID [2022-04-28 15:34:03,496 INFO L290 TraceCheckUtils]: 20: Hoare triple {13874#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {13874#true} is VALID [2022-04-28 15:34:03,496 INFO L290 TraceCheckUtils]: 21: Hoare triple {13874#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {13874#true} is VALID [2022-04-28 15:34:03,496 INFO L290 TraceCheckUtils]: 22: Hoare triple {13874#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {13874#true} is VALID [2022-04-28 15:34:03,496 INFO L290 TraceCheckUtils]: 23: Hoare triple {13874#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {13874#true} is VALID [2022-04-28 15:34:03,496 INFO L290 TraceCheckUtils]: 24: Hoare triple {13874#true} assume 8464 == #t~mem55;havoc #t~mem55; {13874#true} is VALID [2022-04-28 15:34:03,496 INFO L290 TraceCheckUtils]: 25: Hoare triple {13874#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {13874#true} is VALID [2022-04-28 15:34:03,497 INFO L290 TraceCheckUtils]: 26: Hoare triple {13874#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {13874#true} is VALID [2022-04-28 15:34:03,497 INFO L290 TraceCheckUtils]: 27: Hoare triple {13874#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {13879#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:34:03,498 INFO L290 TraceCheckUtils]: 28: Hoare triple {13879#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {13879#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:34:03,498 INFO L290 TraceCheckUtils]: 29: Hoare triple {13879#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {13879#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:34:03,498 INFO L290 TraceCheckUtils]: 30: Hoare triple {13879#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} ~skip~0 := 0; {13879#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:34:03,499 INFO L290 TraceCheckUtils]: 31: Hoare triple {13879#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !false; {13879#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:34:03,499 INFO L290 TraceCheckUtils]: 32: Hoare triple {13879#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {13879#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:34:03,499 INFO L290 TraceCheckUtils]: 33: Hoare triple {13879#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {13879#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:34:03,500 INFO L290 TraceCheckUtils]: 34: Hoare triple {13879#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {13879#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:34:03,500 INFO L290 TraceCheckUtils]: 35: Hoare triple {13879#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {13879#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:34:03,500 INFO L290 TraceCheckUtils]: 36: Hoare triple {13879#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {13879#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:34:03,501 INFO L290 TraceCheckUtils]: 37: Hoare triple {13879#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {13879#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:34:03,501 INFO L290 TraceCheckUtils]: 38: Hoare triple {13879#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {13879#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:34:03,501 INFO L290 TraceCheckUtils]: 39: Hoare triple {13879#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {13879#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:34:03,502 INFO L290 TraceCheckUtils]: 40: Hoare triple {13879#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {13879#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:34:03,502 INFO L290 TraceCheckUtils]: 41: Hoare triple {13879#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {13879#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:34:03,502 INFO L290 TraceCheckUtils]: 42: Hoare triple {13879#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {13879#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:34:03,503 INFO L290 TraceCheckUtils]: 43: Hoare triple {13879#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {13879#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:34:03,503 INFO L290 TraceCheckUtils]: 44: Hoare triple {13879#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {13879#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:34:03,503 INFO L290 TraceCheckUtils]: 45: Hoare triple {13879#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {13879#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:34:03,504 INFO L290 TraceCheckUtils]: 46: Hoare triple {13879#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {13879#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:34:03,504 INFO L290 TraceCheckUtils]: 47: Hoare triple {13879#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {13879#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:34:03,504 INFO L290 TraceCheckUtils]: 48: Hoare triple {13879#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {13879#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:34:03,505 INFO L290 TraceCheckUtils]: 49: Hoare triple {13879#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {13879#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:34:03,505 INFO L290 TraceCheckUtils]: 50: Hoare triple {13879#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {13879#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:34:03,505 INFO L290 TraceCheckUtils]: 51: Hoare triple {13879#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {13879#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:34:03,506 INFO L290 TraceCheckUtils]: 52: Hoare triple {13879#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {13879#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:34:03,506 INFO L290 TraceCheckUtils]: 53: Hoare triple {13879#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {13879#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:34:03,506 INFO L290 TraceCheckUtils]: 54: Hoare triple {13879#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {13879#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:34:03,507 INFO L290 TraceCheckUtils]: 55: Hoare triple {13879#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {13879#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:34:03,507 INFO L290 TraceCheckUtils]: 56: Hoare triple {13879#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {13879#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:34:03,507 INFO L290 TraceCheckUtils]: 57: Hoare triple {13879#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {13879#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:34:03,508 INFO L290 TraceCheckUtils]: 58: Hoare triple {13879#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {13879#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:34:03,508 INFO L290 TraceCheckUtils]: 59: Hoare triple {13879#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {13879#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:34:03,508 INFO L290 TraceCheckUtils]: 60: Hoare triple {13879#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {13880#(not (= |ssl3_accept_#t~mem75| 8640))} is VALID [2022-04-28 15:34:03,509 INFO L290 TraceCheckUtils]: 61: Hoare triple {13880#(not (= |ssl3_accept_#t~mem75| 8640))} assume 8640 == #t~mem75;havoc #t~mem75; {13875#false} is VALID [2022-04-28 15:34:03,509 INFO L290 TraceCheckUtils]: 62: Hoare triple {13875#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {13875#false} is VALID [2022-04-28 15:34:03,509 INFO L290 TraceCheckUtils]: 63: Hoare triple {13875#false} assume !(4 == ~blastFlag~0); {13875#false} is VALID [2022-04-28 15:34:03,509 INFO L290 TraceCheckUtils]: 64: Hoare triple {13875#false} assume !(7 == ~blastFlag~0); {13875#false} is VALID [2022-04-28 15:34:03,509 INFO L290 TraceCheckUtils]: 65: Hoare triple {13875#false} assume !(10 == ~blastFlag~0); {13875#false} is VALID [2022-04-28 15:34:03,509 INFO L290 TraceCheckUtils]: 66: Hoare triple {13875#false} assume !false; {13875#false} is VALID [2022-04-28 15:34:03,509 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:34:03,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:34:03,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189917609] [2022-04-28 15:34:03,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189917609] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:34:03,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:34:03,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:34:03,510 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:34:03,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2043167030] [2022-04-28 15:34:03,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2043167030] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:34:03,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:34:03,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:34:03,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657677343] [2022-04-28 15:34:03,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:34:03,510 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-28 15:34:03,511 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:34:03,511 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-28 15:34:03,559 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-28 15:34:03,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:34:03,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:34:03,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:34:03,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:34:03,560 INFO L87 Difference]: Start difference. First operand 174 states and 259 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-28 15:34:06,120 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:34:11,878 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:34:14,842 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:34:15,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:34:15,943 INFO L93 Difference]: Finished difference Result 440 states and 669 transitions. [2022-04-28 15:34:15,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:34:15,943 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-28 15:34:15,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:34:15,943 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-28 15:34:15,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 604 transitions. [2022-04-28 15:34:15,947 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-28 15:34:15,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 604 transitions. [2022-04-28 15:34:15,949 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 604 transitions. [2022-04-28 15:34:16,350 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 604 edges. 604 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:34:16,354 INFO L225 Difference]: With dead ends: 440 [2022-04-28 15:34:16,355 INFO L226 Difference]: Without dead ends: 292 [2022-04-28 15:34:16,355 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-28 15:34:16,355 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 121 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-04-28 15:34:16,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 366 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2022-04-28 15:34:16,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-04-28 15:34:16,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 214. [2022-04-28 15:34:16,361 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:34:16,362 INFO L82 GeneralOperation]: Start isEquivalent. First operand 292 states. Second operand has 214 states, 209 states have (on average 1.5502392344497609) internal successors, (324), 209 states have internal predecessors, (324), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:16,362 INFO L74 IsIncluded]: Start isIncluded. First operand 292 states. Second operand has 214 states, 209 states have (on average 1.5502392344497609) internal successors, (324), 209 states have internal predecessors, (324), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:16,363 INFO L87 Difference]: Start difference. First operand 292 states. Second operand has 214 states, 209 states have (on average 1.5502392344497609) internal successors, (324), 209 states have internal predecessors, (324), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:16,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:34:16,367 INFO L93 Difference]: Finished difference Result 292 states and 439 transitions. [2022-04-28 15:34:16,368 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 439 transitions. [2022-04-28 15:34:16,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:34:16,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:34:16,368 INFO L74 IsIncluded]: Start isIncluded. First operand has 214 states, 209 states have (on average 1.5502392344497609) internal successors, (324), 209 states have internal predecessors, (324), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 292 states. [2022-04-28 15:34:16,369 INFO L87 Difference]: Start difference. First operand has 214 states, 209 states have (on average 1.5502392344497609) internal successors, (324), 209 states have internal predecessors, (324), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 292 states. [2022-04-28 15:34:16,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:34:16,373 INFO L93 Difference]: Finished difference Result 292 states and 439 transitions. [2022-04-28 15:34:16,373 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 439 transitions. [2022-04-28 15:34:16,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:34:16,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:34:16,373 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:34:16,373 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:34:16,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 209 states have (on average 1.5502392344497609) internal successors, (324), 209 states have internal predecessors, (324), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:16,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 328 transitions. [2022-04-28 15:34:16,378 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 328 transitions. Word has length 67 [2022-04-28 15:34:16,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:34:16,378 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 328 transitions. [2022-04-28 15:34:16,378 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-28 15:34:16,378 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 214 states and 328 transitions. [2022-04-28 15:34:16,607 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 328 edges. 328 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:34:16,607 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 328 transitions. [2022-04-28 15:34:16,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-28 15:34:16,608 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:34:16,608 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:34:16,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-28 15:34:16,608 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:34:16,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:34:16,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1271474916, now seen corresponding path program 1 times [2022-04-28 15:34:16,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:34:16,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [94897650] [2022-04-28 15:34:16,629 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:34:16,629 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:34:16,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1271474916, now seen corresponding path program 2 times [2022-04-28 15:34:16,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:34:16,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531402316] [2022-04-28 15:34:16,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:34:16,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:34:16,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:34:16,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:34:16,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:34:16,776 INFO L290 TraceCheckUtils]: 0: Hoare triple {15785#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {15778#true} is VALID [2022-04-28 15:34:16,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {15778#true} assume true; {15778#true} is VALID [2022-04-28 15:34:16,777 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15778#true} {15778#true} #703#return; {15778#true} is VALID [2022-04-28 15:34:16,777 INFO L272 TraceCheckUtils]: 0: Hoare triple {15778#true} call ULTIMATE.init(); {15785#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-28 15:34:16,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {15785#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {15778#true} is VALID [2022-04-28 15:34:16,777 INFO L290 TraceCheckUtils]: 2: Hoare triple {15778#true} assume true; {15778#true} is VALID [2022-04-28 15:34:16,778 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15778#true} {15778#true} #703#return; {15778#true} is VALID [2022-04-28 15:34:16,778 INFO L272 TraceCheckUtils]: 4: Hoare triple {15778#true} call #t~ret161 := main(); {15778#true} is VALID [2022-04-28 15:34:16,778 INFO L290 TraceCheckUtils]: 5: Hoare triple {15778#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {15778#true} is VALID [2022-04-28 15:34:16,778 INFO L290 TraceCheckUtils]: 6: Hoare triple {15778#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {15778#true} is VALID [2022-04-28 15:34:16,778 INFO L272 TraceCheckUtils]: 7: Hoare triple {15778#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {15778#true} is VALID [2022-04-28 15:34:16,778 INFO L290 TraceCheckUtils]: 8: Hoare triple {15778#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {15778#true} is VALID [2022-04-28 15:34:16,778 INFO L290 TraceCheckUtils]: 9: Hoare triple {15778#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {15778#true} is VALID [2022-04-28 15:34:16,778 INFO L290 TraceCheckUtils]: 10: Hoare triple {15778#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {15778#true} is VALID [2022-04-28 15:34:16,778 INFO L290 TraceCheckUtils]: 11: Hoare triple {15778#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {15778#true} is VALID [2022-04-28 15:34:16,778 INFO L290 TraceCheckUtils]: 12: Hoare triple {15778#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {15778#true} is VALID [2022-04-28 15:34:16,778 INFO L290 TraceCheckUtils]: 13: Hoare triple {15778#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {15778#true} is VALID [2022-04-28 15:34:16,778 INFO L290 TraceCheckUtils]: 14: Hoare triple {15778#true} assume !false; {15778#true} is VALID [2022-04-28 15:34:16,778 INFO L290 TraceCheckUtils]: 15: Hoare triple {15778#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {15778#true} is VALID [2022-04-28 15:34:16,778 INFO L290 TraceCheckUtils]: 16: Hoare triple {15778#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {15778#true} is VALID [2022-04-28 15:34:16,779 INFO L290 TraceCheckUtils]: 17: Hoare triple {15778#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {15778#true} is VALID [2022-04-28 15:34:16,779 INFO L290 TraceCheckUtils]: 18: Hoare triple {15778#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {15778#true} is VALID [2022-04-28 15:34:16,779 INFO L290 TraceCheckUtils]: 19: Hoare triple {15778#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {15778#true} is VALID [2022-04-28 15:34:16,779 INFO L290 TraceCheckUtils]: 20: Hoare triple {15778#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {15778#true} is VALID [2022-04-28 15:34:16,779 INFO L290 TraceCheckUtils]: 21: Hoare triple {15778#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {15778#true} is VALID [2022-04-28 15:34:16,779 INFO L290 TraceCheckUtils]: 22: Hoare triple {15778#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {15778#true} is VALID [2022-04-28 15:34:16,779 INFO L290 TraceCheckUtils]: 23: Hoare triple {15778#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {15778#true} is VALID [2022-04-28 15:34:16,779 INFO L290 TraceCheckUtils]: 24: Hoare triple {15778#true} assume 8464 == #t~mem55;havoc #t~mem55; {15778#true} is VALID [2022-04-28 15:34:16,779 INFO L290 TraceCheckUtils]: 25: Hoare triple {15778#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {15778#true} is VALID [2022-04-28 15:34:16,779 INFO L290 TraceCheckUtils]: 26: Hoare triple {15778#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {15778#true} is VALID [2022-04-28 15:34:16,780 INFO L290 TraceCheckUtils]: 27: Hoare triple {15778#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {15783#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:16,780 INFO L290 TraceCheckUtils]: 28: Hoare triple {15783#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {15783#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:16,781 INFO L290 TraceCheckUtils]: 29: Hoare triple {15783#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {15783#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:16,781 INFO L290 TraceCheckUtils]: 30: Hoare triple {15783#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {15783#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:16,781 INFO L290 TraceCheckUtils]: 31: Hoare triple {15783#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {15783#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:16,782 INFO L290 TraceCheckUtils]: 32: Hoare triple {15783#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {15783#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:16,782 INFO L290 TraceCheckUtils]: 33: Hoare triple {15783#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {15783#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:16,782 INFO L290 TraceCheckUtils]: 34: Hoare triple {15783#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {15783#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:16,783 INFO L290 TraceCheckUtils]: 35: Hoare triple {15783#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {15783#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:16,783 INFO L290 TraceCheckUtils]: 36: Hoare triple {15783#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {15783#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:16,783 INFO L290 TraceCheckUtils]: 37: Hoare triple {15783#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {15783#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:16,784 INFO L290 TraceCheckUtils]: 38: Hoare triple {15783#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {15783#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:16,784 INFO L290 TraceCheckUtils]: 39: Hoare triple {15783#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {15783#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:16,784 INFO L290 TraceCheckUtils]: 40: Hoare triple {15783#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {15783#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:16,785 INFO L290 TraceCheckUtils]: 41: Hoare triple {15783#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {15783#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:16,785 INFO L290 TraceCheckUtils]: 42: Hoare triple {15783#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {15783#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:16,785 INFO L290 TraceCheckUtils]: 43: Hoare triple {15783#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {15784#(= |ssl3_accept_#t~mem58| 8496)} is VALID [2022-04-28 15:34:16,786 INFO L290 TraceCheckUtils]: 44: Hoare triple {15784#(= |ssl3_accept_#t~mem58| 8496)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {15779#false} is VALID [2022-04-28 15:34:16,786 INFO L290 TraceCheckUtils]: 45: Hoare triple {15779#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {15779#false} is VALID [2022-04-28 15:34:16,786 INFO L290 TraceCheckUtils]: 46: Hoare triple {15779#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {15779#false} is VALID [2022-04-28 15:34:16,786 INFO L290 TraceCheckUtils]: 47: Hoare triple {15779#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {15779#false} is VALID [2022-04-28 15:34:16,786 INFO L290 TraceCheckUtils]: 48: Hoare triple {15779#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {15779#false} is VALID [2022-04-28 15:34:16,786 INFO L290 TraceCheckUtils]: 49: Hoare triple {15779#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {15779#false} is VALID [2022-04-28 15:34:16,786 INFO L290 TraceCheckUtils]: 50: Hoare triple {15779#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {15779#false} is VALID [2022-04-28 15:34:16,786 INFO L290 TraceCheckUtils]: 51: Hoare triple {15779#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {15779#false} is VALID [2022-04-28 15:34:16,786 INFO L290 TraceCheckUtils]: 52: Hoare triple {15779#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {15779#false} is VALID [2022-04-28 15:34:16,786 INFO L290 TraceCheckUtils]: 53: Hoare triple {15779#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {15779#false} is VALID [2022-04-28 15:34:16,796 INFO L290 TraceCheckUtils]: 54: Hoare triple {15779#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {15779#false} is VALID [2022-04-28 15:34:16,797 INFO L290 TraceCheckUtils]: 55: Hoare triple {15779#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {15779#false} is VALID [2022-04-28 15:34:16,797 INFO L290 TraceCheckUtils]: 56: Hoare triple {15779#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {15779#false} is VALID [2022-04-28 15:34:16,797 INFO L290 TraceCheckUtils]: 57: Hoare triple {15779#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {15779#false} is VALID [2022-04-28 15:34:16,797 INFO L290 TraceCheckUtils]: 58: Hoare triple {15779#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {15779#false} is VALID [2022-04-28 15:34:16,797 INFO L290 TraceCheckUtils]: 59: Hoare triple {15779#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {15779#false} is VALID [2022-04-28 15:34:16,797 INFO L290 TraceCheckUtils]: 60: Hoare triple {15779#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {15779#false} is VALID [2022-04-28 15:34:16,797 INFO L290 TraceCheckUtils]: 61: Hoare triple {15779#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {15779#false} is VALID [2022-04-28 15:34:16,797 INFO L290 TraceCheckUtils]: 62: Hoare triple {15779#false} assume 8641 == #t~mem76;havoc #t~mem76; {15779#false} is VALID [2022-04-28 15:34:16,797 INFO L290 TraceCheckUtils]: 63: Hoare triple {15779#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {15779#false} is VALID [2022-04-28 15:34:16,797 INFO L290 TraceCheckUtils]: 64: Hoare triple {15779#false} assume !(4 == ~blastFlag~0); {15779#false} is VALID [2022-04-28 15:34:16,797 INFO L290 TraceCheckUtils]: 65: Hoare triple {15779#false} assume !(7 == ~blastFlag~0); {15779#false} is VALID [2022-04-28 15:34:16,797 INFO L290 TraceCheckUtils]: 66: Hoare triple {15779#false} assume !(10 == ~blastFlag~0); {15779#false} is VALID [2022-04-28 15:34:16,798 INFO L290 TraceCheckUtils]: 67: Hoare triple {15779#false} assume !false; {15779#false} is VALID [2022-04-28 15:34:16,798 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:34:16,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:34:16,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531402316] [2022-04-28 15:34:16,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531402316] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:34:16,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:34:16,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:34:16,798 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:34:16,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [94897650] [2022-04-28 15:34:16,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [94897650] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:34:16,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:34:16,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:34:16,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556643045] [2022-04-28 15:34:16,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:34:16,799 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-28 15:34:16,799 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:34:16,799 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:16,840 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:34:16,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:34:16,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:34:16,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:34:16,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:34:16,842 INFO L87 Difference]: Start difference. First operand 214 states and 328 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:18,806 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:34:20,501 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:34:25,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:34:25,668 INFO L93 Difference]: Finished difference Result 443 states and 686 transitions. [2022-04-28 15:34:25,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:34:25,669 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-28 15:34:25,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:34:25,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:25,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 483 transitions. [2022-04-28 15:34:25,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:25,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 483 transitions. [2022-04-28 15:34:25,673 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 483 transitions. [2022-04-28 15:34:25,971 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 483 edges. 483 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:34:25,975 INFO L225 Difference]: With dead ends: 443 [2022-04-28 15:34:25,975 INFO L226 Difference]: Without dead ends: 255 [2022-04-28 15:34:25,976 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-28 15:34:25,976 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 30 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-04-28 15:34:25,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 525 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-04-28 15:34:25,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-04-28 15:34:25,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 236. [2022-04-28 15:34:25,993 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:34:25,994 INFO L82 GeneralOperation]: Start isEquivalent. First operand 255 states. Second operand has 236 states, 231 states have (on average 1.5497835497835497) internal successors, (358), 231 states have internal predecessors, (358), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:25,994 INFO L74 IsIncluded]: Start isIncluded. First operand 255 states. Second operand has 236 states, 231 states have (on average 1.5497835497835497) internal successors, (358), 231 states have internal predecessors, (358), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:25,994 INFO L87 Difference]: Start difference. First operand 255 states. Second operand has 236 states, 231 states have (on average 1.5497835497835497) internal successors, (358), 231 states have internal predecessors, (358), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:25,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:34:25,997 INFO L93 Difference]: Finished difference Result 255 states and 387 transitions. [2022-04-28 15:34:25,997 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 387 transitions. [2022-04-28 15:34:25,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:34:25,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:34:25,998 INFO L74 IsIncluded]: Start isIncluded. First operand has 236 states, 231 states have (on average 1.5497835497835497) internal successors, (358), 231 states have internal predecessors, (358), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 255 states. [2022-04-28 15:34:25,999 INFO L87 Difference]: Start difference. First operand has 236 states, 231 states have (on average 1.5497835497835497) internal successors, (358), 231 states have internal predecessors, (358), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 255 states. [2022-04-28 15:34:26,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:34:26,002 INFO L93 Difference]: Finished difference Result 255 states and 387 transitions. [2022-04-28 15:34:26,002 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 387 transitions. [2022-04-28 15:34:26,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:34:26,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:34:26,003 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:34:26,003 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:34:26,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 231 states have (on average 1.5497835497835497) internal successors, (358), 231 states have internal predecessors, (358), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:26,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 362 transitions. [2022-04-28 15:34:26,007 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 362 transitions. Word has length 68 [2022-04-28 15:34:26,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:34:26,007 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 362 transitions. [2022-04-28 15:34:26,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:26,007 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 236 states and 362 transitions. [2022-04-28 15:34:26,263 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 362 edges. 362 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:34:26,264 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 362 transitions. [2022-04-28 15:34:26,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-28 15:34:26,264 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:34:26,265 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:34:26,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-28 15:34:26,265 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:34:26,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:34:26,266 INFO L85 PathProgramCache]: Analyzing trace with hash 282286594, now seen corresponding path program 1 times [2022-04-28 15:34:26,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:34:26,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [363110423] [2022-04-28 15:34:26,309 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:34:26,309 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:34:26,309 INFO L85 PathProgramCache]: Analyzing trace with hash 282286594, now seen corresponding path program 2 times [2022-04-28 15:34:26,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:34:26,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116812832] [2022-04-28 15:34:26,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:34:26,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:34:26,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:34:26,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:34:26,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:34:26,451 INFO L290 TraceCheckUtils]: 0: Hoare triple {17665#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {17658#true} is VALID [2022-04-28 15:34:26,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {17658#true} assume true; {17658#true} is VALID [2022-04-28 15:34:26,452 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17658#true} {17658#true} #703#return; {17658#true} is VALID [2022-04-28 15:34:26,452 INFO L272 TraceCheckUtils]: 0: Hoare triple {17658#true} call ULTIMATE.init(); {17665#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-28 15:34:26,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {17665#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {17658#true} is VALID [2022-04-28 15:34:26,452 INFO L290 TraceCheckUtils]: 2: Hoare triple {17658#true} assume true; {17658#true} is VALID [2022-04-28 15:34:26,452 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17658#true} {17658#true} #703#return; {17658#true} is VALID [2022-04-28 15:34:26,453 INFO L272 TraceCheckUtils]: 4: Hoare triple {17658#true} call #t~ret161 := main(); {17658#true} is VALID [2022-04-28 15:34:26,453 INFO L290 TraceCheckUtils]: 5: Hoare triple {17658#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {17658#true} is VALID [2022-04-28 15:34:26,453 INFO L290 TraceCheckUtils]: 6: Hoare triple {17658#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {17658#true} is VALID [2022-04-28 15:34:26,453 INFO L272 TraceCheckUtils]: 7: Hoare triple {17658#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {17658#true} is VALID [2022-04-28 15:34:26,453 INFO L290 TraceCheckUtils]: 8: Hoare triple {17658#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {17658#true} is VALID [2022-04-28 15:34:26,453 INFO L290 TraceCheckUtils]: 9: Hoare triple {17658#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {17658#true} is VALID [2022-04-28 15:34:26,453 INFO L290 TraceCheckUtils]: 10: Hoare triple {17658#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {17658#true} is VALID [2022-04-28 15:34:26,453 INFO L290 TraceCheckUtils]: 11: Hoare triple {17658#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {17658#true} is VALID [2022-04-28 15:34:26,453 INFO L290 TraceCheckUtils]: 12: Hoare triple {17658#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {17658#true} is VALID [2022-04-28 15:34:26,453 INFO L290 TraceCheckUtils]: 13: Hoare triple {17658#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {17658#true} is VALID [2022-04-28 15:34:26,453 INFO L290 TraceCheckUtils]: 14: Hoare triple {17658#true} assume !false; {17658#true} is VALID [2022-04-28 15:34:26,453 INFO L290 TraceCheckUtils]: 15: Hoare triple {17658#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {17658#true} is VALID [2022-04-28 15:34:26,453 INFO L290 TraceCheckUtils]: 16: Hoare triple {17658#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {17658#true} is VALID [2022-04-28 15:34:26,453 INFO L290 TraceCheckUtils]: 17: Hoare triple {17658#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {17658#true} is VALID [2022-04-28 15:34:26,454 INFO L290 TraceCheckUtils]: 18: Hoare triple {17658#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {17658#true} is VALID [2022-04-28 15:34:26,454 INFO L290 TraceCheckUtils]: 19: Hoare triple {17658#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {17658#true} is VALID [2022-04-28 15:34:26,454 INFO L290 TraceCheckUtils]: 20: Hoare triple {17658#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {17658#true} is VALID [2022-04-28 15:34:26,454 INFO L290 TraceCheckUtils]: 21: Hoare triple {17658#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {17658#true} is VALID [2022-04-28 15:34:26,454 INFO L290 TraceCheckUtils]: 22: Hoare triple {17658#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {17658#true} is VALID [2022-04-28 15:34:26,454 INFO L290 TraceCheckUtils]: 23: Hoare triple {17658#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {17658#true} is VALID [2022-04-28 15:34:26,454 INFO L290 TraceCheckUtils]: 24: Hoare triple {17658#true} assume 8464 == #t~mem55;havoc #t~mem55; {17658#true} is VALID [2022-04-28 15:34:26,454 INFO L290 TraceCheckUtils]: 25: Hoare triple {17658#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {17658#true} is VALID [2022-04-28 15:34:26,454 INFO L290 TraceCheckUtils]: 26: Hoare triple {17658#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {17658#true} is VALID [2022-04-28 15:34:26,455 INFO L290 TraceCheckUtils]: 27: Hoare triple {17658#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {17663#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:26,455 INFO L290 TraceCheckUtils]: 28: Hoare triple {17663#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {17663#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:26,456 INFO L290 TraceCheckUtils]: 29: Hoare triple {17663#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {17663#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:26,456 INFO L290 TraceCheckUtils]: 30: Hoare triple {17663#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {17663#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:26,456 INFO L290 TraceCheckUtils]: 31: Hoare triple {17663#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {17663#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:26,457 INFO L290 TraceCheckUtils]: 32: Hoare triple {17663#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {17663#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:26,457 INFO L290 TraceCheckUtils]: 33: Hoare triple {17663#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {17663#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:26,457 INFO L290 TraceCheckUtils]: 34: Hoare triple {17663#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {17663#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:26,458 INFO L290 TraceCheckUtils]: 35: Hoare triple {17663#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {17663#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:26,458 INFO L290 TraceCheckUtils]: 36: Hoare triple {17663#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {17663#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:26,458 INFO L290 TraceCheckUtils]: 37: Hoare triple {17663#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {17664#(= |ssl3_accept_#t~mem52| 8496)} is VALID [2022-04-28 15:34:26,458 INFO L290 TraceCheckUtils]: 38: Hoare triple {17664#(= |ssl3_accept_#t~mem52| 8496)} assume 8480 == #t~mem52;havoc #t~mem52; {17659#false} is VALID [2022-04-28 15:34:26,459 INFO L290 TraceCheckUtils]: 39: Hoare triple {17659#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {17659#false} is VALID [2022-04-28 15:34:26,459 INFO L290 TraceCheckUtils]: 40: Hoare triple {17659#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8482, #t~mem91.base, 904 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {17659#false} is VALID [2022-04-28 15:34:26,459 INFO L290 TraceCheckUtils]: 41: Hoare triple {17659#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {17659#false} is VALID [2022-04-28 15:34:26,459 INFO L290 TraceCheckUtils]: 42: Hoare triple {17659#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {17659#false} is VALID [2022-04-28 15:34:26,459 INFO L290 TraceCheckUtils]: 43: Hoare triple {17659#false} ~skip~0 := 0; {17659#false} is VALID [2022-04-28 15:34:26,459 INFO L290 TraceCheckUtils]: 44: Hoare triple {17659#false} assume !false; {17659#false} is VALID [2022-04-28 15:34:26,459 INFO L290 TraceCheckUtils]: 45: Hoare triple {17659#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {17659#false} is VALID [2022-04-28 15:34:26,459 INFO L290 TraceCheckUtils]: 46: Hoare triple {17659#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {17659#false} is VALID [2022-04-28 15:34:26,459 INFO L290 TraceCheckUtils]: 47: Hoare triple {17659#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {17659#false} is VALID [2022-04-28 15:34:26,459 INFO L290 TraceCheckUtils]: 48: Hoare triple {17659#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {17659#false} is VALID [2022-04-28 15:34:26,459 INFO L290 TraceCheckUtils]: 49: Hoare triple {17659#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {17659#false} is VALID [2022-04-28 15:34:26,459 INFO L290 TraceCheckUtils]: 50: Hoare triple {17659#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {17659#false} is VALID [2022-04-28 15:34:26,459 INFO L290 TraceCheckUtils]: 51: Hoare triple {17659#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {17659#false} is VALID [2022-04-28 15:34:26,459 INFO L290 TraceCheckUtils]: 52: Hoare triple {17659#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {17659#false} is VALID [2022-04-28 15:34:26,460 INFO L290 TraceCheckUtils]: 53: Hoare triple {17659#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {17659#false} is VALID [2022-04-28 15:34:26,460 INFO L290 TraceCheckUtils]: 54: Hoare triple {17659#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {17659#false} is VALID [2022-04-28 15:34:26,460 INFO L290 TraceCheckUtils]: 55: Hoare triple {17659#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {17659#false} is VALID [2022-04-28 15:34:26,460 INFO L290 TraceCheckUtils]: 56: Hoare triple {17659#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {17659#false} is VALID [2022-04-28 15:34:26,460 INFO L290 TraceCheckUtils]: 57: Hoare triple {17659#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {17659#false} is VALID [2022-04-28 15:34:26,460 INFO L290 TraceCheckUtils]: 58: Hoare triple {17659#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {17659#false} is VALID [2022-04-28 15:34:26,460 INFO L290 TraceCheckUtils]: 59: Hoare triple {17659#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {17659#false} is VALID [2022-04-28 15:34:26,460 INFO L290 TraceCheckUtils]: 60: Hoare triple {17659#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {17659#false} is VALID [2022-04-28 15:34:26,460 INFO L290 TraceCheckUtils]: 61: Hoare triple {17659#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {17659#false} is VALID [2022-04-28 15:34:26,460 INFO L290 TraceCheckUtils]: 62: Hoare triple {17659#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {17659#false} is VALID [2022-04-28 15:34:26,460 INFO L290 TraceCheckUtils]: 63: Hoare triple {17659#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {17659#false} is VALID [2022-04-28 15:34:26,460 INFO L290 TraceCheckUtils]: 64: Hoare triple {17659#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {17659#false} is VALID [2022-04-28 15:34:26,460 INFO L290 TraceCheckUtils]: 65: Hoare triple {17659#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {17659#false} is VALID [2022-04-28 15:34:26,460 INFO L290 TraceCheckUtils]: 66: Hoare triple {17659#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {17659#false} is VALID [2022-04-28 15:34:26,460 INFO L290 TraceCheckUtils]: 67: Hoare triple {17659#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {17659#false} is VALID [2022-04-28 15:34:26,461 INFO L290 TraceCheckUtils]: 68: Hoare triple {17659#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {17659#false} is VALID [2022-04-28 15:34:26,461 INFO L290 TraceCheckUtils]: 69: Hoare triple {17659#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {17659#false} is VALID [2022-04-28 15:34:26,461 INFO L290 TraceCheckUtils]: 70: Hoare triple {17659#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {17659#false} is VALID [2022-04-28 15:34:26,461 INFO L290 TraceCheckUtils]: 71: Hoare triple {17659#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {17659#false} is VALID [2022-04-28 15:34:26,461 INFO L290 TraceCheckUtils]: 72: Hoare triple {17659#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {17659#false} is VALID [2022-04-28 15:34:26,461 INFO L290 TraceCheckUtils]: 73: Hoare triple {17659#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {17659#false} is VALID [2022-04-28 15:34:26,461 INFO L290 TraceCheckUtils]: 74: Hoare triple {17659#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {17659#false} is VALID [2022-04-28 15:34:26,467 INFO L290 TraceCheckUtils]: 75: Hoare triple {17659#false} assume 8641 == #t~mem76;havoc #t~mem76; {17659#false} is VALID [2022-04-28 15:34:26,467 INFO L290 TraceCheckUtils]: 76: Hoare triple {17659#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {17659#false} is VALID [2022-04-28 15:34:26,467 INFO L290 TraceCheckUtils]: 77: Hoare triple {17659#false} assume !(4 == ~blastFlag~0); {17659#false} is VALID [2022-04-28 15:34:26,467 INFO L290 TraceCheckUtils]: 78: Hoare triple {17659#false} assume !(7 == ~blastFlag~0); {17659#false} is VALID [2022-04-28 15:34:26,467 INFO L290 TraceCheckUtils]: 79: Hoare triple {17659#false} assume !(10 == ~blastFlag~0); {17659#false} is VALID [2022-04-28 15:34:26,468 INFO L290 TraceCheckUtils]: 80: Hoare triple {17659#false} assume !false; {17659#false} is VALID [2022-04-28 15:34:26,468 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:34:26,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:34:26,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116812832] [2022-04-28 15:34:26,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116812832] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:34:26,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:34:26,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:34:26,468 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:34:26,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [363110423] [2022-04-28 15:34:26,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [363110423] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:34:26,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:34:26,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:34:26,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447210334] [2022-04-28 15:34:26,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:34:26,469 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 81 [2022-04-28 15:34:26,469 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:34:26,469 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-28 15:34:26,516 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-28 15:34:26,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:34:26,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:34:26,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:34:26,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:34:26,517 INFO L87 Difference]: Start difference. First operand 236 states and 362 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-28 15:34:30,122 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:34:32,150 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:34:34,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:34:34,578 INFO L93 Difference]: Finished difference Result 463 states and 717 transitions. [2022-04-28 15:34:34,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:34:34,578 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 81 [2022-04-28 15:34:34,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:34:34,578 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-28 15:34:34,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 480 transitions. [2022-04-28 15:34:34,581 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-28 15:34:34,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 480 transitions. [2022-04-28 15:34:34,583 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 480 transitions. [2022-04-28 15:34:34,914 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 480 edges. 480 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:34:34,917 INFO L225 Difference]: With dead ends: 463 [2022-04-28 15:34:34,917 INFO L226 Difference]: Without dead ends: 253 [2022-04-28 15:34:34,918 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-28 15:34:34,918 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 35 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 9 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:34:34,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 529 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 393 Invalid, 2 Unknown, 0 Unchecked, 5.4s Time] [2022-04-28 15:34:34,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-04-28 15:34:34,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 236. [2022-04-28 15:34:34,924 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:34:34,925 INFO L82 GeneralOperation]: Start isEquivalent. First operand 253 states. Second operand has 236 states, 231 states have (on average 1.5454545454545454) internal successors, (357), 231 states have internal predecessors, (357), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:34,925 INFO L74 IsIncluded]: Start isIncluded. First operand 253 states. Second operand has 236 states, 231 states have (on average 1.5454545454545454) internal successors, (357), 231 states have internal predecessors, (357), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:34,925 INFO L87 Difference]: Start difference. First operand 253 states. Second operand has 236 states, 231 states have (on average 1.5454545454545454) internal successors, (357), 231 states have internal predecessors, (357), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:34,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:34:34,928 INFO L93 Difference]: Finished difference Result 253 states and 384 transitions. [2022-04-28 15:34:34,928 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 384 transitions. [2022-04-28 15:34:34,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:34:34,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:34:34,929 INFO L74 IsIncluded]: Start isIncluded. First operand has 236 states, 231 states have (on average 1.5454545454545454) internal successors, (357), 231 states have internal predecessors, (357), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 253 states. [2022-04-28 15:34:34,934 INFO L87 Difference]: Start difference. First operand has 236 states, 231 states have (on average 1.5454545454545454) internal successors, (357), 231 states have internal predecessors, (357), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 253 states. [2022-04-28 15:34:34,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:34:34,937 INFO L93 Difference]: Finished difference Result 253 states and 384 transitions. [2022-04-28 15:34:34,937 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 384 transitions. [2022-04-28 15:34:34,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:34:34,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:34:34,938 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:34:34,938 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:34:34,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 231 states have (on average 1.5454545454545454) internal successors, (357), 231 states have internal predecessors, (357), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:34,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 361 transitions. [2022-04-28 15:34:34,941 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 361 transitions. Word has length 81 [2022-04-28 15:34:34,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:34:34,942 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 361 transitions. [2022-04-28 15:34:34,942 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-28 15:34:34,942 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 236 states and 361 transitions. [2022-04-28 15:34:35,194 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 361 edges. 361 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:34:35,194 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 361 transitions. [2022-04-28 15:34:35,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-28 15:34:35,195 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:34:35,195 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:34:35,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-28 15:34:35,195 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:34:35,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:34:35,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1209106617, now seen corresponding path program 1 times [2022-04-28 15:34:35,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:34:35,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1515837896] [2022-04-28 15:34:35,252 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:34:35,252 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:34:35,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1209106617, now seen corresponding path program 2 times [2022-04-28 15:34:35,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:34:35,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232723992] [2022-04-28 15:34:35,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:34:35,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:34:35,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:34:35,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:34:35,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:34:35,356 INFO L290 TraceCheckUtils]: 0: Hoare triple {19581#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {19574#true} is VALID [2022-04-28 15:34:35,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {19574#true} assume true; {19574#true} is VALID [2022-04-28 15:34:35,356 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19574#true} {19574#true} #703#return; {19574#true} is VALID [2022-04-28 15:34:35,357 INFO L272 TraceCheckUtils]: 0: Hoare triple {19574#true} call ULTIMATE.init(); {19581#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-28 15:34:35,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {19581#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {19574#true} is VALID [2022-04-28 15:34:35,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {19574#true} assume true; {19574#true} is VALID [2022-04-28 15:34:35,357 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19574#true} {19574#true} #703#return; {19574#true} is VALID [2022-04-28 15:34:35,357 INFO L272 TraceCheckUtils]: 4: Hoare triple {19574#true} call #t~ret161 := main(); {19574#true} is VALID [2022-04-28 15:34:35,357 INFO L290 TraceCheckUtils]: 5: Hoare triple {19574#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {19574#true} is VALID [2022-04-28 15:34:35,358 INFO L290 TraceCheckUtils]: 6: Hoare triple {19574#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {19574#true} is VALID [2022-04-28 15:34:35,358 INFO L272 TraceCheckUtils]: 7: Hoare triple {19574#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {19574#true} is VALID [2022-04-28 15:34:35,358 INFO L290 TraceCheckUtils]: 8: Hoare triple {19574#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {19574#true} is VALID [2022-04-28 15:34:35,358 INFO L290 TraceCheckUtils]: 9: Hoare triple {19574#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {19574#true} is VALID [2022-04-28 15:34:35,358 INFO L290 TraceCheckUtils]: 10: Hoare triple {19574#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {19574#true} is VALID [2022-04-28 15:34:35,358 INFO L290 TraceCheckUtils]: 11: Hoare triple {19574#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {19574#true} is VALID [2022-04-28 15:34:35,358 INFO L290 TraceCheckUtils]: 12: Hoare triple {19574#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {19574#true} is VALID [2022-04-28 15:34:35,358 INFO L290 TraceCheckUtils]: 13: Hoare triple {19574#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {19574#true} is VALID [2022-04-28 15:34:35,358 INFO L290 TraceCheckUtils]: 14: Hoare triple {19574#true} assume !false; {19574#true} is VALID [2022-04-28 15:34:35,358 INFO L290 TraceCheckUtils]: 15: Hoare triple {19574#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {19574#true} is VALID [2022-04-28 15:34:35,358 INFO L290 TraceCheckUtils]: 16: Hoare triple {19574#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {19574#true} is VALID [2022-04-28 15:34:35,358 INFO L290 TraceCheckUtils]: 17: Hoare triple {19574#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {19574#true} is VALID [2022-04-28 15:34:35,358 INFO L290 TraceCheckUtils]: 18: Hoare triple {19574#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {19574#true} is VALID [2022-04-28 15:34:35,358 INFO L290 TraceCheckUtils]: 19: Hoare triple {19574#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {19574#true} is VALID [2022-04-28 15:34:35,359 INFO L290 TraceCheckUtils]: 20: Hoare triple {19574#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {19574#true} is VALID [2022-04-28 15:34:35,359 INFO L290 TraceCheckUtils]: 21: Hoare triple {19574#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {19574#true} is VALID [2022-04-28 15:34:35,359 INFO L290 TraceCheckUtils]: 22: Hoare triple {19574#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {19574#true} is VALID [2022-04-28 15:34:35,359 INFO L290 TraceCheckUtils]: 23: Hoare triple {19574#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {19574#true} is VALID [2022-04-28 15:34:35,359 INFO L290 TraceCheckUtils]: 24: Hoare triple {19574#true} assume 8464 == #t~mem55;havoc #t~mem55; {19574#true} is VALID [2022-04-28 15:34:35,359 INFO L290 TraceCheckUtils]: 25: Hoare triple {19574#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {19574#true} is VALID [2022-04-28 15:34:35,359 INFO L290 TraceCheckUtils]: 26: Hoare triple {19574#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {19574#true} is VALID [2022-04-28 15:34:35,359 INFO L290 TraceCheckUtils]: 27: Hoare triple {19574#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {19574#true} is VALID [2022-04-28 15:34:35,359 INFO L290 TraceCheckUtils]: 28: Hoare triple {19574#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {19574#true} is VALID [2022-04-28 15:34:35,359 INFO L290 TraceCheckUtils]: 29: Hoare triple {19574#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {19574#true} is VALID [2022-04-28 15:34:35,359 INFO L290 TraceCheckUtils]: 30: Hoare triple {19574#true} ~skip~0 := 0; {19574#true} is VALID [2022-04-28 15:34:35,359 INFO L290 TraceCheckUtils]: 31: Hoare triple {19574#true} assume !false; {19574#true} is VALID [2022-04-28 15:34:35,359 INFO L290 TraceCheckUtils]: 32: Hoare triple {19574#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {19574#true} is VALID [2022-04-28 15:34:35,359 INFO L290 TraceCheckUtils]: 33: Hoare triple {19574#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {19574#true} is VALID [2022-04-28 15:34:35,359 INFO L290 TraceCheckUtils]: 34: Hoare triple {19574#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {19574#true} is VALID [2022-04-28 15:34:35,360 INFO L290 TraceCheckUtils]: 35: Hoare triple {19574#true} assume 8192 == #t~mem49;havoc #t~mem49; {19574#true} is VALID [2022-04-28 15:34:35,360 INFO L290 TraceCheckUtils]: 36: Hoare triple {19574#true} call write~int(1, ~s.base, 56 + ~s.offset, 4); {19574#true} is VALID [2022-04-28 15:34:35,360 INFO L290 TraceCheckUtils]: 37: Hoare triple {19574#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {19574#true} is VALID [2022-04-28 15:34:35,360 INFO L290 TraceCheckUtils]: 38: Hoare triple {19574#true} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {19574#true} is VALID [2022-04-28 15:34:35,360 INFO L290 TraceCheckUtils]: 39: Hoare triple {19574#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, 80 + ~s.offset, 8); {19574#true} is VALID [2022-04-28 15:34:35,360 INFO L290 TraceCheckUtils]: 40: Hoare triple {19574#true} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {19574#true} is VALID [2022-04-28 15:34:35,360 INFO L290 TraceCheckUtils]: 41: Hoare triple {19574#true} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {19574#true} is VALID [2022-04-28 15:34:35,361 INFO L290 TraceCheckUtils]: 42: Hoare triple {19574#true} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem89 := read~int(#t~mem88.base, 132 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 132 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 72 + ~s.offset, 4); {19579#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:34:35,361 INFO L290 TraceCheckUtils]: 43: Hoare triple {19579#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {19579#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:34:35,362 INFO L290 TraceCheckUtils]: 44: Hoare triple {19579#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {19579#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:34:35,362 INFO L290 TraceCheckUtils]: 45: Hoare triple {19579#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} ~skip~0 := 0; {19579#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:34:35,362 INFO L290 TraceCheckUtils]: 46: Hoare triple {19579#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !false; {19579#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:34:35,363 INFO L290 TraceCheckUtils]: 47: Hoare triple {19579#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {19579#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:34:35,363 INFO L290 TraceCheckUtils]: 48: Hoare triple {19579#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {19579#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:34:35,363 INFO L290 TraceCheckUtils]: 49: Hoare triple {19579#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {19579#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:34:35,364 INFO L290 TraceCheckUtils]: 50: Hoare triple {19579#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {19579#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:34:35,364 INFO L290 TraceCheckUtils]: 51: Hoare triple {19579#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {19579#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:34:35,364 INFO L290 TraceCheckUtils]: 52: Hoare triple {19579#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {19580#(= |ssl3_accept_#t~mem52| 8480)} is VALID [2022-04-28 15:34:35,365 INFO L290 TraceCheckUtils]: 53: Hoare triple {19580#(= |ssl3_accept_#t~mem52| 8480)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {19575#false} is VALID [2022-04-28 15:34:35,365 INFO L290 TraceCheckUtils]: 54: Hoare triple {19575#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {19575#false} is VALID [2022-04-28 15:34:35,365 INFO L290 TraceCheckUtils]: 55: Hoare triple {19575#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {19575#false} is VALID [2022-04-28 15:34:35,365 INFO L290 TraceCheckUtils]: 56: Hoare triple {19575#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {19575#false} is VALID [2022-04-28 15:34:35,365 INFO L290 TraceCheckUtils]: 57: Hoare triple {19575#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {19575#false} is VALID [2022-04-28 15:34:35,365 INFO L290 TraceCheckUtils]: 58: Hoare triple {19575#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {19575#false} is VALID [2022-04-28 15:34:35,365 INFO L290 TraceCheckUtils]: 59: Hoare triple {19575#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {19575#false} is VALID [2022-04-28 15:34:35,365 INFO L290 TraceCheckUtils]: 60: Hoare triple {19575#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {19575#false} is VALID [2022-04-28 15:34:35,365 INFO L290 TraceCheckUtils]: 61: Hoare triple {19575#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {19575#false} is VALID [2022-04-28 15:34:35,365 INFO L290 TraceCheckUtils]: 62: Hoare triple {19575#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {19575#false} is VALID [2022-04-28 15:34:35,365 INFO L290 TraceCheckUtils]: 63: Hoare triple {19575#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {19575#false} is VALID [2022-04-28 15:34:35,365 INFO L290 TraceCheckUtils]: 64: Hoare triple {19575#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {19575#false} is VALID [2022-04-28 15:34:35,365 INFO L290 TraceCheckUtils]: 65: Hoare triple {19575#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {19575#false} is VALID [2022-04-28 15:34:35,366 INFO L290 TraceCheckUtils]: 66: Hoare triple {19575#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {19575#false} is VALID [2022-04-28 15:34:35,366 INFO L290 TraceCheckUtils]: 67: Hoare triple {19575#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {19575#false} is VALID [2022-04-28 15:34:35,366 INFO L290 TraceCheckUtils]: 68: Hoare triple {19575#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {19575#false} is VALID [2022-04-28 15:34:35,366 INFO L290 TraceCheckUtils]: 69: Hoare triple {19575#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {19575#false} is VALID [2022-04-28 15:34:35,366 INFO L290 TraceCheckUtils]: 70: Hoare triple {19575#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {19575#false} is VALID [2022-04-28 15:34:35,366 INFO L290 TraceCheckUtils]: 71: Hoare triple {19575#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {19575#false} is VALID [2022-04-28 15:34:35,366 INFO L290 TraceCheckUtils]: 72: Hoare triple {19575#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {19575#false} is VALID [2022-04-28 15:34:35,366 INFO L290 TraceCheckUtils]: 73: Hoare triple {19575#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {19575#false} is VALID [2022-04-28 15:34:35,366 INFO L290 TraceCheckUtils]: 74: Hoare triple {19575#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {19575#false} is VALID [2022-04-28 15:34:35,366 INFO L290 TraceCheckUtils]: 75: Hoare triple {19575#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {19575#false} is VALID [2022-04-28 15:34:35,366 INFO L290 TraceCheckUtils]: 76: Hoare triple {19575#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {19575#false} is VALID [2022-04-28 15:34:35,366 INFO L290 TraceCheckUtils]: 77: Hoare triple {19575#false} assume 8641 == #t~mem76;havoc #t~mem76; {19575#false} is VALID [2022-04-28 15:34:35,366 INFO L290 TraceCheckUtils]: 78: Hoare triple {19575#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {19575#false} is VALID [2022-04-28 15:34:35,366 INFO L290 TraceCheckUtils]: 79: Hoare triple {19575#false} assume !(4 == ~blastFlag~0); {19575#false} is VALID [2022-04-28 15:34:35,367 INFO L290 TraceCheckUtils]: 80: Hoare triple {19575#false} assume !(7 == ~blastFlag~0); {19575#false} is VALID [2022-04-28 15:34:35,367 INFO L290 TraceCheckUtils]: 81: Hoare triple {19575#false} assume !(10 == ~blastFlag~0); {19575#false} is VALID [2022-04-28 15:34:35,367 INFO L290 TraceCheckUtils]: 82: Hoare triple {19575#false} assume !false; {19575#false} is VALID [2022-04-28 15:34:35,367 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-28 15:34:35,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:34:35,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232723992] [2022-04-28 15:34:35,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232723992] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:34:35,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:34:35,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:34:35,367 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:34:35,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1515837896] [2022-04-28 15:34:35,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1515837896] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:34:35,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:34:35,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:34:35,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867677645] [2022-04-28 15:34:35,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:34:35,369 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 83 [2022-04-28 15:34:35,369 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:34:35,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:35,415 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:34:35,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:34:35,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:34:35,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:34:35,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:34:35,416 INFO L87 Difference]: Start difference. First operand 236 states and 361 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:37,436 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:34:38,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:34:38,428 INFO L93 Difference]: Finished difference Result 474 states and 732 transitions. [2022-04-28 15:34:38,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:34:38,428 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 83 [2022-04-28 15:34:38,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:34:38,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:38,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 463 transitions. [2022-04-28 15:34:38,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:38,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 463 transitions. [2022-04-28 15:34:38,432 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 463 transitions. [2022-04-28 15:34:38,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 463 edges. 463 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:34:38,624 INFO L225 Difference]: With dead ends: 474 [2022-04-28 15:34:38,625 INFO L226 Difference]: Without dead ends: 264 [2022-04-28 15:34:38,625 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-28 15:34:38,626 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 20 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:34:38,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 588 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 396 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 15:34:38,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-04-28 15:34:38,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 252. [2022-04-28 15:34:38,632 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:34:38,633 INFO L82 GeneralOperation]: Start isEquivalent. First operand 264 states. Second operand has 252 states, 247 states have (on average 1.54251012145749) internal successors, (381), 247 states have internal predecessors, (381), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:38,633 INFO L74 IsIncluded]: Start isIncluded. First operand 264 states. Second operand has 252 states, 247 states have (on average 1.54251012145749) internal successors, (381), 247 states have internal predecessors, (381), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:38,634 INFO L87 Difference]: Start difference. First operand 264 states. Second operand has 252 states, 247 states have (on average 1.54251012145749) internal successors, (381), 247 states have internal predecessors, (381), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:38,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:34:38,637 INFO L93 Difference]: Finished difference Result 264 states and 400 transitions. [2022-04-28 15:34:38,637 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 400 transitions. [2022-04-28 15:34:38,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:34:38,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:34:38,638 INFO L74 IsIncluded]: Start isIncluded. First operand has 252 states, 247 states have (on average 1.54251012145749) internal successors, (381), 247 states have internal predecessors, (381), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 264 states. [2022-04-28 15:34:38,638 INFO L87 Difference]: Start difference. First operand has 252 states, 247 states have (on average 1.54251012145749) internal successors, (381), 247 states have internal predecessors, (381), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 264 states. [2022-04-28 15:34:38,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:34:38,641 INFO L93 Difference]: Finished difference Result 264 states and 400 transitions. [2022-04-28 15:34:38,641 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 400 transitions. [2022-04-28 15:34:38,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:34:38,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:34:38,642 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:34:38,642 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:34:38,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 247 states have (on average 1.54251012145749) internal successors, (381), 247 states have internal predecessors, (381), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:38,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 385 transitions. [2022-04-28 15:34:38,645 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 385 transitions. Word has length 83 [2022-04-28 15:34:38,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:34:38,646 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 385 transitions. [2022-04-28 15:34:38,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:38,646 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 252 states and 385 transitions. [2022-04-28 15:34:38,854 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 385 edges. 385 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:34:38,854 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 385 transitions. [2022-04-28 15:34:38,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-28 15:34:38,854 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:34:38,854 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:34:38,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-28 15:34:38,855 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:34:38,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:34:38,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1885868468, now seen corresponding path program 1 times [2022-04-28 15:34:38,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:34:38,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [332857903] [2022-04-28 15:34:38,880 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:34:38,881 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:34:38,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1885868468, now seen corresponding path program 2 times [2022-04-28 15:34:38,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:34:38,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802532395] [2022-04-28 15:34:38,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:34:38,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:34:38,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:34:38,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:34:38,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:34:38,992 INFO L290 TraceCheckUtils]: 0: Hoare triple {21573#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {21566#true} is VALID [2022-04-28 15:34:38,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {21566#true} assume true; {21566#true} is VALID [2022-04-28 15:34:38,992 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21566#true} {21566#true} #703#return; {21566#true} is VALID [2022-04-28 15:34:38,993 INFO L272 TraceCheckUtils]: 0: Hoare triple {21566#true} call ULTIMATE.init(); {21573#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-28 15:34:38,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {21573#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {21566#true} is VALID [2022-04-28 15:34:38,993 INFO L290 TraceCheckUtils]: 2: Hoare triple {21566#true} assume true; {21566#true} is VALID [2022-04-28 15:34:38,993 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21566#true} {21566#true} #703#return; {21566#true} is VALID [2022-04-28 15:34:38,993 INFO L272 TraceCheckUtils]: 4: Hoare triple {21566#true} call #t~ret161 := main(); {21566#true} is VALID [2022-04-28 15:34:38,993 INFO L290 TraceCheckUtils]: 5: Hoare triple {21566#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {21566#true} is VALID [2022-04-28 15:34:38,993 INFO L290 TraceCheckUtils]: 6: Hoare triple {21566#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {21566#true} is VALID [2022-04-28 15:34:38,993 INFO L272 TraceCheckUtils]: 7: Hoare triple {21566#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {21566#true} is VALID [2022-04-28 15:34:38,993 INFO L290 TraceCheckUtils]: 8: Hoare triple {21566#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {21566#true} is VALID [2022-04-28 15:34:38,994 INFO L290 TraceCheckUtils]: 9: Hoare triple {21566#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {21566#true} is VALID [2022-04-28 15:34:38,994 INFO L290 TraceCheckUtils]: 10: Hoare triple {21566#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {21566#true} is VALID [2022-04-28 15:34:38,994 INFO L290 TraceCheckUtils]: 11: Hoare triple {21566#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {21566#true} is VALID [2022-04-28 15:34:38,994 INFO L290 TraceCheckUtils]: 12: Hoare triple {21566#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {21566#true} is VALID [2022-04-28 15:34:38,994 INFO L290 TraceCheckUtils]: 13: Hoare triple {21566#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {21566#true} is VALID [2022-04-28 15:34:38,994 INFO L290 TraceCheckUtils]: 14: Hoare triple {21566#true} assume !false; {21566#true} is VALID [2022-04-28 15:34:38,994 INFO L290 TraceCheckUtils]: 15: Hoare triple {21566#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {21566#true} is VALID [2022-04-28 15:34:38,994 INFO L290 TraceCheckUtils]: 16: Hoare triple {21566#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {21566#true} is VALID [2022-04-28 15:34:38,994 INFO L290 TraceCheckUtils]: 17: Hoare triple {21566#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {21566#true} is VALID [2022-04-28 15:34:38,994 INFO L290 TraceCheckUtils]: 18: Hoare triple {21566#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {21566#true} is VALID [2022-04-28 15:34:38,994 INFO L290 TraceCheckUtils]: 19: Hoare triple {21566#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {21566#true} is VALID [2022-04-28 15:34:38,994 INFO L290 TraceCheckUtils]: 20: Hoare triple {21566#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {21566#true} is VALID [2022-04-28 15:34:38,994 INFO L290 TraceCheckUtils]: 21: Hoare triple {21566#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {21566#true} is VALID [2022-04-28 15:34:38,994 INFO L290 TraceCheckUtils]: 22: Hoare triple {21566#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {21566#true} is VALID [2022-04-28 15:34:38,994 INFO L290 TraceCheckUtils]: 23: Hoare triple {21566#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {21566#true} is VALID [2022-04-28 15:34:38,995 INFO L290 TraceCheckUtils]: 24: Hoare triple {21566#true} assume 8464 == #t~mem55;havoc #t~mem55; {21566#true} is VALID [2022-04-28 15:34:38,995 INFO L290 TraceCheckUtils]: 25: Hoare triple {21566#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {21566#true} is VALID [2022-04-28 15:34:38,995 INFO L290 TraceCheckUtils]: 26: Hoare triple {21566#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {21566#true} is VALID [2022-04-28 15:34:38,996 INFO L290 TraceCheckUtils]: 27: Hoare triple {21566#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {21571#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:34:38,996 INFO L290 TraceCheckUtils]: 28: Hoare triple {21571#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {21571#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:34:38,996 INFO L290 TraceCheckUtils]: 29: Hoare triple {21571#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {21571#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:34:38,997 INFO L290 TraceCheckUtils]: 30: Hoare triple {21571#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} ~skip~0 := 0; {21571#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:34:38,997 INFO L290 TraceCheckUtils]: 31: Hoare triple {21571#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {21571#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:34:38,997 INFO L290 TraceCheckUtils]: 32: Hoare triple {21571#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {21571#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:34:38,997 INFO L290 TraceCheckUtils]: 33: Hoare triple {21571#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {21571#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:34:38,998 INFO L290 TraceCheckUtils]: 34: Hoare triple {21571#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {21572#(not (= 8192 |ssl3_accept_#t~mem49|))} is VALID [2022-04-28 15:34:38,998 INFO L290 TraceCheckUtils]: 35: Hoare triple {21572#(not (= 8192 |ssl3_accept_#t~mem49|))} assume 8192 == #t~mem49;havoc #t~mem49; {21567#false} is VALID [2022-04-28 15:34:38,998 INFO L290 TraceCheckUtils]: 36: Hoare triple {21567#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {21567#false} is VALID [2022-04-28 15:34:38,998 INFO L290 TraceCheckUtils]: 37: Hoare triple {21567#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {21567#false} is VALID [2022-04-28 15:34:38,998 INFO L290 TraceCheckUtils]: 38: Hoare triple {21567#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {21567#false} is VALID [2022-04-28 15:34:38,998 INFO L290 TraceCheckUtils]: 39: Hoare triple {21567#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, 80 + ~s.offset, 8); {21567#false} is VALID [2022-04-28 15:34:38,998 INFO L290 TraceCheckUtils]: 40: Hoare triple {21567#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {21567#false} is VALID [2022-04-28 15:34:38,998 INFO L290 TraceCheckUtils]: 41: Hoare triple {21567#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {21567#false} is VALID [2022-04-28 15:34:38,998 INFO L290 TraceCheckUtils]: 42: Hoare triple {21567#false} assume 12292 != #t~mem85;havoc #t~mem85; {21567#false} is VALID [2022-04-28 15:34:38,999 INFO L290 TraceCheckUtils]: 43: Hoare triple {21567#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 72 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem87 := read~int(#t~mem86.base, 128 + #t~mem86.offset, 4);call write~int(1 + #t~mem87, #t~mem86.base, 128 + #t~mem86.offset, 4);havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87; {21567#false} is VALID [2022-04-28 15:34:38,999 INFO L290 TraceCheckUtils]: 44: Hoare triple {21567#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {21567#false} is VALID [2022-04-28 15:34:38,999 INFO L290 TraceCheckUtils]: 45: Hoare triple {21567#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {21567#false} is VALID [2022-04-28 15:34:38,999 INFO L290 TraceCheckUtils]: 46: Hoare triple {21567#false} ~skip~0 := 0; {21567#false} is VALID [2022-04-28 15:34:38,999 INFO L290 TraceCheckUtils]: 47: Hoare triple {21567#false} assume !false; {21567#false} is VALID [2022-04-28 15:34:38,999 INFO L290 TraceCheckUtils]: 48: Hoare triple {21567#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {21567#false} is VALID [2022-04-28 15:34:38,999 INFO L290 TraceCheckUtils]: 49: Hoare triple {21567#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {21567#false} is VALID [2022-04-28 15:34:38,999 INFO L290 TraceCheckUtils]: 50: Hoare triple {21567#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {21567#false} is VALID [2022-04-28 15:34:38,999 INFO L290 TraceCheckUtils]: 51: Hoare triple {21567#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {21567#false} is VALID [2022-04-28 15:34:38,999 INFO L290 TraceCheckUtils]: 52: Hoare triple {21567#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {21567#false} is VALID [2022-04-28 15:34:38,999 INFO L290 TraceCheckUtils]: 53: Hoare triple {21567#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {21567#false} is VALID [2022-04-28 15:34:38,999 INFO L290 TraceCheckUtils]: 54: Hoare triple {21567#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {21567#false} is VALID [2022-04-28 15:34:38,999 INFO L290 TraceCheckUtils]: 55: Hoare triple {21567#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {21567#false} is VALID [2022-04-28 15:34:38,999 INFO L290 TraceCheckUtils]: 56: Hoare triple {21567#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {21567#false} is VALID [2022-04-28 15:34:38,999 INFO L290 TraceCheckUtils]: 57: Hoare triple {21567#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {21567#false} is VALID [2022-04-28 15:34:39,000 INFO L290 TraceCheckUtils]: 58: Hoare triple {21567#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {21567#false} is VALID [2022-04-28 15:34:39,000 INFO L290 TraceCheckUtils]: 59: Hoare triple {21567#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {21567#false} is VALID [2022-04-28 15:34:39,000 INFO L290 TraceCheckUtils]: 60: Hoare triple {21567#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {21567#false} is VALID [2022-04-28 15:34:39,000 INFO L290 TraceCheckUtils]: 61: Hoare triple {21567#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {21567#false} is VALID [2022-04-28 15:34:39,000 INFO L290 TraceCheckUtils]: 62: Hoare triple {21567#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {21567#false} is VALID [2022-04-28 15:34:39,000 INFO L290 TraceCheckUtils]: 63: Hoare triple {21567#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {21567#false} is VALID [2022-04-28 15:34:39,000 INFO L290 TraceCheckUtils]: 64: Hoare triple {21567#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {21567#false} is VALID [2022-04-28 15:34:39,000 INFO L290 TraceCheckUtils]: 65: Hoare triple {21567#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {21567#false} is VALID [2022-04-28 15:34:39,000 INFO L290 TraceCheckUtils]: 66: Hoare triple {21567#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {21567#false} is VALID [2022-04-28 15:34:39,000 INFO L290 TraceCheckUtils]: 67: Hoare triple {21567#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {21567#false} is VALID [2022-04-28 15:34:39,000 INFO L290 TraceCheckUtils]: 68: Hoare triple {21567#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {21567#false} is VALID [2022-04-28 15:34:39,000 INFO L290 TraceCheckUtils]: 69: Hoare triple {21567#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {21567#false} is VALID [2022-04-28 15:34:39,000 INFO L290 TraceCheckUtils]: 70: Hoare triple {21567#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {21567#false} is VALID [2022-04-28 15:34:39,000 INFO L290 TraceCheckUtils]: 71: Hoare triple {21567#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {21567#false} is VALID [2022-04-28 15:34:39,001 INFO L290 TraceCheckUtils]: 72: Hoare triple {21567#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {21567#false} is VALID [2022-04-28 15:34:39,001 INFO L290 TraceCheckUtils]: 73: Hoare triple {21567#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {21567#false} is VALID [2022-04-28 15:34:39,001 INFO L290 TraceCheckUtils]: 74: Hoare triple {21567#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {21567#false} is VALID [2022-04-28 15:34:39,001 INFO L290 TraceCheckUtils]: 75: Hoare triple {21567#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {21567#false} is VALID [2022-04-28 15:34:39,001 INFO L290 TraceCheckUtils]: 76: Hoare triple {21567#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {21567#false} is VALID [2022-04-28 15:34:39,001 INFO L290 TraceCheckUtils]: 77: Hoare triple {21567#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {21567#false} is VALID [2022-04-28 15:34:39,001 INFO L290 TraceCheckUtils]: 78: Hoare triple {21567#false} assume 8641 == #t~mem76;havoc #t~mem76; {21567#false} is VALID [2022-04-28 15:34:39,001 INFO L290 TraceCheckUtils]: 79: Hoare triple {21567#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {21567#false} is VALID [2022-04-28 15:34:39,001 INFO L290 TraceCheckUtils]: 80: Hoare triple {21567#false} assume !(4 == ~blastFlag~0); {21567#false} is VALID [2022-04-28 15:34:39,001 INFO L290 TraceCheckUtils]: 81: Hoare triple {21567#false} assume !(7 == ~blastFlag~0); {21567#false} is VALID [2022-04-28 15:34:39,001 INFO L290 TraceCheckUtils]: 82: Hoare triple {21567#false} assume !(10 == ~blastFlag~0); {21567#false} is VALID [2022-04-28 15:34:39,001 INFO L290 TraceCheckUtils]: 83: Hoare triple {21567#false} assume !false; {21567#false} is VALID [2022-04-28 15:34:39,002 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:34:39,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:34:39,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802532395] [2022-04-28 15:34:39,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802532395] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:34:39,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:34:39,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:34:39,002 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:34:39,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [332857903] [2022-04-28 15:34:39,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [332857903] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:34:39,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:34:39,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:34:39,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729236626] [2022-04-28 15:34:39,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:34:39,003 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2022-04-28 15:34:39,003 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:34:39,003 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-28 15:34:39,058 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-28 15:34:39,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:34:39,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:34:39,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:34:39,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:34:39,060 INFO L87 Difference]: Start difference. First operand 252 states and 385 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-28 15:34:40,980 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:34:44,111 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:34:46,115 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:34:48,142 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:34:49,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:34:49,271 INFO L93 Difference]: Finished difference Result 577 states and 893 transitions. [2022-04-28 15:34:49,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:34:49,271 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2022-04-28 15:34:49,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:34:49,271 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-28 15:34:49,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 603 transitions. [2022-04-28 15:34:49,273 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-28 15:34:49,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 603 transitions. [2022-04-28 15:34:49,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 603 transitions. [2022-04-28 15:34:49,657 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 603 edges. 603 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:34:49,663 INFO L225 Difference]: With dead ends: 577 [2022-04-28 15:34:49,663 INFO L226 Difference]: Without dead ends: 351 [2022-04-28 15:34:49,663 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-28 15:34:49,664 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 147 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 62 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-04-28 15:34:49,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 366 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 478 Invalid, 2 Unknown, 0 Unchecked, 6.9s Time] [2022-04-28 15:34:49,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-04-28 15:34:49,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 252. [2022-04-28 15:34:49,693 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:34:49,693 INFO L82 GeneralOperation]: Start isEquivalent. First operand 351 states. Second operand has 252 states, 247 states have (on average 1.5263157894736843) internal successors, (377), 247 states have internal predecessors, (377), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:49,693 INFO L74 IsIncluded]: Start isIncluded. First operand 351 states. Second operand has 252 states, 247 states have (on average 1.5263157894736843) internal successors, (377), 247 states have internal predecessors, (377), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:49,693 INFO L87 Difference]: Start difference. First operand 351 states. Second operand has 252 states, 247 states have (on average 1.5263157894736843) internal successors, (377), 247 states have internal predecessors, (377), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:49,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:34:49,698 INFO L93 Difference]: Finished difference Result 351 states and 534 transitions. [2022-04-28 15:34:49,698 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 534 transitions. [2022-04-28 15:34:49,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:34:49,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:34:49,699 INFO L74 IsIncluded]: Start isIncluded. First operand has 252 states, 247 states have (on average 1.5263157894736843) internal successors, (377), 247 states have internal predecessors, (377), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 351 states. [2022-04-28 15:34:49,699 INFO L87 Difference]: Start difference. First operand has 252 states, 247 states have (on average 1.5263157894736843) internal successors, (377), 247 states have internal predecessors, (377), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 351 states. [2022-04-28 15:34:49,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:34:49,721 INFO L93 Difference]: Finished difference Result 351 states and 534 transitions. [2022-04-28 15:34:49,721 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 534 transitions. [2022-04-28 15:34:49,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:34:49,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:34:49,722 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:34:49,722 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:34:49,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 247 states have (on average 1.5263157894736843) internal successors, (377), 247 states have internal predecessors, (377), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:49,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 381 transitions. [2022-04-28 15:34:49,726 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 381 transitions. Word has length 84 [2022-04-28 15:34:49,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:34:49,726 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 381 transitions. [2022-04-28 15:34:49,726 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-28 15:34:49,726 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 252 states and 381 transitions. [2022-04-28 15:34:49,997 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 381 edges. 381 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:34:49,997 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 381 transitions. [2022-04-28 15:34:49,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-28 15:34:49,998 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:34:49,998 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:34:49,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-28 15:34:49,998 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:34:49,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:34:49,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1140288054, now seen corresponding path program 1 times [2022-04-28 15:34:49,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:34:49,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [604494691] [2022-04-28 15:34:50,040 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:34:50,040 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:34:50,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1140288054, now seen corresponding path program 2 times [2022-04-28 15:34:50,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:34:50,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31730950] [2022-04-28 15:34:50,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:34:50,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:34:50,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:34:50,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:34:50,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:34:50,148 INFO L290 TraceCheckUtils]: 0: Hoare triple {23945#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {23938#true} is VALID [2022-04-28 15:34:50,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {23938#true} assume true; {23938#true} is VALID [2022-04-28 15:34:50,149 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23938#true} {23938#true} #703#return; {23938#true} is VALID [2022-04-28 15:34:50,149 INFO L272 TraceCheckUtils]: 0: Hoare triple {23938#true} call ULTIMATE.init(); {23945#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-28 15:34:50,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {23945#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {23938#true} is VALID [2022-04-28 15:34:50,150 INFO L290 TraceCheckUtils]: 2: Hoare triple {23938#true} assume true; {23938#true} is VALID [2022-04-28 15:34:50,150 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23938#true} {23938#true} #703#return; {23938#true} is VALID [2022-04-28 15:34:50,150 INFO L272 TraceCheckUtils]: 4: Hoare triple {23938#true} call #t~ret161 := main(); {23938#true} is VALID [2022-04-28 15:34:50,150 INFO L290 TraceCheckUtils]: 5: Hoare triple {23938#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {23938#true} is VALID [2022-04-28 15:34:50,150 INFO L290 TraceCheckUtils]: 6: Hoare triple {23938#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {23938#true} is VALID [2022-04-28 15:34:50,150 INFO L272 TraceCheckUtils]: 7: Hoare triple {23938#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {23938#true} is VALID [2022-04-28 15:34:50,150 INFO L290 TraceCheckUtils]: 8: Hoare triple {23938#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {23938#true} is VALID [2022-04-28 15:34:50,150 INFO L290 TraceCheckUtils]: 9: Hoare triple {23938#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {23938#true} is VALID [2022-04-28 15:34:50,150 INFO L290 TraceCheckUtils]: 10: Hoare triple {23938#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {23938#true} is VALID [2022-04-28 15:34:50,150 INFO L290 TraceCheckUtils]: 11: Hoare triple {23938#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {23938#true} is VALID [2022-04-28 15:34:50,150 INFO L290 TraceCheckUtils]: 12: Hoare triple {23938#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {23938#true} is VALID [2022-04-28 15:34:50,150 INFO L290 TraceCheckUtils]: 13: Hoare triple {23938#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {23938#true} is VALID [2022-04-28 15:34:50,150 INFO L290 TraceCheckUtils]: 14: Hoare triple {23938#true} assume !false; {23938#true} is VALID [2022-04-28 15:34:50,150 INFO L290 TraceCheckUtils]: 15: Hoare triple {23938#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {23938#true} is VALID [2022-04-28 15:34:50,151 INFO L290 TraceCheckUtils]: 16: Hoare triple {23938#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {23938#true} is VALID [2022-04-28 15:34:50,151 INFO L290 TraceCheckUtils]: 17: Hoare triple {23938#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {23938#true} is VALID [2022-04-28 15:34:50,151 INFO L290 TraceCheckUtils]: 18: Hoare triple {23938#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {23938#true} is VALID [2022-04-28 15:34:50,151 INFO L290 TraceCheckUtils]: 19: Hoare triple {23938#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {23938#true} is VALID [2022-04-28 15:34:50,151 INFO L290 TraceCheckUtils]: 20: Hoare triple {23938#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {23938#true} is VALID [2022-04-28 15:34:50,151 INFO L290 TraceCheckUtils]: 21: Hoare triple {23938#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {23938#true} is VALID [2022-04-28 15:34:50,151 INFO L290 TraceCheckUtils]: 22: Hoare triple {23938#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {23938#true} is VALID [2022-04-28 15:34:50,151 INFO L290 TraceCheckUtils]: 23: Hoare triple {23938#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {23938#true} is VALID [2022-04-28 15:34:50,151 INFO L290 TraceCheckUtils]: 24: Hoare triple {23938#true} assume 8464 == #t~mem55;havoc #t~mem55; {23938#true} is VALID [2022-04-28 15:34:50,151 INFO L290 TraceCheckUtils]: 25: Hoare triple {23938#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {23938#true} is VALID [2022-04-28 15:34:50,151 INFO L290 TraceCheckUtils]: 26: Hoare triple {23938#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {23938#true} is VALID [2022-04-28 15:34:50,152 INFO L290 TraceCheckUtils]: 27: Hoare triple {23938#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {23943#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:50,153 INFO L290 TraceCheckUtils]: 28: Hoare triple {23943#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {23943#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:50,153 INFO L290 TraceCheckUtils]: 29: Hoare triple {23943#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {23943#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:50,153 INFO L290 TraceCheckUtils]: 30: Hoare triple {23943#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {23943#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:50,153 INFO L290 TraceCheckUtils]: 31: Hoare triple {23943#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {23943#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:50,154 INFO L290 TraceCheckUtils]: 32: Hoare triple {23943#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {23943#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:50,154 INFO L290 TraceCheckUtils]: 33: Hoare triple {23943#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {23943#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:50,155 INFO L290 TraceCheckUtils]: 34: Hoare triple {23943#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {23943#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:50,155 INFO L290 TraceCheckUtils]: 35: Hoare triple {23943#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {23944#(= |ssl3_accept_#t~mem50| 8496)} is VALID [2022-04-28 15:34:50,155 INFO L290 TraceCheckUtils]: 36: Hoare triple {23944#(= |ssl3_accept_#t~mem50| 8496)} assume 24576 == #t~mem50;havoc #t~mem50; {23939#false} is VALID [2022-04-28 15:34:50,155 INFO L290 TraceCheckUtils]: 37: Hoare triple {23939#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {23939#false} is VALID [2022-04-28 15:34:50,155 INFO L290 TraceCheckUtils]: 38: Hoare triple {23939#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {23939#false} is VALID [2022-04-28 15:34:50,155 INFO L290 TraceCheckUtils]: 39: Hoare triple {23939#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {23939#false} is VALID [2022-04-28 15:34:50,155 INFO L290 TraceCheckUtils]: 40: Hoare triple {23939#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, 80 + ~s.offset, 8); {23939#false} is VALID [2022-04-28 15:34:50,156 INFO L290 TraceCheckUtils]: 41: Hoare triple {23939#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {23939#false} is VALID [2022-04-28 15:34:50,156 INFO L290 TraceCheckUtils]: 42: Hoare triple {23939#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {23939#false} is VALID [2022-04-28 15:34:50,156 INFO L290 TraceCheckUtils]: 43: Hoare triple {23939#false} assume 12292 != #t~mem85;havoc #t~mem85; {23939#false} is VALID [2022-04-28 15:34:50,156 INFO L290 TraceCheckUtils]: 44: Hoare triple {23939#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 72 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem87 := read~int(#t~mem86.base, 128 + #t~mem86.offset, 4);call write~int(1 + #t~mem87, #t~mem86.base, 128 + #t~mem86.offset, 4);havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87; {23939#false} is VALID [2022-04-28 15:34:50,156 INFO L290 TraceCheckUtils]: 45: Hoare triple {23939#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {23939#false} is VALID [2022-04-28 15:34:50,156 INFO L290 TraceCheckUtils]: 46: Hoare triple {23939#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {23939#false} is VALID [2022-04-28 15:34:50,156 INFO L290 TraceCheckUtils]: 47: Hoare triple {23939#false} ~skip~0 := 0; {23939#false} is VALID [2022-04-28 15:34:50,156 INFO L290 TraceCheckUtils]: 48: Hoare triple {23939#false} assume !false; {23939#false} is VALID [2022-04-28 15:34:50,156 INFO L290 TraceCheckUtils]: 49: Hoare triple {23939#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {23939#false} is VALID [2022-04-28 15:34:50,156 INFO L290 TraceCheckUtils]: 50: Hoare triple {23939#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {23939#false} is VALID [2022-04-28 15:34:50,156 INFO L290 TraceCheckUtils]: 51: Hoare triple {23939#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {23939#false} is VALID [2022-04-28 15:34:50,156 INFO L290 TraceCheckUtils]: 52: Hoare triple {23939#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {23939#false} is VALID [2022-04-28 15:34:50,156 INFO L290 TraceCheckUtils]: 53: Hoare triple {23939#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {23939#false} is VALID [2022-04-28 15:34:50,156 INFO L290 TraceCheckUtils]: 54: Hoare triple {23939#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {23939#false} is VALID [2022-04-28 15:34:50,157 INFO L290 TraceCheckUtils]: 55: Hoare triple {23939#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {23939#false} is VALID [2022-04-28 15:34:50,157 INFO L290 TraceCheckUtils]: 56: Hoare triple {23939#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {23939#false} is VALID [2022-04-28 15:34:50,157 INFO L290 TraceCheckUtils]: 57: Hoare triple {23939#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {23939#false} is VALID [2022-04-28 15:34:50,157 INFO L290 TraceCheckUtils]: 58: Hoare triple {23939#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {23939#false} is VALID [2022-04-28 15:34:50,157 INFO L290 TraceCheckUtils]: 59: Hoare triple {23939#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {23939#false} is VALID [2022-04-28 15:34:50,157 INFO L290 TraceCheckUtils]: 60: Hoare triple {23939#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {23939#false} is VALID [2022-04-28 15:34:50,157 INFO L290 TraceCheckUtils]: 61: Hoare triple {23939#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {23939#false} is VALID [2022-04-28 15:34:50,157 INFO L290 TraceCheckUtils]: 62: Hoare triple {23939#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {23939#false} is VALID [2022-04-28 15:34:50,157 INFO L290 TraceCheckUtils]: 63: Hoare triple {23939#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {23939#false} is VALID [2022-04-28 15:34:50,157 INFO L290 TraceCheckUtils]: 64: Hoare triple {23939#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {23939#false} is VALID [2022-04-28 15:34:50,157 INFO L290 TraceCheckUtils]: 65: Hoare triple {23939#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {23939#false} is VALID [2022-04-28 15:34:50,157 INFO L290 TraceCheckUtils]: 66: Hoare triple {23939#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {23939#false} is VALID [2022-04-28 15:34:50,157 INFO L290 TraceCheckUtils]: 67: Hoare triple {23939#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {23939#false} is VALID [2022-04-28 15:34:50,157 INFO L290 TraceCheckUtils]: 68: Hoare triple {23939#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {23939#false} is VALID [2022-04-28 15:34:50,157 INFO L290 TraceCheckUtils]: 69: Hoare triple {23939#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {23939#false} is VALID [2022-04-28 15:34:50,158 INFO L290 TraceCheckUtils]: 70: Hoare triple {23939#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {23939#false} is VALID [2022-04-28 15:34:50,158 INFO L290 TraceCheckUtils]: 71: Hoare triple {23939#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {23939#false} is VALID [2022-04-28 15:34:50,158 INFO L290 TraceCheckUtils]: 72: Hoare triple {23939#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {23939#false} is VALID [2022-04-28 15:34:50,158 INFO L290 TraceCheckUtils]: 73: Hoare triple {23939#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {23939#false} is VALID [2022-04-28 15:34:50,158 INFO L290 TraceCheckUtils]: 74: Hoare triple {23939#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {23939#false} is VALID [2022-04-28 15:34:50,158 INFO L290 TraceCheckUtils]: 75: Hoare triple {23939#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {23939#false} is VALID [2022-04-28 15:34:50,158 INFO L290 TraceCheckUtils]: 76: Hoare triple {23939#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {23939#false} is VALID [2022-04-28 15:34:50,158 INFO L290 TraceCheckUtils]: 77: Hoare triple {23939#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {23939#false} is VALID [2022-04-28 15:34:50,158 INFO L290 TraceCheckUtils]: 78: Hoare triple {23939#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {23939#false} is VALID [2022-04-28 15:34:50,158 INFO L290 TraceCheckUtils]: 79: Hoare triple {23939#false} assume 8641 == #t~mem76;havoc #t~mem76; {23939#false} is VALID [2022-04-28 15:34:50,158 INFO L290 TraceCheckUtils]: 80: Hoare triple {23939#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {23939#false} is VALID [2022-04-28 15:34:50,158 INFO L290 TraceCheckUtils]: 81: Hoare triple {23939#false} assume !(4 == ~blastFlag~0); {23939#false} is VALID [2022-04-28 15:34:50,158 INFO L290 TraceCheckUtils]: 82: Hoare triple {23939#false} assume !(7 == ~blastFlag~0); {23939#false} is VALID [2022-04-28 15:34:50,158 INFO L290 TraceCheckUtils]: 83: Hoare triple {23939#false} assume !(10 == ~blastFlag~0); {23939#false} is VALID [2022-04-28 15:34:50,159 INFO L290 TraceCheckUtils]: 84: Hoare triple {23939#false} assume !false; {23939#false} is VALID [2022-04-28 15:34:50,159 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:34:50,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:34:50,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31730950] [2022-04-28 15:34:50,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31730950] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:34:50,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:34:50,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:34:50,159 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:34:50,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [604494691] [2022-04-28 15:34:50,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [604494691] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:34:50,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:34:50,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:34:50,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772230148] [2022-04-28 15:34:50,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:34:50,160 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 85 [2022-04-28 15:34:50,160 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:34:50,160 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-28 15:34:50,218 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-28 15:34:50,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:34:50,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:34:50,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:34:50,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:34:50,219 INFO L87 Difference]: Start difference. First operand 252 states and 381 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-28 15:34:53,344 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-28 15:34:58,326 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:34:59,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:34:59,296 INFO L93 Difference]: Finished difference Result 495 states and 755 transitions. [2022-04-28 15:34:59,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:34:59,296 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 85 [2022-04-28 15:34:59,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:34:59,296 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-28 15:34:59,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 478 transitions. [2022-04-28 15:34:59,298 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-28 15:34:59,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 478 transitions. [2022-04-28 15:34:59,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 478 transitions. [2022-04-28 15:34:59,607 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-28 15:34:59,610 INFO L225 Difference]: With dead ends: 495 [2022-04-28 15:34:59,610 INFO L226 Difference]: Without dead ends: 269 [2022-04-28 15:34:59,611 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-28 15:34:59,611 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 35 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-04-28 15:34:59,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 529 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 394 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2022-04-28 15:34:59,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-04-28 15:34:59,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 252. [2022-04-28 15:34:59,618 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:34:59,618 INFO L82 GeneralOperation]: Start isEquivalent. First operand 269 states. Second operand has 252 states, 247 states have (on average 1.5222672064777327) internal successors, (376), 247 states have internal predecessors, (376), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:59,618 INFO L74 IsIncluded]: Start isIncluded. First operand 269 states. Second operand has 252 states, 247 states have (on average 1.5222672064777327) internal successors, (376), 247 states have internal predecessors, (376), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:59,618 INFO L87 Difference]: Start difference. First operand 269 states. Second operand has 252 states, 247 states have (on average 1.5222672064777327) internal successors, (376), 247 states have internal predecessors, (376), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:59,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:34:59,643 INFO L93 Difference]: Finished difference Result 269 states and 403 transitions. [2022-04-28 15:34:59,643 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 403 transitions. [2022-04-28 15:34:59,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:34:59,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:34:59,644 INFO L74 IsIncluded]: Start isIncluded. First operand has 252 states, 247 states have (on average 1.5222672064777327) internal successors, (376), 247 states have internal predecessors, (376), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 269 states. [2022-04-28 15:34:59,644 INFO L87 Difference]: Start difference. First operand has 252 states, 247 states have (on average 1.5222672064777327) internal successors, (376), 247 states have internal predecessors, (376), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 269 states. [2022-04-28 15:34:59,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:34:59,648 INFO L93 Difference]: Finished difference Result 269 states and 403 transitions. [2022-04-28 15:34:59,648 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 403 transitions. [2022-04-28 15:34:59,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:34:59,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:34:59,648 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:34:59,648 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:34:59,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 247 states have (on average 1.5222672064777327) internal successors, (376), 247 states have internal predecessors, (376), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:59,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 380 transitions. [2022-04-28 15:34:59,652 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 380 transitions. Word has length 85 [2022-04-28 15:34:59,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:34:59,652 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 380 transitions. [2022-04-28 15:34:59,652 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-28 15:34:59,652 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 252 states and 380 transitions. [2022-04-28 15:34:59,926 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 380 edges. 380 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:34:59,926 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 380 transitions. [2022-04-28 15:34:59,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-28 15:34:59,927 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:34:59,927 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:34:59,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-28 15:34:59,927 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:34:59,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:34:59,928 INFO L85 PathProgramCache]: Analyzing trace with hash 459071505, now seen corresponding path program 1 times [2022-04-28 15:34:59,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:34:59,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1706095251] [2022-04-28 15:34:59,965 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:34:59,965 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:34:59,965 INFO L85 PathProgramCache]: Analyzing trace with hash 459071505, now seen corresponding path program 2 times [2022-04-28 15:34:59,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:34:59,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100901218] [2022-04-28 15:34:59,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:34:59,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:35:00,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:35:00,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:35:00,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:35:00,082 INFO L290 TraceCheckUtils]: 0: Hoare triple {25989#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {25982#true} is VALID [2022-04-28 15:35:00,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {25982#true} assume true; {25982#true} is VALID [2022-04-28 15:35:00,082 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25982#true} {25982#true} #703#return; {25982#true} is VALID [2022-04-28 15:35:00,083 INFO L272 TraceCheckUtils]: 0: Hoare triple {25982#true} call ULTIMATE.init(); {25989#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-28 15:35:00,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {25989#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {25982#true} is VALID [2022-04-28 15:35:00,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {25982#true} assume true; {25982#true} is VALID [2022-04-28 15:35:00,083 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25982#true} {25982#true} #703#return; {25982#true} is VALID [2022-04-28 15:35:00,083 INFO L272 TraceCheckUtils]: 4: Hoare triple {25982#true} call #t~ret161 := main(); {25982#true} is VALID [2022-04-28 15:35:00,083 INFO L290 TraceCheckUtils]: 5: Hoare triple {25982#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {25982#true} is VALID [2022-04-28 15:35:00,083 INFO L290 TraceCheckUtils]: 6: Hoare triple {25982#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {25982#true} is VALID [2022-04-28 15:35:00,084 INFO L272 TraceCheckUtils]: 7: Hoare triple {25982#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {25982#true} is VALID [2022-04-28 15:35:00,084 INFO L290 TraceCheckUtils]: 8: Hoare triple {25982#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {25982#true} is VALID [2022-04-28 15:35:00,084 INFO L290 TraceCheckUtils]: 9: Hoare triple {25982#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {25982#true} is VALID [2022-04-28 15:35:00,084 INFO L290 TraceCheckUtils]: 10: Hoare triple {25982#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {25982#true} is VALID [2022-04-28 15:35:00,084 INFO L290 TraceCheckUtils]: 11: Hoare triple {25982#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {25982#true} is VALID [2022-04-28 15:35:00,084 INFO L290 TraceCheckUtils]: 12: Hoare triple {25982#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {25982#true} is VALID [2022-04-28 15:35:00,084 INFO L290 TraceCheckUtils]: 13: Hoare triple {25982#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {25982#true} is VALID [2022-04-28 15:35:00,084 INFO L290 TraceCheckUtils]: 14: Hoare triple {25982#true} assume !false; {25982#true} is VALID [2022-04-28 15:35:00,084 INFO L290 TraceCheckUtils]: 15: Hoare triple {25982#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {25982#true} is VALID [2022-04-28 15:35:00,084 INFO L290 TraceCheckUtils]: 16: Hoare triple {25982#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {25982#true} is VALID [2022-04-28 15:35:00,084 INFO L290 TraceCheckUtils]: 17: Hoare triple {25982#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {25982#true} is VALID [2022-04-28 15:35:00,084 INFO L290 TraceCheckUtils]: 18: Hoare triple {25982#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {25982#true} is VALID [2022-04-28 15:35:00,084 INFO L290 TraceCheckUtils]: 19: Hoare triple {25982#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {25982#true} is VALID [2022-04-28 15:35:00,084 INFO L290 TraceCheckUtils]: 20: Hoare triple {25982#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {25982#true} is VALID [2022-04-28 15:35:00,085 INFO L290 TraceCheckUtils]: 21: Hoare triple {25982#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {25982#true} is VALID [2022-04-28 15:35:00,085 INFO L290 TraceCheckUtils]: 22: Hoare triple {25982#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {25982#true} is VALID [2022-04-28 15:35:00,085 INFO L290 TraceCheckUtils]: 23: Hoare triple {25982#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {25982#true} is VALID [2022-04-28 15:35:00,085 INFO L290 TraceCheckUtils]: 24: Hoare triple {25982#true} assume 8464 == #t~mem55;havoc #t~mem55; {25982#true} is VALID [2022-04-28 15:35:00,085 INFO L290 TraceCheckUtils]: 25: Hoare triple {25982#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {25982#true} is VALID [2022-04-28 15:35:00,085 INFO L290 TraceCheckUtils]: 26: Hoare triple {25982#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {25982#true} is VALID [2022-04-28 15:35:00,086 INFO L290 TraceCheckUtils]: 27: Hoare triple {25982#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {25987#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:35:00,086 INFO L290 TraceCheckUtils]: 28: Hoare triple {25987#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {25987#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:35:00,086 INFO L290 TraceCheckUtils]: 29: Hoare triple {25987#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {25987#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:35:00,087 INFO L290 TraceCheckUtils]: 30: Hoare triple {25987#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} ~skip~0 := 0; {25987#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:35:00,087 INFO L290 TraceCheckUtils]: 31: Hoare triple {25987#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {25987#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:35:00,087 INFO L290 TraceCheckUtils]: 32: Hoare triple {25987#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {25987#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:35:00,088 INFO L290 TraceCheckUtils]: 33: Hoare triple {25987#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {25987#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:35:00,088 INFO L290 TraceCheckUtils]: 34: Hoare triple {25987#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {25987#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:35:00,088 INFO L290 TraceCheckUtils]: 35: Hoare triple {25987#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {25987#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:35:00,089 INFO L290 TraceCheckUtils]: 36: Hoare triple {25987#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {25988#(not (= |ssl3_accept_#t~mem51| 8195))} is VALID [2022-04-28 15:35:00,089 INFO L290 TraceCheckUtils]: 37: Hoare triple {25988#(not (= |ssl3_accept_#t~mem51| 8195))} assume 8195 == #t~mem51;havoc #t~mem51; {25983#false} is VALID [2022-04-28 15:35:00,089 INFO L290 TraceCheckUtils]: 38: Hoare triple {25983#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {25983#false} is VALID [2022-04-28 15:35:00,089 INFO L290 TraceCheckUtils]: 39: Hoare triple {25983#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {25983#false} is VALID [2022-04-28 15:35:00,089 INFO L290 TraceCheckUtils]: 40: Hoare triple {25983#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {25983#false} is VALID [2022-04-28 15:35:00,089 INFO L290 TraceCheckUtils]: 41: Hoare triple {25983#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, 80 + ~s.offset, 8); {25983#false} is VALID [2022-04-28 15:35:00,089 INFO L290 TraceCheckUtils]: 42: Hoare triple {25983#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {25983#false} is VALID [2022-04-28 15:35:00,089 INFO L290 TraceCheckUtils]: 43: Hoare triple {25983#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {25983#false} is VALID [2022-04-28 15:35:00,090 INFO L290 TraceCheckUtils]: 44: Hoare triple {25983#false} assume 12292 != #t~mem85;havoc #t~mem85; {25983#false} is VALID [2022-04-28 15:35:00,090 INFO L290 TraceCheckUtils]: 45: Hoare triple {25983#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 72 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem87 := read~int(#t~mem86.base, 128 + #t~mem86.offset, 4);call write~int(1 + #t~mem87, #t~mem86.base, 128 + #t~mem86.offset, 4);havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87; {25983#false} is VALID [2022-04-28 15:35:00,090 INFO L290 TraceCheckUtils]: 46: Hoare triple {25983#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {25983#false} is VALID [2022-04-28 15:35:00,090 INFO L290 TraceCheckUtils]: 47: Hoare triple {25983#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {25983#false} is VALID [2022-04-28 15:35:00,090 INFO L290 TraceCheckUtils]: 48: Hoare triple {25983#false} ~skip~0 := 0; {25983#false} is VALID [2022-04-28 15:35:00,090 INFO L290 TraceCheckUtils]: 49: Hoare triple {25983#false} assume !false; {25983#false} is VALID [2022-04-28 15:35:00,090 INFO L290 TraceCheckUtils]: 50: Hoare triple {25983#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {25983#false} is VALID [2022-04-28 15:35:00,090 INFO L290 TraceCheckUtils]: 51: Hoare triple {25983#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {25983#false} is VALID [2022-04-28 15:35:00,090 INFO L290 TraceCheckUtils]: 52: Hoare triple {25983#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {25983#false} is VALID [2022-04-28 15:35:00,090 INFO L290 TraceCheckUtils]: 53: Hoare triple {25983#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {25983#false} is VALID [2022-04-28 15:35:00,090 INFO L290 TraceCheckUtils]: 54: Hoare triple {25983#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {25983#false} is VALID [2022-04-28 15:35:00,090 INFO L290 TraceCheckUtils]: 55: Hoare triple {25983#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {25983#false} is VALID [2022-04-28 15:35:00,090 INFO L290 TraceCheckUtils]: 56: Hoare triple {25983#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {25983#false} is VALID [2022-04-28 15:35:00,090 INFO L290 TraceCheckUtils]: 57: Hoare triple {25983#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {25983#false} is VALID [2022-04-28 15:35:00,090 INFO L290 TraceCheckUtils]: 58: Hoare triple {25983#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {25983#false} is VALID [2022-04-28 15:35:00,091 INFO L290 TraceCheckUtils]: 59: Hoare triple {25983#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {25983#false} is VALID [2022-04-28 15:35:00,091 INFO L290 TraceCheckUtils]: 60: Hoare triple {25983#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {25983#false} is VALID [2022-04-28 15:35:00,091 INFO L290 TraceCheckUtils]: 61: Hoare triple {25983#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {25983#false} is VALID [2022-04-28 15:35:00,091 INFO L290 TraceCheckUtils]: 62: Hoare triple {25983#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {25983#false} is VALID [2022-04-28 15:35:00,091 INFO L290 TraceCheckUtils]: 63: Hoare triple {25983#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {25983#false} is VALID [2022-04-28 15:35:00,091 INFO L290 TraceCheckUtils]: 64: Hoare triple {25983#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {25983#false} is VALID [2022-04-28 15:35:00,091 INFO L290 TraceCheckUtils]: 65: Hoare triple {25983#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {25983#false} is VALID [2022-04-28 15:35:00,091 INFO L290 TraceCheckUtils]: 66: Hoare triple {25983#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {25983#false} is VALID [2022-04-28 15:35:00,091 INFO L290 TraceCheckUtils]: 67: Hoare triple {25983#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {25983#false} is VALID [2022-04-28 15:35:00,091 INFO L290 TraceCheckUtils]: 68: Hoare triple {25983#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {25983#false} is VALID [2022-04-28 15:35:00,091 INFO L290 TraceCheckUtils]: 69: Hoare triple {25983#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {25983#false} is VALID [2022-04-28 15:35:00,091 INFO L290 TraceCheckUtils]: 70: Hoare triple {25983#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {25983#false} is VALID [2022-04-28 15:35:00,091 INFO L290 TraceCheckUtils]: 71: Hoare triple {25983#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {25983#false} is VALID [2022-04-28 15:35:00,092 INFO L290 TraceCheckUtils]: 72: Hoare triple {25983#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {25983#false} is VALID [2022-04-28 15:35:00,092 INFO L290 TraceCheckUtils]: 73: Hoare triple {25983#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {25983#false} is VALID [2022-04-28 15:35:00,092 INFO L290 TraceCheckUtils]: 74: Hoare triple {25983#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {25983#false} is VALID [2022-04-28 15:35:00,092 INFO L290 TraceCheckUtils]: 75: Hoare triple {25983#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {25983#false} is VALID [2022-04-28 15:35:00,092 INFO L290 TraceCheckUtils]: 76: Hoare triple {25983#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {25983#false} is VALID [2022-04-28 15:35:00,092 INFO L290 TraceCheckUtils]: 77: Hoare triple {25983#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {25983#false} is VALID [2022-04-28 15:35:00,092 INFO L290 TraceCheckUtils]: 78: Hoare triple {25983#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {25983#false} is VALID [2022-04-28 15:35:00,092 INFO L290 TraceCheckUtils]: 79: Hoare triple {25983#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {25983#false} is VALID [2022-04-28 15:35:00,092 INFO L290 TraceCheckUtils]: 80: Hoare triple {25983#false} assume 8641 == #t~mem76;havoc #t~mem76; {25983#false} is VALID [2022-04-28 15:35:00,092 INFO L290 TraceCheckUtils]: 81: Hoare triple {25983#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {25983#false} is VALID [2022-04-28 15:35:00,092 INFO L290 TraceCheckUtils]: 82: Hoare triple {25983#false} assume !(4 == ~blastFlag~0); {25983#false} is VALID [2022-04-28 15:35:00,092 INFO L290 TraceCheckUtils]: 83: Hoare triple {25983#false} assume !(7 == ~blastFlag~0); {25983#false} is VALID [2022-04-28 15:35:00,092 INFO L290 TraceCheckUtils]: 84: Hoare triple {25983#false} assume !(10 == ~blastFlag~0); {25983#false} is VALID [2022-04-28 15:35:00,092 INFO L290 TraceCheckUtils]: 85: Hoare triple {25983#false} assume !false; {25983#false} is VALID [2022-04-28 15:35:00,093 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:35:00,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:35:00,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100901218] [2022-04-28 15:35:00,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100901218] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:35:00,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:35:00,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:35:00,095 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:35:00,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1706095251] [2022-04-28 15:35:00,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1706095251] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:35:00,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:35:00,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:35:00,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41974010] [2022-04-28 15:35:00,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:35:00,096 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2022-04-28 15:35:00,096 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:35:00,096 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:35:00,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:35:00,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:35:00,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:35:00,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:35:00,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:35:00,155 INFO L87 Difference]: Start difference. First operand 252 states and 380 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:35:03,283 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:35:06,300 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-28 15:35:09,484 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:35:10,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:35:10,595 INFO L93 Difference]: Finished difference Result 577 states and 883 transitions. [2022-04-28 15:35:10,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:35:10,596 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2022-04-28 15:35:10,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:35:10,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:35:10,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 602 transitions. [2022-04-28 15:35:10,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:35:10,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 602 transitions. [2022-04-28 15:35:10,600 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 602 transitions. [2022-04-28 15:35:10,874 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 602 edges. 602 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:35:10,880 INFO L225 Difference]: With dead ends: 577 [2022-04-28 15:35:10,880 INFO L226 Difference]: Without dead ends: 351 [2022-04-28 15:35:10,880 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-28 15:35:10,881 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 144 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 62 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:35:10,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 366 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 479 Invalid, 1 Unknown, 0 Unchecked, 6.0s Time] [2022-04-28 15:35:10,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-04-28 15:35:10,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 252. [2022-04-28 15:35:10,888 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:35:10,888 INFO L82 GeneralOperation]: Start isEquivalent. First operand 351 states. Second operand has 252 states, 247 states have (on average 1.5060728744939271) internal successors, (372), 247 states have internal predecessors, (372), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:35:10,888 INFO L74 IsIncluded]: Start isIncluded. First operand 351 states. Second operand has 252 states, 247 states have (on average 1.5060728744939271) internal successors, (372), 247 states have internal predecessors, (372), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:35:10,888 INFO L87 Difference]: Start difference. First operand 351 states. Second operand has 252 states, 247 states have (on average 1.5060728744939271) internal successors, (372), 247 states have internal predecessors, (372), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:35:10,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:35:10,893 INFO L93 Difference]: Finished difference Result 351 states and 529 transitions. [2022-04-28 15:35:10,893 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 529 transitions. [2022-04-28 15:35:10,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:35:10,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:35:10,894 INFO L74 IsIncluded]: Start isIncluded. First operand has 252 states, 247 states have (on average 1.5060728744939271) internal successors, (372), 247 states have internal predecessors, (372), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 351 states. [2022-04-28 15:35:10,894 INFO L87 Difference]: Start difference. First operand has 252 states, 247 states have (on average 1.5060728744939271) internal successors, (372), 247 states have internal predecessors, (372), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 351 states. [2022-04-28 15:35:10,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:35:10,899 INFO L93 Difference]: Finished difference Result 351 states and 529 transitions. [2022-04-28 15:35:10,899 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 529 transitions. [2022-04-28 15:35:10,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:35:10,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:35:10,900 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:35:10,900 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:35:10,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 247 states have (on average 1.5060728744939271) internal successors, (372), 247 states have internal predecessors, (372), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:35:10,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 376 transitions. [2022-04-28 15:35:10,904 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 376 transitions. Word has length 86 [2022-04-28 15:35:10,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:35:10,905 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 376 transitions. [2022-04-28 15:35:10,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:35:10,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 252 states and 376 transitions. [2022-04-28 15:35:11,182 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 376 edges. 376 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:35:11,182 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 376 transitions. [2022-04-28 15:35:11,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-04-28 15:35:11,183 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:35:11,183 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:35:11,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-28 15:35:11,183 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:35:11,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:35:11,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1846566073, now seen corresponding path program 1 times [2022-04-28 15:35:11,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:35:11,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1428484224] [2022-04-28 15:35:11,216 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:35:11,216 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:35:11,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1846566073, now seen corresponding path program 2 times [2022-04-28 15:35:11,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:35:11,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753279262] [2022-04-28 15:35:11,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:35:11,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:35:11,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:35:11,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:35:11,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:35:11,331 INFO L290 TraceCheckUtils]: 0: Hoare triple {28361#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {28354#true} is VALID [2022-04-28 15:35:11,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {28354#true} assume true; {28354#true} is VALID [2022-04-28 15:35:11,331 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28354#true} {28354#true} #703#return; {28354#true} is VALID [2022-04-28 15:35:11,331 INFO L272 TraceCheckUtils]: 0: Hoare triple {28354#true} call ULTIMATE.init(); {28361#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-28 15:35:11,332 INFO L290 TraceCheckUtils]: 1: Hoare triple {28361#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {28354#true} is VALID [2022-04-28 15:35:11,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {28354#true} assume true; {28354#true} is VALID [2022-04-28 15:35:11,332 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28354#true} {28354#true} #703#return; {28354#true} is VALID [2022-04-28 15:35:11,332 INFO L272 TraceCheckUtils]: 4: Hoare triple {28354#true} call #t~ret161 := main(); {28354#true} is VALID [2022-04-28 15:35:11,332 INFO L290 TraceCheckUtils]: 5: Hoare triple {28354#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {28354#true} is VALID [2022-04-28 15:35:11,332 INFO L290 TraceCheckUtils]: 6: Hoare triple {28354#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {28354#true} is VALID [2022-04-28 15:35:11,332 INFO L272 TraceCheckUtils]: 7: Hoare triple {28354#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {28354#true} is VALID [2022-04-28 15:35:11,332 INFO L290 TraceCheckUtils]: 8: Hoare triple {28354#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {28354#true} is VALID [2022-04-28 15:35:11,332 INFO L290 TraceCheckUtils]: 9: Hoare triple {28354#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {28354#true} is VALID [2022-04-28 15:35:11,332 INFO L290 TraceCheckUtils]: 10: Hoare triple {28354#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {28354#true} is VALID [2022-04-28 15:35:11,332 INFO L290 TraceCheckUtils]: 11: Hoare triple {28354#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {28354#true} is VALID [2022-04-28 15:35:11,332 INFO L290 TraceCheckUtils]: 12: Hoare triple {28354#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {28354#true} is VALID [2022-04-28 15:35:11,332 INFO L290 TraceCheckUtils]: 13: Hoare triple {28354#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {28354#true} is VALID [2022-04-28 15:35:11,333 INFO L290 TraceCheckUtils]: 14: Hoare triple {28354#true} assume !false; {28354#true} is VALID [2022-04-28 15:35:11,333 INFO L290 TraceCheckUtils]: 15: Hoare triple {28354#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {28354#true} is VALID [2022-04-28 15:35:11,333 INFO L290 TraceCheckUtils]: 16: Hoare triple {28354#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {28354#true} is VALID [2022-04-28 15:35:11,333 INFO L290 TraceCheckUtils]: 17: Hoare triple {28354#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {28354#true} is VALID [2022-04-28 15:35:11,333 INFO L290 TraceCheckUtils]: 18: Hoare triple {28354#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {28354#true} is VALID [2022-04-28 15:35:11,333 INFO L290 TraceCheckUtils]: 19: Hoare triple {28354#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {28354#true} is VALID [2022-04-28 15:35:11,333 INFO L290 TraceCheckUtils]: 20: Hoare triple {28354#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {28354#true} is VALID [2022-04-28 15:35:11,333 INFO L290 TraceCheckUtils]: 21: Hoare triple {28354#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {28354#true} is VALID [2022-04-28 15:35:11,333 INFO L290 TraceCheckUtils]: 22: Hoare triple {28354#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {28354#true} is VALID [2022-04-28 15:35:11,333 INFO L290 TraceCheckUtils]: 23: Hoare triple {28354#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {28354#true} is VALID [2022-04-28 15:35:11,333 INFO L290 TraceCheckUtils]: 24: Hoare triple {28354#true} assume 8464 == #t~mem55;havoc #t~mem55; {28354#true} is VALID [2022-04-28 15:35:11,333 INFO L290 TraceCheckUtils]: 25: Hoare triple {28354#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {28354#true} is VALID [2022-04-28 15:35:11,333 INFO L290 TraceCheckUtils]: 26: Hoare triple {28354#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {28354#true} is VALID [2022-04-28 15:35:11,333 INFO L290 TraceCheckUtils]: 27: Hoare triple {28354#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {28354#true} is VALID [2022-04-28 15:35:11,333 INFO L290 TraceCheckUtils]: 28: Hoare triple {28354#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {28354#true} is VALID [2022-04-28 15:35:11,334 INFO L290 TraceCheckUtils]: 29: Hoare triple {28354#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {28354#true} is VALID [2022-04-28 15:35:11,334 INFO L290 TraceCheckUtils]: 30: Hoare triple {28354#true} ~skip~0 := 0; {28354#true} is VALID [2022-04-28 15:35:11,334 INFO L290 TraceCheckUtils]: 31: Hoare triple {28354#true} assume !false; {28354#true} is VALID [2022-04-28 15:35:11,334 INFO L290 TraceCheckUtils]: 32: Hoare triple {28354#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {28354#true} is VALID [2022-04-28 15:35:11,334 INFO L290 TraceCheckUtils]: 33: Hoare triple {28354#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {28354#true} is VALID [2022-04-28 15:35:11,334 INFO L290 TraceCheckUtils]: 34: Hoare triple {28354#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {28354#true} is VALID [2022-04-28 15:35:11,334 INFO L290 TraceCheckUtils]: 35: Hoare triple {28354#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {28354#true} is VALID [2022-04-28 15:35:11,334 INFO L290 TraceCheckUtils]: 36: Hoare triple {28354#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {28354#true} is VALID [2022-04-28 15:35:11,334 INFO L290 TraceCheckUtils]: 37: Hoare triple {28354#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {28354#true} is VALID [2022-04-28 15:35:11,334 INFO L290 TraceCheckUtils]: 38: Hoare triple {28354#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {28354#true} is VALID [2022-04-28 15:35:11,334 INFO L290 TraceCheckUtils]: 39: Hoare triple {28354#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {28354#true} is VALID [2022-04-28 15:35:11,334 INFO L290 TraceCheckUtils]: 40: Hoare triple {28354#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {28354#true} is VALID [2022-04-28 15:35:11,334 INFO L290 TraceCheckUtils]: 41: Hoare triple {28354#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {28354#true} is VALID [2022-04-28 15:35:11,334 INFO L290 TraceCheckUtils]: 42: Hoare triple {28354#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {28354#true} is VALID [2022-04-28 15:35:11,335 INFO L290 TraceCheckUtils]: 43: Hoare triple {28354#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {28354#true} is VALID [2022-04-28 15:35:11,335 INFO L290 TraceCheckUtils]: 44: Hoare triple {28354#true} assume 8496 == #t~mem58;havoc #t~mem58; {28354#true} is VALID [2022-04-28 15:35:11,335 INFO L290 TraceCheckUtils]: 45: Hoare triple {28354#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {28354#true} is VALID [2022-04-28 15:35:11,335 INFO L290 TraceCheckUtils]: 46: Hoare triple {28354#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {28354#true} is VALID [2022-04-28 15:35:11,335 INFO L290 TraceCheckUtils]: 47: Hoare triple {28354#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {28354#true} is VALID [2022-04-28 15:35:11,335 INFO L290 TraceCheckUtils]: 48: Hoare triple {28354#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:35:11,336 INFO L290 TraceCheckUtils]: 49: Hoare triple {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:35:11,336 INFO L290 TraceCheckUtils]: 50: Hoare triple {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:35:11,337 INFO L290 TraceCheckUtils]: 51: Hoare triple {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:35:11,337 INFO L290 TraceCheckUtils]: 52: Hoare triple {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:35:11,337 INFO L290 TraceCheckUtils]: 53: Hoare triple {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:35:11,338 INFO L290 TraceCheckUtils]: 54: Hoare triple {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:35:11,338 INFO L290 TraceCheckUtils]: 55: Hoare triple {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:35:11,338 INFO L290 TraceCheckUtils]: 56: Hoare triple {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:35:11,339 INFO L290 TraceCheckUtils]: 57: Hoare triple {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:35:11,339 INFO L290 TraceCheckUtils]: 58: Hoare triple {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:35:11,339 INFO L290 TraceCheckUtils]: 59: Hoare triple {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:35:11,340 INFO L290 TraceCheckUtils]: 60: Hoare triple {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:35:11,340 INFO L290 TraceCheckUtils]: 61: Hoare triple {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:35:11,340 INFO L290 TraceCheckUtils]: 62: Hoare triple {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:35:11,341 INFO L290 TraceCheckUtils]: 63: Hoare triple {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:35:11,341 INFO L290 TraceCheckUtils]: 64: Hoare triple {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:35:11,341 INFO L290 TraceCheckUtils]: 65: Hoare triple {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:35:11,342 INFO L290 TraceCheckUtils]: 66: Hoare triple {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:35:11,342 INFO L290 TraceCheckUtils]: 67: Hoare triple {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:35:11,342 INFO L290 TraceCheckUtils]: 68: Hoare triple {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:35:11,343 INFO L290 TraceCheckUtils]: 69: Hoare triple {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:35:11,343 INFO L290 TraceCheckUtils]: 70: Hoare triple {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:35:11,343 INFO L290 TraceCheckUtils]: 71: Hoare triple {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:35:11,344 INFO L290 TraceCheckUtils]: 72: Hoare triple {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:35:11,344 INFO L290 TraceCheckUtils]: 73: Hoare triple {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:35:11,344 INFO L290 TraceCheckUtils]: 74: Hoare triple {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:35:11,345 INFO L290 TraceCheckUtils]: 75: Hoare triple {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:35:11,345 INFO L290 TraceCheckUtils]: 76: Hoare triple {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:35:11,345 INFO L290 TraceCheckUtils]: 77: Hoare triple {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:35:11,346 INFO L290 TraceCheckUtils]: 78: Hoare triple {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:35:11,346 INFO L290 TraceCheckUtils]: 79: Hoare triple {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:35:11,346 INFO L290 TraceCheckUtils]: 80: Hoare triple {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:35:11,347 INFO L290 TraceCheckUtils]: 81: Hoare triple {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:35:11,347 INFO L290 TraceCheckUtils]: 82: Hoare triple {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:35:11,347 INFO L290 TraceCheckUtils]: 83: Hoare triple {28359#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {28360#(= |ssl3_accept_#t~mem76| 8656)} is VALID [2022-04-28 15:35:11,348 INFO L290 TraceCheckUtils]: 84: Hoare triple {28360#(= |ssl3_accept_#t~mem76| 8656)} assume 8641 == #t~mem76;havoc #t~mem76; {28355#false} is VALID [2022-04-28 15:35:11,348 INFO L290 TraceCheckUtils]: 85: Hoare triple {28355#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {28355#false} is VALID [2022-04-28 15:35:11,348 INFO L290 TraceCheckUtils]: 86: Hoare triple {28355#false} assume !(4 == ~blastFlag~0); {28355#false} is VALID [2022-04-28 15:35:11,348 INFO L290 TraceCheckUtils]: 87: Hoare triple {28355#false} assume !(7 == ~blastFlag~0); {28355#false} is VALID [2022-04-28 15:35:11,348 INFO L290 TraceCheckUtils]: 88: Hoare triple {28355#false} assume !(10 == ~blastFlag~0); {28355#false} is VALID [2022-04-28 15:35:11,348 INFO L290 TraceCheckUtils]: 89: Hoare triple {28355#false} assume !false; {28355#false} is VALID [2022-04-28 15:35:11,348 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 15:35:11,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:35:11,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753279262] [2022-04-28 15:35:11,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753279262] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:35:11,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:35:11,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:35:11,349 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:35:11,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1428484224] [2022-04-28 15:35:11,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1428484224] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:35:11,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:35:11,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:35:11,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613031375] [2022-04-28 15:35:11,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:35:11,349 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 90 [2022-04-28 15:35:11,350 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:35:11,350 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-28 15:35:11,408 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-28 15:35:11,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:35:11,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:35:11,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:35:11,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:35:11,409 INFO L87 Difference]: Start difference. First operand 252 states and 376 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-28 15:35:14,095 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:35:18,297 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-28 15:35:20,304 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:35:21,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:35:21,429 INFO L93 Difference]: Finished difference Result 577 states and 871 transitions. [2022-04-28 15:35:21,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:35:21,430 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 90 [2022-04-28 15:35:21,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:35:21,430 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-28 15:35:21,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 572 transitions. [2022-04-28 15:35:21,434 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-28 15:35:21,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 572 transitions. [2022-04-28 15:35:21,436 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 572 transitions. [2022-04-28 15:35:21,792 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 572 edges. 572 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:35:21,797 INFO L225 Difference]: With dead ends: 577 [2022-04-28 15:35:21,797 INFO L226 Difference]: Without dead ends: 351 [2022-04-28 15:35:21,798 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-28 15:35:21,798 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 82 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 14 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-04-28 15:35:21,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 483 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 520 Invalid, 1 Unknown, 0 Unchecked, 5.9s Time] [2022-04-28 15:35:21,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-04-28 15:35:21,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 294. [2022-04-28 15:35:21,807 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:35:21,807 INFO L82 GeneralOperation]: Start isEquivalent. First operand 351 states. Second operand has 294 states, 289 states have (on average 1.5259515570934257) internal successors, (441), 289 states have internal predecessors, (441), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:35:21,807 INFO L74 IsIncluded]: Start isIncluded. First operand 351 states. Second operand has 294 states, 289 states have (on average 1.5259515570934257) internal successors, (441), 289 states have internal predecessors, (441), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:35:21,808 INFO L87 Difference]: Start difference. First operand 351 states. Second operand has 294 states, 289 states have (on average 1.5259515570934257) internal successors, (441), 289 states have internal predecessors, (441), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:35:21,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:35:21,812 INFO L93 Difference]: Finished difference Result 351 states and 524 transitions. [2022-04-28 15:35:21,812 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 524 transitions. [2022-04-28 15:35:21,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:35:21,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:35:21,813 INFO L74 IsIncluded]: Start isIncluded. First operand has 294 states, 289 states have (on average 1.5259515570934257) internal successors, (441), 289 states have internal predecessors, (441), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 351 states. [2022-04-28 15:35:21,813 INFO L87 Difference]: Start difference. First operand has 294 states, 289 states have (on average 1.5259515570934257) internal successors, (441), 289 states have internal predecessors, (441), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 351 states. [2022-04-28 15:35:21,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:35:21,818 INFO L93 Difference]: Finished difference Result 351 states and 524 transitions. [2022-04-28 15:35:21,818 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 524 transitions. [2022-04-28 15:35:21,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:35:21,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:35:21,819 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:35:21,819 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:35:21,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 289 states have (on average 1.5259515570934257) internal successors, (441), 289 states have internal predecessors, (441), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:35:21,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 445 transitions. [2022-04-28 15:35:21,823 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 445 transitions. Word has length 90 [2022-04-28 15:35:21,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:35:21,824 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 445 transitions. [2022-04-28 15:35:21,824 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-28 15:35:21,824 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 294 states and 445 transitions. [2022-04-28 15:35:22,143 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-28 15:35:22,143 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 445 transitions. [2022-04-28 15:35:22,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-04-28 15:35:22,144 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:35:22,144 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:35:22,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-28 15:35:22,144 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:35:22,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:35:22,144 INFO L85 PathProgramCache]: Analyzing trace with hash 2094712567, now seen corresponding path program 1 times [2022-04-28 15:35:22,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:35:22,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [113382397] [2022-04-28 15:35:22,191 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:35:22,191 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:35:22,191 INFO L85 PathProgramCache]: Analyzing trace with hash 2094712567, now seen corresponding path program 2 times [2022-04-28 15:35:22,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:35:22,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535209209] [2022-04-28 15:35:22,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:35:22,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:35:22,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:35:22,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:35:22,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:35:22,295 INFO L290 TraceCheckUtils]: 0: Hoare triple {30817#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {30810#true} is VALID [2022-04-28 15:35:22,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {30810#true} assume true; {30810#true} is VALID [2022-04-28 15:35:22,295 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30810#true} {30810#true} #703#return; {30810#true} is VALID [2022-04-28 15:35:22,296 INFO L272 TraceCheckUtils]: 0: Hoare triple {30810#true} call ULTIMATE.init(); {30817#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-28 15:35:22,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {30817#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {30810#true} is VALID [2022-04-28 15:35:22,296 INFO L290 TraceCheckUtils]: 2: Hoare triple {30810#true} assume true; {30810#true} is VALID [2022-04-28 15:35:22,296 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30810#true} {30810#true} #703#return; {30810#true} is VALID [2022-04-28 15:35:22,296 INFO L272 TraceCheckUtils]: 4: Hoare triple {30810#true} call #t~ret161 := main(); {30810#true} is VALID [2022-04-28 15:35:22,296 INFO L290 TraceCheckUtils]: 5: Hoare triple {30810#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {30810#true} is VALID [2022-04-28 15:35:22,296 INFO L290 TraceCheckUtils]: 6: Hoare triple {30810#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {30810#true} is VALID [2022-04-28 15:35:22,296 INFO L272 TraceCheckUtils]: 7: Hoare triple {30810#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {30810#true} is VALID [2022-04-28 15:35:22,296 INFO L290 TraceCheckUtils]: 8: Hoare triple {30810#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {30810#true} is VALID [2022-04-28 15:35:22,297 INFO L290 TraceCheckUtils]: 9: Hoare triple {30810#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {30810#true} is VALID [2022-04-28 15:35:22,297 INFO L290 TraceCheckUtils]: 10: Hoare triple {30810#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {30810#true} is VALID [2022-04-28 15:35:22,297 INFO L290 TraceCheckUtils]: 11: Hoare triple {30810#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {30810#true} is VALID [2022-04-28 15:35:22,297 INFO L290 TraceCheckUtils]: 12: Hoare triple {30810#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {30810#true} is VALID [2022-04-28 15:35:22,297 INFO L290 TraceCheckUtils]: 13: Hoare triple {30810#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {30810#true} is VALID [2022-04-28 15:35:22,297 INFO L290 TraceCheckUtils]: 14: Hoare triple {30810#true} assume !false; {30810#true} is VALID [2022-04-28 15:35:22,297 INFO L290 TraceCheckUtils]: 15: Hoare triple {30810#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {30810#true} is VALID [2022-04-28 15:35:22,297 INFO L290 TraceCheckUtils]: 16: Hoare triple {30810#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {30810#true} is VALID [2022-04-28 15:35:22,297 INFO L290 TraceCheckUtils]: 17: Hoare triple {30810#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {30810#true} is VALID [2022-04-28 15:35:22,297 INFO L290 TraceCheckUtils]: 18: Hoare triple {30810#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {30810#true} is VALID [2022-04-28 15:35:22,297 INFO L290 TraceCheckUtils]: 19: Hoare triple {30810#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {30810#true} is VALID [2022-04-28 15:35:22,297 INFO L290 TraceCheckUtils]: 20: Hoare triple {30810#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {30810#true} is VALID [2022-04-28 15:35:22,297 INFO L290 TraceCheckUtils]: 21: Hoare triple {30810#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {30810#true} is VALID [2022-04-28 15:35:22,297 INFO L290 TraceCheckUtils]: 22: Hoare triple {30810#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {30810#true} is VALID [2022-04-28 15:35:22,298 INFO L290 TraceCheckUtils]: 23: Hoare triple {30810#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {30810#true} is VALID [2022-04-28 15:35:22,298 INFO L290 TraceCheckUtils]: 24: Hoare triple {30810#true} assume 8464 == #t~mem55;havoc #t~mem55; {30810#true} is VALID [2022-04-28 15:35:22,298 INFO L290 TraceCheckUtils]: 25: Hoare triple {30810#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {30810#true} is VALID [2022-04-28 15:35:22,298 INFO L290 TraceCheckUtils]: 26: Hoare triple {30810#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {30810#true} is VALID [2022-04-28 15:35:22,298 INFO L290 TraceCheckUtils]: 27: Hoare triple {30810#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {30810#true} is VALID [2022-04-28 15:35:22,298 INFO L290 TraceCheckUtils]: 28: Hoare triple {30810#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {30810#true} is VALID [2022-04-28 15:35:22,298 INFO L290 TraceCheckUtils]: 29: Hoare triple {30810#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {30810#true} is VALID [2022-04-28 15:35:22,298 INFO L290 TraceCheckUtils]: 30: Hoare triple {30810#true} ~skip~0 := 0; {30810#true} is VALID [2022-04-28 15:35:22,298 INFO L290 TraceCheckUtils]: 31: Hoare triple {30810#true} assume !false; {30810#true} is VALID [2022-04-28 15:35:22,298 INFO L290 TraceCheckUtils]: 32: Hoare triple {30810#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {30810#true} is VALID [2022-04-28 15:35:22,298 INFO L290 TraceCheckUtils]: 33: Hoare triple {30810#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {30810#true} is VALID [2022-04-28 15:35:22,298 INFO L290 TraceCheckUtils]: 34: Hoare triple {30810#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {30810#true} is VALID [2022-04-28 15:35:22,298 INFO L290 TraceCheckUtils]: 35: Hoare triple {30810#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {30810#true} is VALID [2022-04-28 15:35:22,298 INFO L290 TraceCheckUtils]: 36: Hoare triple {30810#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {30810#true} is VALID [2022-04-28 15:35:22,298 INFO L290 TraceCheckUtils]: 37: Hoare triple {30810#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {30810#true} is VALID [2022-04-28 15:35:22,299 INFO L290 TraceCheckUtils]: 38: Hoare triple {30810#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {30810#true} is VALID [2022-04-28 15:35:22,299 INFO L290 TraceCheckUtils]: 39: Hoare triple {30810#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {30810#true} is VALID [2022-04-28 15:35:22,299 INFO L290 TraceCheckUtils]: 40: Hoare triple {30810#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {30810#true} is VALID [2022-04-28 15:35:22,299 INFO L290 TraceCheckUtils]: 41: Hoare triple {30810#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {30810#true} is VALID [2022-04-28 15:35:22,299 INFO L290 TraceCheckUtils]: 42: Hoare triple {30810#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {30810#true} is VALID [2022-04-28 15:35:22,299 INFO L290 TraceCheckUtils]: 43: Hoare triple {30810#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {30810#true} is VALID [2022-04-28 15:35:22,299 INFO L290 TraceCheckUtils]: 44: Hoare triple {30810#true} assume 8496 == #t~mem58;havoc #t~mem58; {30810#true} is VALID [2022-04-28 15:35:22,299 INFO L290 TraceCheckUtils]: 45: Hoare triple {30810#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {30810#true} is VALID [2022-04-28 15:35:22,299 INFO L290 TraceCheckUtils]: 46: Hoare triple {30810#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {30810#true} is VALID [2022-04-28 15:35:22,299 INFO L290 TraceCheckUtils]: 47: Hoare triple {30810#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {30810#true} is VALID [2022-04-28 15:35:22,300 INFO L290 TraceCheckUtils]: 48: Hoare triple {30810#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 72 + ~s.offset, 4); {30815#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:35:22,300 INFO L290 TraceCheckUtils]: 49: Hoare triple {30815#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} call write~int(0, ~s.base, 88 + ~s.offset, 4); {30815#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:35:22,301 INFO L290 TraceCheckUtils]: 50: Hoare triple {30815#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {30815#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:35:22,301 INFO L290 TraceCheckUtils]: 51: Hoare triple {30815#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {30815#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:35:22,301 INFO L290 TraceCheckUtils]: 52: Hoare triple {30815#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} ~skip~0 := 0; {30815#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:35:22,302 INFO L290 TraceCheckUtils]: 53: Hoare triple {30815#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !false; {30815#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:35:22,303 INFO L290 TraceCheckUtils]: 54: Hoare triple {30815#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {30815#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:35:22,303 INFO L290 TraceCheckUtils]: 55: Hoare triple {30815#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {30815#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:35:22,304 INFO L290 TraceCheckUtils]: 56: Hoare triple {30815#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {30815#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:35:22,304 INFO L290 TraceCheckUtils]: 57: Hoare triple {30815#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {30815#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:35:22,304 INFO L290 TraceCheckUtils]: 58: Hoare triple {30815#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {30815#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:35:22,305 INFO L290 TraceCheckUtils]: 59: Hoare triple {30815#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {30815#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:35:22,305 INFO L290 TraceCheckUtils]: 60: Hoare triple {30815#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {30815#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:35:22,305 INFO L290 TraceCheckUtils]: 61: Hoare triple {30815#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {30815#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:35:22,306 INFO L290 TraceCheckUtils]: 62: Hoare triple {30815#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {30815#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:35:22,306 INFO L290 TraceCheckUtils]: 63: Hoare triple {30815#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {30815#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:35:22,306 INFO L290 TraceCheckUtils]: 64: Hoare triple {30815#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {30815#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:35:22,307 INFO L290 TraceCheckUtils]: 65: Hoare triple {30815#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {30815#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:35:22,307 INFO L290 TraceCheckUtils]: 66: Hoare triple {30815#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {30815#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:35:22,307 INFO L290 TraceCheckUtils]: 67: Hoare triple {30815#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {30816#(= |ssl3_accept_#t~mem60| 8512)} is VALID [2022-04-28 15:35:22,308 INFO L290 TraceCheckUtils]: 68: Hoare triple {30816#(= |ssl3_accept_#t~mem60| 8512)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {30811#false} is VALID [2022-04-28 15:35:22,308 INFO L290 TraceCheckUtils]: 69: Hoare triple {30811#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {30811#false} is VALID [2022-04-28 15:35:22,308 INFO L290 TraceCheckUtils]: 70: Hoare triple {30811#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {30811#false} is VALID [2022-04-28 15:35:22,308 INFO L290 TraceCheckUtils]: 71: Hoare triple {30811#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {30811#false} is VALID [2022-04-28 15:35:22,308 INFO L290 TraceCheckUtils]: 72: Hoare triple {30811#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {30811#false} is VALID [2022-04-28 15:35:22,308 INFO L290 TraceCheckUtils]: 73: Hoare triple {30811#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {30811#false} is VALID [2022-04-28 15:35:22,308 INFO L290 TraceCheckUtils]: 74: Hoare triple {30811#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {30811#false} is VALID [2022-04-28 15:35:22,308 INFO L290 TraceCheckUtils]: 75: Hoare triple {30811#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {30811#false} is VALID [2022-04-28 15:35:22,308 INFO L290 TraceCheckUtils]: 76: Hoare triple {30811#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {30811#false} is VALID [2022-04-28 15:35:22,308 INFO L290 TraceCheckUtils]: 77: Hoare triple {30811#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {30811#false} is VALID [2022-04-28 15:35:22,308 INFO L290 TraceCheckUtils]: 78: Hoare triple {30811#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {30811#false} is VALID [2022-04-28 15:35:22,308 INFO L290 TraceCheckUtils]: 79: Hoare triple {30811#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {30811#false} is VALID [2022-04-28 15:35:22,309 INFO L290 TraceCheckUtils]: 80: Hoare triple {30811#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {30811#false} is VALID [2022-04-28 15:35:22,309 INFO L290 TraceCheckUtils]: 81: Hoare triple {30811#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {30811#false} is VALID [2022-04-28 15:35:22,309 INFO L290 TraceCheckUtils]: 82: Hoare triple {30811#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {30811#false} is VALID [2022-04-28 15:35:22,309 INFO L290 TraceCheckUtils]: 83: Hoare triple {30811#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {30811#false} is VALID [2022-04-28 15:35:22,309 INFO L290 TraceCheckUtils]: 84: Hoare triple {30811#false} assume 8641 == #t~mem76;havoc #t~mem76; {30811#false} is VALID [2022-04-28 15:35:22,309 INFO L290 TraceCheckUtils]: 85: Hoare triple {30811#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {30811#false} is VALID [2022-04-28 15:35:22,309 INFO L290 TraceCheckUtils]: 86: Hoare triple {30811#false} assume !(4 == ~blastFlag~0); {30811#false} is VALID [2022-04-28 15:35:22,309 INFO L290 TraceCheckUtils]: 87: Hoare triple {30811#false} assume !(7 == ~blastFlag~0); {30811#false} is VALID [2022-04-28 15:35:22,309 INFO L290 TraceCheckUtils]: 88: Hoare triple {30811#false} assume !(10 == ~blastFlag~0); {30811#false} is VALID [2022-04-28 15:35:22,309 INFO L290 TraceCheckUtils]: 89: Hoare triple {30811#false} assume !false; {30811#false} is VALID [2022-04-28 15:35:22,310 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 15:35:22,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:35:22,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535209209] [2022-04-28 15:35:22,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535209209] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:35:22,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:35:22,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:35:22,311 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:35:22,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [113382397] [2022-04-28 15:35:22,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [113382397] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:35:22,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:35:22,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:35:22,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763860695] [2022-04-28 15:35:22,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:35:22,311 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 90 [2022-04-28 15:35:22,311 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:35:22,312 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-28 15:35:22,380 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-28 15:35:22,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:35:22,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:35:22,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:35:22,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:35:22,381 INFO L87 Difference]: Start difference. First operand 294 states and 445 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-28 15:35:25,681 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:35:27,685 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:35:32,060 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:35:33,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:35:33,195 INFO L93 Difference]: Finished difference Result 609 states and 927 transitions. [2022-04-28 15:35:33,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:35:33,195 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 90 [2022-04-28 15:35:33,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:35:33,195 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-28 15:35:33,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 491 transitions. [2022-04-28 15:35:33,197 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-28 15:35:33,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 491 transitions. [2022-04-28 15:35:33,199 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 491 transitions. [2022-04-28 15:35:33,516 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 491 edges. 491 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:35:33,521 INFO L225 Difference]: With dead ends: 609 [2022-04-28 15:35:33,522 INFO L226 Difference]: Without dead ends: 341 [2022-04-28 15:35:33,522 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-28 15:35:33,522 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 34 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 10 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-04-28 15:35:33,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 617 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 467 Invalid, 2 Unknown, 0 Unchecked, 7.2s Time] [2022-04-28 15:35:33,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2022-04-28 15:35:33,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 318. [2022-04-28 15:35:33,531 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:35:33,531 INFO L82 GeneralOperation]: Start isEquivalent. First operand 341 states. Second operand has 318 states, 313 states have (on average 1.523961661341853) internal successors, (477), 313 states have internal predecessors, (477), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:35:33,532 INFO L74 IsIncluded]: Start isIncluded. First operand 341 states. Second operand has 318 states, 313 states have (on average 1.523961661341853) internal successors, (477), 313 states have internal predecessors, (477), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:35:33,532 INFO L87 Difference]: Start difference. First operand 341 states. Second operand has 318 states, 313 states have (on average 1.523961661341853) internal successors, (477), 313 states have internal predecessors, (477), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:35:33,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:35:33,536 INFO L93 Difference]: Finished difference Result 341 states and 511 transitions. [2022-04-28 15:35:33,536 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 511 transitions. [2022-04-28 15:35:33,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:35:33,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:35:33,537 INFO L74 IsIncluded]: Start isIncluded. First operand has 318 states, 313 states have (on average 1.523961661341853) internal successors, (477), 313 states have internal predecessors, (477), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 341 states. [2022-04-28 15:35:33,537 INFO L87 Difference]: Start difference. First operand has 318 states, 313 states have (on average 1.523961661341853) internal successors, (477), 313 states have internal predecessors, (477), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 341 states. [2022-04-28 15:35:33,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:35:33,541 INFO L93 Difference]: Finished difference Result 341 states and 511 transitions. [2022-04-28 15:35:33,541 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 511 transitions. [2022-04-28 15:35:33,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:35:33,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:35:33,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:35:33,542 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:35:33,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 313 states have (on average 1.523961661341853) internal successors, (477), 313 states have internal predecessors, (477), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:35:33,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 481 transitions. [2022-04-28 15:35:33,547 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 481 transitions. Word has length 90 [2022-04-28 15:35:33,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:35:33,547 INFO L495 AbstractCegarLoop]: Abstraction has 318 states and 481 transitions. [2022-04-28 15:35:33,547 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-28 15:35:33,547 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 318 states and 481 transitions. [2022-04-28 15:35:33,923 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 481 edges. 481 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:35:33,923 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 481 transitions. [2022-04-28 15:35:33,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-28 15:35:33,924 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:35:33,924 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:35:33,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-28 15:35:33,924 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:35:33,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:35:33,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1509022085, now seen corresponding path program 1 times [2022-04-28 15:35:33,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:35:33,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1651924330] [2022-04-28 15:35:33,963 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:35:33,963 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:35:33,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1509022085, now seen corresponding path program 2 times [2022-04-28 15:35:33,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:35:33,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933743850] [2022-04-28 15:35:33,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:35:33,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:35:34,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:35:34,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:35:34,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:35:34,074 INFO L290 TraceCheckUtils]: 0: Hoare triple {33365#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {33358#true} is VALID [2022-04-28 15:35:34,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {33358#true} assume true; {33358#true} is VALID [2022-04-28 15:35:34,075 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33358#true} {33358#true} #703#return; {33358#true} is VALID [2022-04-28 15:35:34,075 INFO L272 TraceCheckUtils]: 0: Hoare triple {33358#true} call ULTIMATE.init(); {33365#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-28 15:35:34,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {33365#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {33358#true} is VALID [2022-04-28 15:35:34,075 INFO L290 TraceCheckUtils]: 2: Hoare triple {33358#true} assume true; {33358#true} is VALID [2022-04-28 15:35:34,075 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33358#true} {33358#true} #703#return; {33358#true} is VALID [2022-04-28 15:35:34,076 INFO L272 TraceCheckUtils]: 4: Hoare triple {33358#true} call #t~ret161 := main(); {33358#true} is VALID [2022-04-28 15:35:34,076 INFO L290 TraceCheckUtils]: 5: Hoare triple {33358#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {33358#true} is VALID [2022-04-28 15:35:34,076 INFO L290 TraceCheckUtils]: 6: Hoare triple {33358#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {33358#true} is VALID [2022-04-28 15:35:34,076 INFO L272 TraceCheckUtils]: 7: Hoare triple {33358#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {33358#true} is VALID [2022-04-28 15:35:34,076 INFO L290 TraceCheckUtils]: 8: Hoare triple {33358#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {33358#true} is VALID [2022-04-28 15:35:34,076 INFO L290 TraceCheckUtils]: 9: Hoare triple {33358#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {33358#true} is VALID [2022-04-28 15:35:34,076 INFO L290 TraceCheckUtils]: 10: Hoare triple {33358#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {33358#true} is VALID [2022-04-28 15:35:34,076 INFO L290 TraceCheckUtils]: 11: Hoare triple {33358#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {33358#true} is VALID [2022-04-28 15:35:34,076 INFO L290 TraceCheckUtils]: 12: Hoare triple {33358#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {33358#true} is VALID [2022-04-28 15:35:34,076 INFO L290 TraceCheckUtils]: 13: Hoare triple {33358#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {33358#true} is VALID [2022-04-28 15:35:34,076 INFO L290 TraceCheckUtils]: 14: Hoare triple {33358#true} assume !false; {33358#true} is VALID [2022-04-28 15:35:34,076 INFO L290 TraceCheckUtils]: 15: Hoare triple {33358#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {33358#true} is VALID [2022-04-28 15:35:34,076 INFO L290 TraceCheckUtils]: 16: Hoare triple {33358#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {33358#true} is VALID [2022-04-28 15:35:34,076 INFO L290 TraceCheckUtils]: 17: Hoare triple {33358#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {33358#true} is VALID [2022-04-28 15:35:34,077 INFO L290 TraceCheckUtils]: 18: Hoare triple {33358#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {33358#true} is VALID [2022-04-28 15:35:34,077 INFO L290 TraceCheckUtils]: 19: Hoare triple {33358#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {33358#true} is VALID [2022-04-28 15:35:34,077 INFO L290 TraceCheckUtils]: 20: Hoare triple {33358#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {33358#true} is VALID [2022-04-28 15:35:34,077 INFO L290 TraceCheckUtils]: 21: Hoare triple {33358#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {33358#true} is VALID [2022-04-28 15:35:34,077 INFO L290 TraceCheckUtils]: 22: Hoare triple {33358#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {33358#true} is VALID [2022-04-28 15:35:34,077 INFO L290 TraceCheckUtils]: 23: Hoare triple {33358#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {33358#true} is VALID [2022-04-28 15:35:34,077 INFO L290 TraceCheckUtils]: 24: Hoare triple {33358#true} assume 8464 == #t~mem55;havoc #t~mem55; {33358#true} is VALID [2022-04-28 15:35:34,077 INFO L290 TraceCheckUtils]: 25: Hoare triple {33358#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {33358#true} is VALID [2022-04-28 15:35:34,077 INFO L290 TraceCheckUtils]: 26: Hoare triple {33358#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {33358#true} is VALID [2022-04-28 15:35:34,077 INFO L290 TraceCheckUtils]: 27: Hoare triple {33358#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {33358#true} is VALID [2022-04-28 15:35:34,077 INFO L290 TraceCheckUtils]: 28: Hoare triple {33358#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {33358#true} is VALID [2022-04-28 15:35:34,077 INFO L290 TraceCheckUtils]: 29: Hoare triple {33358#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {33358#true} is VALID [2022-04-28 15:35:34,077 INFO L290 TraceCheckUtils]: 30: Hoare triple {33358#true} ~skip~0 := 0; {33358#true} is VALID [2022-04-28 15:35:34,077 INFO L290 TraceCheckUtils]: 31: Hoare triple {33358#true} assume !false; {33358#true} is VALID [2022-04-28 15:35:34,078 INFO L290 TraceCheckUtils]: 32: Hoare triple {33358#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {33358#true} is VALID [2022-04-28 15:35:34,078 INFO L290 TraceCheckUtils]: 33: Hoare triple {33358#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {33358#true} is VALID [2022-04-28 15:35:34,078 INFO L290 TraceCheckUtils]: 34: Hoare triple {33358#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {33358#true} is VALID [2022-04-28 15:35:34,078 INFO L290 TraceCheckUtils]: 35: Hoare triple {33358#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {33358#true} is VALID [2022-04-28 15:35:34,078 INFO L290 TraceCheckUtils]: 36: Hoare triple {33358#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {33358#true} is VALID [2022-04-28 15:35:34,078 INFO L290 TraceCheckUtils]: 37: Hoare triple {33358#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {33358#true} is VALID [2022-04-28 15:35:34,078 INFO L290 TraceCheckUtils]: 38: Hoare triple {33358#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {33358#true} is VALID [2022-04-28 15:35:34,078 INFO L290 TraceCheckUtils]: 39: Hoare triple {33358#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {33358#true} is VALID [2022-04-28 15:35:34,078 INFO L290 TraceCheckUtils]: 40: Hoare triple {33358#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {33358#true} is VALID [2022-04-28 15:35:34,078 INFO L290 TraceCheckUtils]: 41: Hoare triple {33358#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {33358#true} is VALID [2022-04-28 15:35:34,078 INFO L290 TraceCheckUtils]: 42: Hoare triple {33358#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {33358#true} is VALID [2022-04-28 15:35:34,078 INFO L290 TraceCheckUtils]: 43: Hoare triple {33358#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {33358#true} is VALID [2022-04-28 15:35:34,078 INFO L290 TraceCheckUtils]: 44: Hoare triple {33358#true} assume 8496 == #t~mem58;havoc #t~mem58; {33358#true} is VALID [2022-04-28 15:35:34,078 INFO L290 TraceCheckUtils]: 45: Hoare triple {33358#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {33358#true} is VALID [2022-04-28 15:35:34,078 INFO L290 TraceCheckUtils]: 46: Hoare triple {33358#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {33358#true} is VALID [2022-04-28 15:35:34,079 INFO L290 TraceCheckUtils]: 47: Hoare triple {33358#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {33358#true} is VALID [2022-04-28 15:35:34,079 INFO L290 TraceCheckUtils]: 48: Hoare triple {33358#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {33363#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:35:34,080 INFO L290 TraceCheckUtils]: 49: Hoare triple {33363#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {33363#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:35:34,080 INFO L290 TraceCheckUtils]: 50: Hoare triple {33363#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {33363#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:35:34,080 INFO L290 TraceCheckUtils]: 51: Hoare triple {33363#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {33363#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:35:34,081 INFO L290 TraceCheckUtils]: 52: Hoare triple {33363#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {33363#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:35:34,081 INFO L290 TraceCheckUtils]: 53: Hoare triple {33363#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {33363#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:35:34,081 INFO L290 TraceCheckUtils]: 54: Hoare triple {33363#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {33363#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:35:34,082 INFO L290 TraceCheckUtils]: 55: Hoare triple {33363#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {33363#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:35:34,082 INFO L290 TraceCheckUtils]: 56: Hoare triple {33363#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {33363#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:35:34,082 INFO L290 TraceCheckUtils]: 57: Hoare triple {33363#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {33363#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:35:34,083 INFO L290 TraceCheckUtils]: 58: Hoare triple {33363#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {33363#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:35:34,083 INFO L290 TraceCheckUtils]: 59: Hoare triple {33363#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {33364#(= |ssl3_accept_#t~mem52| 8656)} is VALID [2022-04-28 15:35:34,083 INFO L290 TraceCheckUtils]: 60: Hoare triple {33364#(= |ssl3_accept_#t~mem52| 8656)} assume 8480 == #t~mem52;havoc #t~mem52; {33359#false} is VALID [2022-04-28 15:35:34,083 INFO L290 TraceCheckUtils]: 61: Hoare triple {33359#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {33359#false} is VALID [2022-04-28 15:35:34,084 INFO L290 TraceCheckUtils]: 62: Hoare triple {33359#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8482, #t~mem91.base, 904 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {33359#false} is VALID [2022-04-28 15:35:34,084 INFO L290 TraceCheckUtils]: 63: Hoare triple {33359#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {33359#false} is VALID [2022-04-28 15:35:34,084 INFO L290 TraceCheckUtils]: 64: Hoare triple {33359#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {33359#false} is VALID [2022-04-28 15:35:34,084 INFO L290 TraceCheckUtils]: 65: Hoare triple {33359#false} ~skip~0 := 0; {33359#false} is VALID [2022-04-28 15:35:34,084 INFO L290 TraceCheckUtils]: 66: Hoare triple {33359#false} assume !false; {33359#false} is VALID [2022-04-28 15:35:34,084 INFO L290 TraceCheckUtils]: 67: Hoare triple {33359#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {33359#false} is VALID [2022-04-28 15:35:34,084 INFO L290 TraceCheckUtils]: 68: Hoare triple {33359#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {33359#false} is VALID [2022-04-28 15:35:34,084 INFO L290 TraceCheckUtils]: 69: Hoare triple {33359#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {33359#false} is VALID [2022-04-28 15:35:34,084 INFO L290 TraceCheckUtils]: 70: Hoare triple {33359#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {33359#false} is VALID [2022-04-28 15:35:34,084 INFO L290 TraceCheckUtils]: 71: Hoare triple {33359#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {33359#false} is VALID [2022-04-28 15:35:34,084 INFO L290 TraceCheckUtils]: 72: Hoare triple {33359#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {33359#false} is VALID [2022-04-28 15:35:34,084 INFO L290 TraceCheckUtils]: 73: Hoare triple {33359#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {33359#false} is VALID [2022-04-28 15:35:34,084 INFO L290 TraceCheckUtils]: 74: Hoare triple {33359#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {33359#false} is VALID [2022-04-28 15:35:34,084 INFO L290 TraceCheckUtils]: 75: Hoare triple {33359#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {33359#false} is VALID [2022-04-28 15:35:34,094 INFO L290 TraceCheckUtils]: 76: Hoare triple {33359#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {33359#false} is VALID [2022-04-28 15:35:34,094 INFO L290 TraceCheckUtils]: 77: Hoare triple {33359#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {33359#false} is VALID [2022-04-28 15:35:34,094 INFO L290 TraceCheckUtils]: 78: Hoare triple {33359#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {33359#false} is VALID [2022-04-28 15:35:34,094 INFO L290 TraceCheckUtils]: 79: Hoare triple {33359#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {33359#false} is VALID [2022-04-28 15:35:34,094 INFO L290 TraceCheckUtils]: 80: Hoare triple {33359#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {33359#false} is VALID [2022-04-28 15:35:34,095 INFO L290 TraceCheckUtils]: 81: Hoare triple {33359#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {33359#false} is VALID [2022-04-28 15:35:34,095 INFO L290 TraceCheckUtils]: 82: Hoare triple {33359#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {33359#false} is VALID [2022-04-28 15:35:34,095 INFO L290 TraceCheckUtils]: 83: Hoare triple {33359#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {33359#false} is VALID [2022-04-28 15:35:34,095 INFO L290 TraceCheckUtils]: 84: Hoare triple {33359#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {33359#false} is VALID [2022-04-28 15:35:34,095 INFO L290 TraceCheckUtils]: 85: Hoare triple {33359#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {33359#false} is VALID [2022-04-28 15:35:34,095 INFO L290 TraceCheckUtils]: 86: Hoare triple {33359#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {33359#false} is VALID [2022-04-28 15:35:34,095 INFO L290 TraceCheckUtils]: 87: Hoare triple {33359#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {33359#false} is VALID [2022-04-28 15:35:34,095 INFO L290 TraceCheckUtils]: 88: Hoare triple {33359#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {33359#false} is VALID [2022-04-28 15:35:34,095 INFO L290 TraceCheckUtils]: 89: Hoare triple {33359#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {33359#false} is VALID [2022-04-28 15:35:34,095 INFO L290 TraceCheckUtils]: 90: Hoare triple {33359#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {33359#false} is VALID [2022-04-28 15:35:34,095 INFO L290 TraceCheckUtils]: 91: Hoare triple {33359#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {33359#false} is VALID [2022-04-28 15:35:34,095 INFO L290 TraceCheckUtils]: 92: Hoare triple {33359#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {33359#false} is VALID [2022-04-28 15:35:34,095 INFO L290 TraceCheckUtils]: 93: Hoare triple {33359#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {33359#false} is VALID [2022-04-28 15:35:34,095 INFO L290 TraceCheckUtils]: 94: Hoare triple {33359#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {33359#false} is VALID [2022-04-28 15:35:34,096 INFO L290 TraceCheckUtils]: 95: Hoare triple {33359#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {33359#false} is VALID [2022-04-28 15:35:34,096 INFO L290 TraceCheckUtils]: 96: Hoare triple {33359#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {33359#false} is VALID [2022-04-28 15:35:34,096 INFO L290 TraceCheckUtils]: 97: Hoare triple {33359#false} assume 8641 == #t~mem76;havoc #t~mem76; {33359#false} is VALID [2022-04-28 15:35:34,096 INFO L290 TraceCheckUtils]: 98: Hoare triple {33359#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {33359#false} is VALID [2022-04-28 15:35:34,096 INFO L290 TraceCheckUtils]: 99: Hoare triple {33359#false} assume !(4 == ~blastFlag~0); {33359#false} is VALID [2022-04-28 15:35:34,096 INFO L290 TraceCheckUtils]: 100: Hoare triple {33359#false} assume !(7 == ~blastFlag~0); {33359#false} is VALID [2022-04-28 15:35:34,096 INFO L290 TraceCheckUtils]: 101: Hoare triple {33359#false} assume !(10 == ~blastFlag~0); {33359#false} is VALID [2022-04-28 15:35:34,096 INFO L290 TraceCheckUtils]: 102: Hoare triple {33359#false} assume !false; {33359#false} is VALID [2022-04-28 15:35:34,096 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 15:35:34,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:35:34,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933743850] [2022-04-28 15:35:34,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933743850] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:35:34,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:35:34,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:35:34,097 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:35:34,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1651924330] [2022-04-28 15:35:34,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1651924330] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:35:34,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:35:34,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:35:34,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591089284] [2022-04-28 15:35:34,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:35:34,097 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 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 103 [2022-04-28 15:35:34,098 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:35:34,098 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 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-28 15:35:34,162 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-28 15:35:34,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:35:34,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:35:34,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:35:34,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:35:34,163 INFO L87 Difference]: Start difference. First operand 318 states and 481 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 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-28 15:35:38,071 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:35:44,093 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:35:45,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:35:45,165 INFO L93 Difference]: Finished difference Result 665 states and 1009 transitions. [2022-04-28 15:35:45,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:35:45,166 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 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 103 [2022-04-28 15:35:45,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:35:45,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 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-28 15:35:45,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 569 transitions. [2022-04-28 15:35:45,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 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-28 15:35:45,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 569 transitions. [2022-04-28 15:35:45,183 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 569 transitions. [2022-04-28 15:35:45,542 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 569 edges. 569 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:35:45,548 INFO L225 Difference]: With dead ends: 665 [2022-04-28 15:35:45,548 INFO L226 Difference]: Without dead ends: 373 [2022-04-28 15:35:45,549 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-28 15:35:45,549 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 105 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-04-28 15:35:45,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 485 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-04-28 15:35:45,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2022-04-28 15:35:45,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 318. [2022-04-28 15:35:45,558 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:35:45,558 INFO L82 GeneralOperation]: Start isEquivalent. First operand 373 states. Second operand has 318 states, 313 states have (on average 1.5207667731629393) internal successors, (476), 313 states have internal predecessors, (476), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:35:45,559 INFO L74 IsIncluded]: Start isIncluded. First operand 373 states. Second operand has 318 states, 313 states have (on average 1.5207667731629393) internal successors, (476), 313 states have internal predecessors, (476), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:35:45,559 INFO L87 Difference]: Start difference. First operand 373 states. Second operand has 318 states, 313 states have (on average 1.5207667731629393) internal successors, (476), 313 states have internal predecessors, (476), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:35:45,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:35:45,563 INFO L93 Difference]: Finished difference Result 373 states and 557 transitions. [2022-04-28 15:35:45,564 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 557 transitions. [2022-04-28 15:35:45,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:35:45,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:35:45,564 INFO L74 IsIncluded]: Start isIncluded. First operand has 318 states, 313 states have (on average 1.5207667731629393) internal successors, (476), 313 states have internal predecessors, (476), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 373 states. [2022-04-28 15:35:45,565 INFO L87 Difference]: Start difference. First operand has 318 states, 313 states have (on average 1.5207667731629393) internal successors, (476), 313 states have internal predecessors, (476), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 373 states. [2022-04-28 15:35:45,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:35:45,572 INFO L93 Difference]: Finished difference Result 373 states and 557 transitions. [2022-04-28 15:35:45,572 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 557 transitions. [2022-04-28 15:35:45,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:35:45,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:35:45,572 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:35:45,572 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:35:45,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 313 states have (on average 1.5207667731629393) internal successors, (476), 313 states have internal predecessors, (476), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:35:45,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 480 transitions. [2022-04-28 15:35:45,578 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 480 transitions. Word has length 103 [2022-04-28 15:35:45,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:35:45,578 INFO L495 AbstractCegarLoop]: Abstraction has 318 states and 480 transitions. [2022-04-28 15:35:45,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 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-28 15:35:45,578 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 318 states and 480 transitions. [2022-04-28 15:35:45,902 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 480 edges. 480 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:35:45,902 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 480 transitions. [2022-04-28 15:35:45,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-28 15:35:45,903 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:35:45,904 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:35:45,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-28 15:35:45,904 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:35:45,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:35:45,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1399159801, now seen corresponding path program 1 times [2022-04-28 15:35:45,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:35:45,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1432510004] [2022-04-28 15:35:45,936 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:35:45,936 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:35:45,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1399159801, now seen corresponding path program 2 times [2022-04-28 15:35:45,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:35:45,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514477538] [2022-04-28 15:35:45,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:35:45,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:35:45,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:35:46,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:35:46,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:35:46,054 INFO L290 TraceCheckUtils]: 0: Hoare triple {36089#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {36082#true} is VALID [2022-04-28 15:35:46,054 INFO L290 TraceCheckUtils]: 1: Hoare triple {36082#true} assume true; {36082#true} is VALID [2022-04-28 15:35:46,054 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36082#true} {36082#true} #703#return; {36082#true} is VALID [2022-04-28 15:35:46,055 INFO L272 TraceCheckUtils]: 0: Hoare triple {36082#true} call ULTIMATE.init(); {36089#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-28 15:35:46,055 INFO L290 TraceCheckUtils]: 1: Hoare triple {36089#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {36082#true} is VALID [2022-04-28 15:35:46,055 INFO L290 TraceCheckUtils]: 2: Hoare triple {36082#true} assume true; {36082#true} is VALID [2022-04-28 15:35:46,055 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36082#true} {36082#true} #703#return; {36082#true} is VALID [2022-04-28 15:35:46,055 INFO L272 TraceCheckUtils]: 4: Hoare triple {36082#true} call #t~ret161 := main(); {36082#true} is VALID [2022-04-28 15:35:46,055 INFO L290 TraceCheckUtils]: 5: Hoare triple {36082#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {36082#true} is VALID [2022-04-28 15:35:46,055 INFO L290 TraceCheckUtils]: 6: Hoare triple {36082#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {36082#true} is VALID [2022-04-28 15:35:46,056 INFO L272 TraceCheckUtils]: 7: Hoare triple {36082#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {36082#true} is VALID [2022-04-28 15:35:46,056 INFO L290 TraceCheckUtils]: 8: Hoare triple {36082#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {36082#true} is VALID [2022-04-28 15:35:46,056 INFO L290 TraceCheckUtils]: 9: Hoare triple {36082#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {36082#true} is VALID [2022-04-28 15:35:46,056 INFO L290 TraceCheckUtils]: 10: Hoare triple {36082#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {36082#true} is VALID [2022-04-28 15:35:46,056 INFO L290 TraceCheckUtils]: 11: Hoare triple {36082#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {36082#true} is VALID [2022-04-28 15:35:46,056 INFO L290 TraceCheckUtils]: 12: Hoare triple {36082#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {36082#true} is VALID [2022-04-28 15:35:46,056 INFO L290 TraceCheckUtils]: 13: Hoare triple {36082#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {36082#true} is VALID [2022-04-28 15:35:46,056 INFO L290 TraceCheckUtils]: 14: Hoare triple {36082#true} assume !false; {36082#true} is VALID [2022-04-28 15:35:46,056 INFO L290 TraceCheckUtils]: 15: Hoare triple {36082#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {36082#true} is VALID [2022-04-28 15:35:46,056 INFO L290 TraceCheckUtils]: 16: Hoare triple {36082#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {36082#true} is VALID [2022-04-28 15:35:46,056 INFO L290 TraceCheckUtils]: 17: Hoare triple {36082#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {36082#true} is VALID [2022-04-28 15:35:46,056 INFO L290 TraceCheckUtils]: 18: Hoare triple {36082#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {36082#true} is VALID [2022-04-28 15:35:46,056 INFO L290 TraceCheckUtils]: 19: Hoare triple {36082#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {36082#true} is VALID [2022-04-28 15:35:46,056 INFO L290 TraceCheckUtils]: 20: Hoare triple {36082#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {36082#true} is VALID [2022-04-28 15:35:46,056 INFO L290 TraceCheckUtils]: 21: Hoare triple {36082#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {36082#true} is VALID [2022-04-28 15:35:46,057 INFO L290 TraceCheckUtils]: 22: Hoare triple {36082#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {36082#true} is VALID [2022-04-28 15:35:46,057 INFO L290 TraceCheckUtils]: 23: Hoare triple {36082#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {36082#true} is VALID [2022-04-28 15:35:46,057 INFO L290 TraceCheckUtils]: 24: Hoare triple {36082#true} assume 8464 == #t~mem55;havoc #t~mem55; {36082#true} is VALID [2022-04-28 15:35:46,057 INFO L290 TraceCheckUtils]: 25: Hoare triple {36082#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {36082#true} is VALID [2022-04-28 15:35:46,057 INFO L290 TraceCheckUtils]: 26: Hoare triple {36082#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {36082#true} is VALID [2022-04-28 15:35:46,057 INFO L290 TraceCheckUtils]: 27: Hoare triple {36082#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {36082#true} is VALID [2022-04-28 15:35:46,057 INFO L290 TraceCheckUtils]: 28: Hoare triple {36082#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {36082#true} is VALID [2022-04-28 15:35:46,057 INFO L290 TraceCheckUtils]: 29: Hoare triple {36082#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {36082#true} is VALID [2022-04-28 15:35:46,057 INFO L290 TraceCheckUtils]: 30: Hoare triple {36082#true} ~skip~0 := 0; {36082#true} is VALID [2022-04-28 15:35:46,057 INFO L290 TraceCheckUtils]: 31: Hoare triple {36082#true} assume !false; {36082#true} is VALID [2022-04-28 15:35:46,057 INFO L290 TraceCheckUtils]: 32: Hoare triple {36082#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {36082#true} is VALID [2022-04-28 15:35:46,057 INFO L290 TraceCheckUtils]: 33: Hoare triple {36082#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {36082#true} is VALID [2022-04-28 15:35:46,057 INFO L290 TraceCheckUtils]: 34: Hoare triple {36082#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {36082#true} is VALID [2022-04-28 15:35:46,057 INFO L290 TraceCheckUtils]: 35: Hoare triple {36082#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {36082#true} is VALID [2022-04-28 15:35:46,058 INFO L290 TraceCheckUtils]: 36: Hoare triple {36082#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {36082#true} is VALID [2022-04-28 15:35:46,058 INFO L290 TraceCheckUtils]: 37: Hoare triple {36082#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {36082#true} is VALID [2022-04-28 15:35:46,058 INFO L290 TraceCheckUtils]: 38: Hoare triple {36082#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {36082#true} is VALID [2022-04-28 15:35:46,058 INFO L290 TraceCheckUtils]: 39: Hoare triple {36082#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {36082#true} is VALID [2022-04-28 15:35:46,058 INFO L290 TraceCheckUtils]: 40: Hoare triple {36082#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {36082#true} is VALID [2022-04-28 15:35:46,058 INFO L290 TraceCheckUtils]: 41: Hoare triple {36082#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {36082#true} is VALID [2022-04-28 15:35:46,058 INFO L290 TraceCheckUtils]: 42: Hoare triple {36082#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {36082#true} is VALID [2022-04-28 15:35:46,058 INFO L290 TraceCheckUtils]: 43: Hoare triple {36082#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {36082#true} is VALID [2022-04-28 15:35:46,058 INFO L290 TraceCheckUtils]: 44: Hoare triple {36082#true} assume 8496 == #t~mem58;havoc #t~mem58; {36082#true} is VALID [2022-04-28 15:35:46,058 INFO L290 TraceCheckUtils]: 45: Hoare triple {36082#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {36082#true} is VALID [2022-04-28 15:35:46,058 INFO L290 TraceCheckUtils]: 46: Hoare triple {36082#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {36082#true} is VALID [2022-04-28 15:35:46,058 INFO L290 TraceCheckUtils]: 47: Hoare triple {36082#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {36082#true} is VALID [2022-04-28 15:35:46,059 INFO L290 TraceCheckUtils]: 48: Hoare triple {36082#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 72 + ~s.offset, 4); {36087#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-28 15:35:46,060 INFO L290 TraceCheckUtils]: 49: Hoare triple {36087#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {36087#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-28 15:35:46,060 INFO L290 TraceCheckUtils]: 50: Hoare triple {36087#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {36087#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-28 15:35:46,060 INFO L290 TraceCheckUtils]: 51: Hoare triple {36087#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {36087#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-28 15:35:46,061 INFO L290 TraceCheckUtils]: 52: Hoare triple {36087#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} ~skip~0 := 0; {36087#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-28 15:35:46,061 INFO L290 TraceCheckUtils]: 53: Hoare triple {36087#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} assume !false; {36087#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-28 15:35:46,061 INFO L290 TraceCheckUtils]: 54: Hoare triple {36087#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {36087#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-28 15:35:46,062 INFO L290 TraceCheckUtils]: 55: Hoare triple {36087#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {36087#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-28 15:35:46,062 INFO L290 TraceCheckUtils]: 56: Hoare triple {36087#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {36087#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-28 15:35:46,062 INFO L290 TraceCheckUtils]: 57: Hoare triple {36087#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {36087#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-28 15:35:46,063 INFO L290 TraceCheckUtils]: 58: Hoare triple {36087#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {36087#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-28 15:35:46,063 INFO L290 TraceCheckUtils]: 59: Hoare triple {36087#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {36088#(not (= |ssl3_accept_#t~mem52| 8480))} is VALID [2022-04-28 15:35:46,063 INFO L290 TraceCheckUtils]: 60: Hoare triple {36088#(not (= |ssl3_accept_#t~mem52| 8480))} assume 8480 == #t~mem52;havoc #t~mem52; {36083#false} is VALID [2022-04-28 15:35:46,063 INFO L290 TraceCheckUtils]: 61: Hoare triple {36083#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {36083#false} is VALID [2022-04-28 15:35:46,063 INFO L290 TraceCheckUtils]: 62: Hoare triple {36083#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8482, #t~mem91.base, 904 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {36083#false} is VALID [2022-04-28 15:35:46,064 INFO L290 TraceCheckUtils]: 63: Hoare triple {36083#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {36083#false} is VALID [2022-04-28 15:35:46,064 INFO L290 TraceCheckUtils]: 64: Hoare triple {36083#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {36083#false} is VALID [2022-04-28 15:35:46,064 INFO L290 TraceCheckUtils]: 65: Hoare triple {36083#false} ~skip~0 := 0; {36083#false} is VALID [2022-04-28 15:35:46,064 INFO L290 TraceCheckUtils]: 66: Hoare triple {36083#false} assume !false; {36083#false} is VALID [2022-04-28 15:35:46,064 INFO L290 TraceCheckUtils]: 67: Hoare triple {36083#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {36083#false} is VALID [2022-04-28 15:35:46,064 INFO L290 TraceCheckUtils]: 68: Hoare triple {36083#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {36083#false} is VALID [2022-04-28 15:35:46,064 INFO L290 TraceCheckUtils]: 69: Hoare triple {36083#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {36083#false} is VALID [2022-04-28 15:35:46,064 INFO L290 TraceCheckUtils]: 70: Hoare triple {36083#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {36083#false} is VALID [2022-04-28 15:35:46,064 INFO L290 TraceCheckUtils]: 71: Hoare triple {36083#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {36083#false} is VALID [2022-04-28 15:35:46,064 INFO L290 TraceCheckUtils]: 72: Hoare triple {36083#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {36083#false} is VALID [2022-04-28 15:35:46,064 INFO L290 TraceCheckUtils]: 73: Hoare triple {36083#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {36083#false} is VALID [2022-04-28 15:35:46,064 INFO L290 TraceCheckUtils]: 74: Hoare triple {36083#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {36083#false} is VALID [2022-04-28 15:35:46,064 INFO L290 TraceCheckUtils]: 75: Hoare triple {36083#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {36083#false} is VALID [2022-04-28 15:35:46,064 INFO L290 TraceCheckUtils]: 76: Hoare triple {36083#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {36083#false} is VALID [2022-04-28 15:35:46,065 INFO L290 TraceCheckUtils]: 77: Hoare triple {36083#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {36083#false} is VALID [2022-04-28 15:35:46,065 INFO L290 TraceCheckUtils]: 78: Hoare triple {36083#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {36083#false} is VALID [2022-04-28 15:35:46,065 INFO L290 TraceCheckUtils]: 79: Hoare triple {36083#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {36083#false} is VALID [2022-04-28 15:35:46,065 INFO L290 TraceCheckUtils]: 80: Hoare triple {36083#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {36083#false} is VALID [2022-04-28 15:35:46,065 INFO L290 TraceCheckUtils]: 81: Hoare triple {36083#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {36083#false} is VALID [2022-04-28 15:35:46,065 INFO L290 TraceCheckUtils]: 82: Hoare triple {36083#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {36083#false} is VALID [2022-04-28 15:35:46,065 INFO L290 TraceCheckUtils]: 83: Hoare triple {36083#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {36083#false} is VALID [2022-04-28 15:35:46,065 INFO L290 TraceCheckUtils]: 84: Hoare triple {36083#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {36083#false} is VALID [2022-04-28 15:35:46,065 INFO L290 TraceCheckUtils]: 85: Hoare triple {36083#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {36083#false} is VALID [2022-04-28 15:35:46,065 INFO L290 TraceCheckUtils]: 86: Hoare triple {36083#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {36083#false} is VALID [2022-04-28 15:35:46,065 INFO L290 TraceCheckUtils]: 87: Hoare triple {36083#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {36083#false} is VALID [2022-04-28 15:35:46,065 INFO L290 TraceCheckUtils]: 88: Hoare triple {36083#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {36083#false} is VALID [2022-04-28 15:35:46,065 INFO L290 TraceCheckUtils]: 89: Hoare triple {36083#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {36083#false} is VALID [2022-04-28 15:35:46,065 INFO L290 TraceCheckUtils]: 90: Hoare triple {36083#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {36083#false} is VALID [2022-04-28 15:35:46,066 INFO L290 TraceCheckUtils]: 91: Hoare triple {36083#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {36083#false} is VALID [2022-04-28 15:35:46,066 INFO L290 TraceCheckUtils]: 92: Hoare triple {36083#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {36083#false} is VALID [2022-04-28 15:35:46,066 INFO L290 TraceCheckUtils]: 93: Hoare triple {36083#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {36083#false} is VALID [2022-04-28 15:35:46,066 INFO L290 TraceCheckUtils]: 94: Hoare triple {36083#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {36083#false} is VALID [2022-04-28 15:35:46,066 INFO L290 TraceCheckUtils]: 95: Hoare triple {36083#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {36083#false} is VALID [2022-04-28 15:35:46,066 INFO L290 TraceCheckUtils]: 96: Hoare triple {36083#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {36083#false} is VALID [2022-04-28 15:35:46,066 INFO L290 TraceCheckUtils]: 97: Hoare triple {36083#false} assume 8641 == #t~mem76;havoc #t~mem76; {36083#false} is VALID [2022-04-28 15:35:46,066 INFO L290 TraceCheckUtils]: 98: Hoare triple {36083#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {36083#false} is VALID [2022-04-28 15:35:46,066 INFO L290 TraceCheckUtils]: 99: Hoare triple {36083#false} assume !(4 == ~blastFlag~0); {36083#false} is VALID [2022-04-28 15:35:46,066 INFO L290 TraceCheckUtils]: 100: Hoare triple {36083#false} assume !(7 == ~blastFlag~0); {36083#false} is VALID [2022-04-28 15:35:46,066 INFO L290 TraceCheckUtils]: 101: Hoare triple {36083#false} assume !(10 == ~blastFlag~0); {36083#false} is VALID [2022-04-28 15:35:46,066 INFO L290 TraceCheckUtils]: 102: Hoare triple {36083#false} assume !false; {36083#false} is VALID [2022-04-28 15:35:46,067 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 15:35:46,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:35:46,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514477538] [2022-04-28 15:35:46,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514477538] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:35:46,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:35:46,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:35:46,067 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:35:46,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1432510004] [2022-04-28 15:35:46,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1432510004] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:35:46,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:35:46,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:35:46,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908405417] [2022-04-28 15:35:46,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:35:46,069 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 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 103 [2022-04-28 15:35:46,069 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:35:46,069 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 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-28 15:35:46,133 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-28 15:35:46,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:35:46,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:35:46,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:35:46,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:35:46,135 INFO L87 Difference]: Start difference. First operand 318 states and 480 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 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-28 15:35:54,475 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-28 15:35:55,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:35:55,550 INFO L93 Difference]: Finished difference Result 707 states and 1081 transitions. [2022-04-28 15:35:55,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:35:55,550 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 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 103 [2022-04-28 15:35:55,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:35:55,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 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-28 15:35:55,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 599 transitions. [2022-04-28 15:35:55,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 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-28 15:35:55,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 599 transitions. [2022-04-28 15:35:55,555 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 599 transitions. [2022-04-28 15:35:55,888 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-28 15:35:55,895 INFO L225 Difference]: With dead ends: 707 [2022-04-28 15:35:55,895 INFO L226 Difference]: Without dead ends: 415 [2022-04-28 15:35:55,896 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-28 15:35:55,903 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 142 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-04-28 15:35:55,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 370 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-04-28 15:35:55,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2022-04-28 15:35:55,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 318. [2022-04-28 15:35:55,932 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:35:55,933 INFO L82 GeneralOperation]: Start isEquivalent. First operand 415 states. Second operand has 318 states, 313 states have (on average 1.511182108626198) internal successors, (473), 313 states have internal predecessors, (473), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:35:55,947 INFO L74 IsIncluded]: Start isIncluded. First operand 415 states. Second operand has 318 states, 313 states have (on average 1.511182108626198) internal successors, (473), 313 states have internal predecessors, (473), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:35:55,948 INFO L87 Difference]: Start difference. First operand 415 states. Second operand has 318 states, 313 states have (on average 1.511182108626198) internal successors, (473), 313 states have internal predecessors, (473), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:35:55,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:35:55,954 INFO L93 Difference]: Finished difference Result 415 states and 628 transitions. [2022-04-28 15:35:55,954 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 628 transitions. [2022-04-28 15:35:55,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:35:55,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:35:55,955 INFO L74 IsIncluded]: Start isIncluded. First operand has 318 states, 313 states have (on average 1.511182108626198) internal successors, (473), 313 states have internal predecessors, (473), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 415 states. [2022-04-28 15:35:55,955 INFO L87 Difference]: Start difference. First operand has 318 states, 313 states have (on average 1.511182108626198) internal successors, (473), 313 states have internal predecessors, (473), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 415 states. [2022-04-28 15:35:55,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:35:55,961 INFO L93 Difference]: Finished difference Result 415 states and 628 transitions. [2022-04-28 15:35:55,961 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 628 transitions. [2022-04-28 15:35:55,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:35:55,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:35:55,961 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:35:55,962 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:35:55,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 313 states have (on average 1.511182108626198) internal successors, (473), 313 states have internal predecessors, (473), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:35:55,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 477 transitions. [2022-04-28 15:35:55,966 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 477 transitions. Word has length 103 [2022-04-28 15:35:55,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:35:55,967 INFO L495 AbstractCegarLoop]: Abstraction has 318 states and 477 transitions. [2022-04-28 15:35:55,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 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-28 15:35:55,967 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 318 states and 477 transitions. [2022-04-28 15:35:56,328 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 477 edges. 477 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:35:56,328 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 477 transitions. [2022-04-28 15:35:56,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-04-28 15:35:56,329 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:35:56,329 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:35:56,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-28 15:35:56,329 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:35:56,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:35:56,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1258658765, now seen corresponding path program 1 times [2022-04-28 15:35:56,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:35:56,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1970240564] [2022-04-28 15:35:56,381 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:35:56,381 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:35:56,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1258658765, now seen corresponding path program 2 times [2022-04-28 15:35:56,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:35:56,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260263518] [2022-04-28 15:35:56,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:35:56,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:35:56,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:35:56,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:35:56,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:35:56,513 INFO L290 TraceCheckUtils]: 0: Hoare triple {38981#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {38974#true} is VALID [2022-04-28 15:35:56,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {38974#true} assume true; {38974#true} is VALID [2022-04-28 15:35:56,513 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38974#true} {38974#true} #703#return; {38974#true} is VALID [2022-04-28 15:35:56,514 INFO L272 TraceCheckUtils]: 0: Hoare triple {38974#true} call ULTIMATE.init(); {38981#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-28 15:35:56,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {38981#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {38974#true} is VALID [2022-04-28 15:35:56,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {38974#true} assume true; {38974#true} is VALID [2022-04-28 15:35:56,514 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38974#true} {38974#true} #703#return; {38974#true} is VALID [2022-04-28 15:35:56,514 INFO L272 TraceCheckUtils]: 4: Hoare triple {38974#true} call #t~ret161 := main(); {38974#true} is VALID [2022-04-28 15:35:56,514 INFO L290 TraceCheckUtils]: 5: Hoare triple {38974#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {38974#true} is VALID [2022-04-28 15:35:56,514 INFO L290 TraceCheckUtils]: 6: Hoare triple {38974#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {38974#true} is VALID [2022-04-28 15:35:56,514 INFO L272 TraceCheckUtils]: 7: Hoare triple {38974#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {38974#true} is VALID [2022-04-28 15:35:56,514 INFO L290 TraceCheckUtils]: 8: Hoare triple {38974#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {38974#true} is VALID [2022-04-28 15:35:56,514 INFO L290 TraceCheckUtils]: 9: Hoare triple {38974#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {38974#true} is VALID [2022-04-28 15:35:56,514 INFO L290 TraceCheckUtils]: 10: Hoare triple {38974#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {38974#true} is VALID [2022-04-28 15:35:56,514 INFO L290 TraceCheckUtils]: 11: Hoare triple {38974#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {38974#true} is VALID [2022-04-28 15:35:56,514 INFO L290 TraceCheckUtils]: 12: Hoare triple {38974#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {38974#true} is VALID [2022-04-28 15:35:56,514 INFO L290 TraceCheckUtils]: 13: Hoare triple {38974#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {38974#true} is VALID [2022-04-28 15:35:56,515 INFO L290 TraceCheckUtils]: 14: Hoare triple {38974#true} assume !false; {38974#true} is VALID [2022-04-28 15:35:56,515 INFO L290 TraceCheckUtils]: 15: Hoare triple {38974#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {38974#true} is VALID [2022-04-28 15:35:56,515 INFO L290 TraceCheckUtils]: 16: Hoare triple {38974#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {38974#true} is VALID [2022-04-28 15:35:56,515 INFO L290 TraceCheckUtils]: 17: Hoare triple {38974#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {38974#true} is VALID [2022-04-28 15:35:56,515 INFO L290 TraceCheckUtils]: 18: Hoare triple {38974#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {38974#true} is VALID [2022-04-28 15:35:56,515 INFO L290 TraceCheckUtils]: 19: Hoare triple {38974#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {38974#true} is VALID [2022-04-28 15:35:56,515 INFO L290 TraceCheckUtils]: 20: Hoare triple {38974#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {38974#true} is VALID [2022-04-28 15:35:56,515 INFO L290 TraceCheckUtils]: 21: Hoare triple {38974#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {38974#true} is VALID [2022-04-28 15:35:56,515 INFO L290 TraceCheckUtils]: 22: Hoare triple {38974#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {38974#true} is VALID [2022-04-28 15:35:56,515 INFO L290 TraceCheckUtils]: 23: Hoare triple {38974#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {38974#true} is VALID [2022-04-28 15:35:56,515 INFO L290 TraceCheckUtils]: 24: Hoare triple {38974#true} assume 8464 == #t~mem55;havoc #t~mem55; {38974#true} is VALID [2022-04-28 15:35:56,515 INFO L290 TraceCheckUtils]: 25: Hoare triple {38974#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {38974#true} is VALID [2022-04-28 15:35:56,515 INFO L290 TraceCheckUtils]: 26: Hoare triple {38974#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {38974#true} is VALID [2022-04-28 15:35:56,515 INFO L290 TraceCheckUtils]: 27: Hoare triple {38974#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {38974#true} is VALID [2022-04-28 15:35:56,516 INFO L290 TraceCheckUtils]: 28: Hoare triple {38974#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {38974#true} is VALID [2022-04-28 15:35:56,516 INFO L290 TraceCheckUtils]: 29: Hoare triple {38974#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {38974#true} is VALID [2022-04-28 15:35:56,516 INFO L290 TraceCheckUtils]: 30: Hoare triple {38974#true} ~skip~0 := 0; {38974#true} is VALID [2022-04-28 15:35:56,516 INFO L290 TraceCheckUtils]: 31: Hoare triple {38974#true} assume !false; {38974#true} is VALID [2022-04-28 15:35:56,516 INFO L290 TraceCheckUtils]: 32: Hoare triple {38974#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {38974#true} is VALID [2022-04-28 15:35:56,516 INFO L290 TraceCheckUtils]: 33: Hoare triple {38974#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {38974#true} is VALID [2022-04-28 15:35:56,516 INFO L290 TraceCheckUtils]: 34: Hoare triple {38974#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {38974#true} is VALID [2022-04-28 15:35:56,516 INFO L290 TraceCheckUtils]: 35: Hoare triple {38974#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {38974#true} is VALID [2022-04-28 15:35:56,516 INFO L290 TraceCheckUtils]: 36: Hoare triple {38974#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {38974#true} is VALID [2022-04-28 15:35:56,516 INFO L290 TraceCheckUtils]: 37: Hoare triple {38974#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {38974#true} is VALID [2022-04-28 15:35:56,516 INFO L290 TraceCheckUtils]: 38: Hoare triple {38974#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {38974#true} is VALID [2022-04-28 15:35:56,516 INFO L290 TraceCheckUtils]: 39: Hoare triple {38974#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {38974#true} is VALID [2022-04-28 15:35:56,516 INFO L290 TraceCheckUtils]: 40: Hoare triple {38974#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {38974#true} is VALID [2022-04-28 15:35:56,516 INFO L290 TraceCheckUtils]: 41: Hoare triple {38974#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {38974#true} is VALID [2022-04-28 15:35:56,516 INFO L290 TraceCheckUtils]: 42: Hoare triple {38974#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {38974#true} is VALID [2022-04-28 15:35:56,517 INFO L290 TraceCheckUtils]: 43: Hoare triple {38974#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {38974#true} is VALID [2022-04-28 15:35:56,517 INFO L290 TraceCheckUtils]: 44: Hoare triple {38974#true} assume 8496 == #t~mem58;havoc #t~mem58; {38974#true} is VALID [2022-04-28 15:35:56,517 INFO L290 TraceCheckUtils]: 45: Hoare triple {38974#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {38974#true} is VALID [2022-04-28 15:35:56,517 INFO L290 TraceCheckUtils]: 46: Hoare triple {38974#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {38974#true} is VALID [2022-04-28 15:35:56,517 INFO L290 TraceCheckUtils]: 47: Hoare triple {38974#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {38974#true} is VALID [2022-04-28 15:35:56,517 INFO L290 TraceCheckUtils]: 48: Hoare triple {38974#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {38979#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:35:56,518 INFO L290 TraceCheckUtils]: 49: Hoare triple {38979#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {38979#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:35:56,518 INFO L290 TraceCheckUtils]: 50: Hoare triple {38979#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {38979#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:35:56,519 INFO L290 TraceCheckUtils]: 51: Hoare triple {38979#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {38979#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:35:56,519 INFO L290 TraceCheckUtils]: 52: Hoare triple {38979#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} ~skip~0 := 0; {38979#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:35:56,519 INFO L290 TraceCheckUtils]: 53: Hoare triple {38979#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {38979#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:35:56,520 INFO L290 TraceCheckUtils]: 54: Hoare triple {38979#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {38979#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:35:56,520 INFO L290 TraceCheckUtils]: 55: Hoare triple {38979#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {38979#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:35:56,520 INFO L290 TraceCheckUtils]: 56: Hoare triple {38979#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {38979#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:35:56,521 INFO L290 TraceCheckUtils]: 57: Hoare triple {38979#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {38980#(not (= 24576 |ssl3_accept_#t~mem50|))} is VALID [2022-04-28 15:35:56,521 INFO L290 TraceCheckUtils]: 58: Hoare triple {38980#(not (= 24576 |ssl3_accept_#t~mem50|))} assume 24576 == #t~mem50;havoc #t~mem50; {38975#false} is VALID [2022-04-28 15:35:56,521 INFO L290 TraceCheckUtils]: 59: Hoare triple {38975#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {38975#false} is VALID [2022-04-28 15:35:56,521 INFO L290 TraceCheckUtils]: 60: Hoare triple {38975#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {38975#false} is VALID [2022-04-28 15:35:56,521 INFO L290 TraceCheckUtils]: 61: Hoare triple {38975#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {38975#false} is VALID [2022-04-28 15:35:56,521 INFO L290 TraceCheckUtils]: 62: Hoare triple {38975#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, 80 + ~s.offset, 8); {38975#false} is VALID [2022-04-28 15:35:56,521 INFO L290 TraceCheckUtils]: 63: Hoare triple {38975#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {38975#false} is VALID [2022-04-28 15:35:56,521 INFO L290 TraceCheckUtils]: 64: Hoare triple {38975#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {38975#false} is VALID [2022-04-28 15:35:56,521 INFO L290 TraceCheckUtils]: 65: Hoare triple {38975#false} assume 12292 != #t~mem85;havoc #t~mem85; {38975#false} is VALID [2022-04-28 15:35:56,521 INFO L290 TraceCheckUtils]: 66: Hoare triple {38975#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 72 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem87 := read~int(#t~mem86.base, 128 + #t~mem86.offset, 4);call write~int(1 + #t~mem87, #t~mem86.base, 128 + #t~mem86.offset, 4);havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87; {38975#false} is VALID [2022-04-28 15:35:56,521 INFO L290 TraceCheckUtils]: 67: Hoare triple {38975#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {38975#false} is VALID [2022-04-28 15:35:56,522 INFO L290 TraceCheckUtils]: 68: Hoare triple {38975#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {38975#false} is VALID [2022-04-28 15:35:56,522 INFO L290 TraceCheckUtils]: 69: Hoare triple {38975#false} ~skip~0 := 0; {38975#false} is VALID [2022-04-28 15:35:56,522 INFO L290 TraceCheckUtils]: 70: Hoare triple {38975#false} assume !false; {38975#false} is VALID [2022-04-28 15:35:56,522 INFO L290 TraceCheckUtils]: 71: Hoare triple {38975#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {38975#false} is VALID [2022-04-28 15:35:56,522 INFO L290 TraceCheckUtils]: 72: Hoare triple {38975#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {38975#false} is VALID [2022-04-28 15:35:56,522 INFO L290 TraceCheckUtils]: 73: Hoare triple {38975#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {38975#false} is VALID [2022-04-28 15:35:56,522 INFO L290 TraceCheckUtils]: 74: Hoare triple {38975#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {38975#false} is VALID [2022-04-28 15:35:56,522 INFO L290 TraceCheckUtils]: 75: Hoare triple {38975#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {38975#false} is VALID [2022-04-28 15:35:56,522 INFO L290 TraceCheckUtils]: 76: Hoare triple {38975#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {38975#false} is VALID [2022-04-28 15:35:56,522 INFO L290 TraceCheckUtils]: 77: Hoare triple {38975#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {38975#false} is VALID [2022-04-28 15:35:56,522 INFO L290 TraceCheckUtils]: 78: Hoare triple {38975#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {38975#false} is VALID [2022-04-28 15:35:56,522 INFO L290 TraceCheckUtils]: 79: Hoare triple {38975#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {38975#false} is VALID [2022-04-28 15:35:56,522 INFO L290 TraceCheckUtils]: 80: Hoare triple {38975#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {38975#false} is VALID [2022-04-28 15:35:56,522 INFO L290 TraceCheckUtils]: 81: Hoare triple {38975#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {38975#false} is VALID [2022-04-28 15:35:56,522 INFO L290 TraceCheckUtils]: 82: Hoare triple {38975#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {38975#false} is VALID [2022-04-28 15:35:56,523 INFO L290 TraceCheckUtils]: 83: Hoare triple {38975#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {38975#false} is VALID [2022-04-28 15:35:56,523 INFO L290 TraceCheckUtils]: 84: Hoare triple {38975#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {38975#false} is VALID [2022-04-28 15:35:56,523 INFO L290 TraceCheckUtils]: 85: Hoare triple {38975#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {38975#false} is VALID [2022-04-28 15:35:56,523 INFO L290 TraceCheckUtils]: 86: Hoare triple {38975#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {38975#false} is VALID [2022-04-28 15:35:56,523 INFO L290 TraceCheckUtils]: 87: Hoare triple {38975#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {38975#false} is VALID [2022-04-28 15:35:56,523 INFO L290 TraceCheckUtils]: 88: Hoare triple {38975#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {38975#false} is VALID [2022-04-28 15:35:56,523 INFO L290 TraceCheckUtils]: 89: Hoare triple {38975#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {38975#false} is VALID [2022-04-28 15:35:56,523 INFO L290 TraceCheckUtils]: 90: Hoare triple {38975#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {38975#false} is VALID [2022-04-28 15:35:56,523 INFO L290 TraceCheckUtils]: 91: Hoare triple {38975#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {38975#false} is VALID [2022-04-28 15:35:56,523 INFO L290 TraceCheckUtils]: 92: Hoare triple {38975#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {38975#false} is VALID [2022-04-28 15:35:56,523 INFO L290 TraceCheckUtils]: 93: Hoare triple {38975#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {38975#false} is VALID [2022-04-28 15:35:56,523 INFO L290 TraceCheckUtils]: 94: Hoare triple {38975#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {38975#false} is VALID [2022-04-28 15:35:56,523 INFO L290 TraceCheckUtils]: 95: Hoare triple {38975#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {38975#false} is VALID [2022-04-28 15:35:56,523 INFO L290 TraceCheckUtils]: 96: Hoare triple {38975#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {38975#false} is VALID [2022-04-28 15:35:56,524 INFO L290 TraceCheckUtils]: 97: Hoare triple {38975#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {38975#false} is VALID [2022-04-28 15:35:56,524 INFO L290 TraceCheckUtils]: 98: Hoare triple {38975#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {38975#false} is VALID [2022-04-28 15:35:56,524 INFO L290 TraceCheckUtils]: 99: Hoare triple {38975#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {38975#false} is VALID [2022-04-28 15:35:56,524 INFO L290 TraceCheckUtils]: 100: Hoare triple {38975#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {38975#false} is VALID [2022-04-28 15:35:56,524 INFO L290 TraceCheckUtils]: 101: Hoare triple {38975#false} assume 8641 == #t~mem76;havoc #t~mem76; {38975#false} is VALID [2022-04-28 15:35:56,524 INFO L290 TraceCheckUtils]: 102: Hoare triple {38975#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {38975#false} is VALID [2022-04-28 15:35:56,524 INFO L290 TraceCheckUtils]: 103: Hoare triple {38975#false} assume !(4 == ~blastFlag~0); {38975#false} is VALID [2022-04-28 15:35:56,524 INFO L290 TraceCheckUtils]: 104: Hoare triple {38975#false} assume !(7 == ~blastFlag~0); {38975#false} is VALID [2022-04-28 15:35:56,524 INFO L290 TraceCheckUtils]: 105: Hoare triple {38975#false} assume !(10 == ~blastFlag~0); {38975#false} is VALID [2022-04-28 15:35:56,524 INFO L290 TraceCheckUtils]: 106: Hoare triple {38975#false} assume !false; {38975#false} is VALID [2022-04-28 15:35:56,524 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 15:35:56,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:35:56,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260263518] [2022-04-28 15:35:56,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260263518] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:35:56,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:35:56,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:35:56,525 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:35:56,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1970240564] [2022-04-28 15:35:56,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1970240564] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:35:56,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:35:56,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:35:56,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8113281] [2022-04-28 15:35:56,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:35:56,526 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 107 [2022-04-28 15:35:56,526 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:35:56,526 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-28 15:35:56,583 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-28 15:35:56,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:35:56,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:35:56,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:35:56,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:35:56,584 INFO L87 Difference]: Start difference. First operand 318 states and 477 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-28 15:36:04,624 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:36:05,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:36:05,737 INFO L93 Difference]: Finished difference Result 699 states and 1064 transitions. [2022-04-28 15:36:05,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:36:05,737 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 107 [2022-04-28 15:36:05,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:36:05,738 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-28 15:36:05,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 588 transitions. [2022-04-28 15:36:05,740 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-28 15:36:05,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 588 transitions. [2022-04-28 15:36:05,742 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 588 transitions. [2022-04-28 15:36:06,099 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 588 edges. 588 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:36:06,107 INFO L225 Difference]: With dead ends: 699 [2022-04-28 15:36:06,107 INFO L226 Difference]: Without dead ends: 407 [2022-04-28 15:36:06,108 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-28 15:36:06,109 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 137 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 54 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-04-28 15:36:06,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 386 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 468 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2022-04-28 15:36:06,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2022-04-28 15:36:06,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 318. [2022-04-28 15:36:06,118 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:36:06,119 INFO L82 GeneralOperation]: Start isEquivalent. First operand 407 states. Second operand has 318 states, 313 states have (on average 1.4952076677316295) internal successors, (468), 313 states have internal predecessors, (468), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:36:06,119 INFO L74 IsIncluded]: Start isIncluded. First operand 407 states. Second operand has 318 states, 313 states have (on average 1.4952076677316295) internal successors, (468), 313 states have internal predecessors, (468), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:36:06,119 INFO L87 Difference]: Start difference. First operand 407 states. Second operand has 318 states, 313 states have (on average 1.4952076677316295) internal successors, (468), 313 states have internal predecessors, (468), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:36:06,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:36:06,125 INFO L93 Difference]: Finished difference Result 407 states and 612 transitions. [2022-04-28 15:36:06,125 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 612 transitions. [2022-04-28 15:36:06,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:36:06,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:36:06,126 INFO L74 IsIncluded]: Start isIncluded. First operand has 318 states, 313 states have (on average 1.4952076677316295) internal successors, (468), 313 states have internal predecessors, (468), 3 states have call successors, (3), 3 states 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-28 15:36:06,127 INFO L87 Difference]: Start difference. First operand has 318 states, 313 states have (on average 1.4952076677316295) internal successors, (468), 313 states have internal predecessors, (468), 3 states have call successors, (3), 3 states 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-28 15:36:06,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:36:06,133 INFO L93 Difference]: Finished difference Result 407 states and 612 transitions. [2022-04-28 15:36:06,133 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 612 transitions. [2022-04-28 15:36:06,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:36:06,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:36:06,133 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:36:06,133 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:36:06,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 313 states have (on average 1.4952076677316295) internal successors, (468), 313 states have internal predecessors, (468), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:36:06,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 472 transitions. [2022-04-28 15:36:06,138 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 472 transitions. Word has length 107 [2022-04-28 15:36:06,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:36:06,138 INFO L495 AbstractCegarLoop]: Abstraction has 318 states and 472 transitions. [2022-04-28 15:36:06,139 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-28 15:36:06,139 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 318 states and 472 transitions. [2022-04-28 15:36:06,515 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 472 edges. 472 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:36:06,515 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 472 transitions. [2022-04-28 15:36:06,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-04-28 15:36:06,516 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:36:06,516 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1] [2022-04-28 15:36:06,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-28 15:36:06,516 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:36:06,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:36:06,516 INFO L85 PathProgramCache]: Analyzing trace with hash -359291006, now seen corresponding path program 1 times [2022-04-28 15:36:06,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:36:06,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1861761240] [2022-04-28 15:36:06,563 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:36:06,563 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:36:06,564 INFO L85 PathProgramCache]: Analyzing trace with hash -359291006, now seen corresponding path program 2 times [2022-04-28 15:36:06,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:36:06,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706148345] [2022-04-28 15:36:06,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:36:06,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:36:06,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:36:06,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:36:06,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:36:06,672 INFO L290 TraceCheckUtils]: 0: Hoare triple {41841#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {41834#true} is VALID [2022-04-28 15:36:06,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {41834#true} assume true; {41834#true} is VALID [2022-04-28 15:36:06,672 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41834#true} {41834#true} #703#return; {41834#true} is VALID [2022-04-28 15:36:06,673 INFO L272 TraceCheckUtils]: 0: Hoare triple {41834#true} call ULTIMATE.init(); {41841#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-28 15:36:06,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {41841#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {41834#true} is VALID [2022-04-28 15:36:06,673 INFO L290 TraceCheckUtils]: 2: Hoare triple {41834#true} assume true; {41834#true} is VALID [2022-04-28 15:36:06,673 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41834#true} {41834#true} #703#return; {41834#true} is VALID [2022-04-28 15:36:06,673 INFO L272 TraceCheckUtils]: 4: Hoare triple {41834#true} call #t~ret161 := main(); {41834#true} is VALID [2022-04-28 15:36:06,673 INFO L290 TraceCheckUtils]: 5: Hoare triple {41834#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {41834#true} is VALID [2022-04-28 15:36:06,673 INFO L290 TraceCheckUtils]: 6: Hoare triple {41834#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {41834#true} is VALID [2022-04-28 15:36:06,673 INFO L272 TraceCheckUtils]: 7: Hoare triple {41834#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {41834#true} is VALID [2022-04-28 15:36:06,673 INFO L290 TraceCheckUtils]: 8: Hoare triple {41834#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {41834#true} is VALID [2022-04-28 15:36:06,673 INFO L290 TraceCheckUtils]: 9: Hoare triple {41834#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {41834#true} is VALID [2022-04-28 15:36:06,674 INFO L290 TraceCheckUtils]: 10: Hoare triple {41834#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {41834#true} is VALID [2022-04-28 15:36:06,674 INFO L290 TraceCheckUtils]: 11: Hoare triple {41834#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {41834#true} is VALID [2022-04-28 15:36:06,674 INFO L290 TraceCheckUtils]: 12: Hoare triple {41834#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {41834#true} is VALID [2022-04-28 15:36:06,674 INFO L290 TraceCheckUtils]: 13: Hoare triple {41834#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {41834#true} is VALID [2022-04-28 15:36:06,674 INFO L290 TraceCheckUtils]: 14: Hoare triple {41834#true} assume !false; {41834#true} is VALID [2022-04-28 15:36:06,674 INFO L290 TraceCheckUtils]: 15: Hoare triple {41834#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {41834#true} is VALID [2022-04-28 15:36:06,674 INFO L290 TraceCheckUtils]: 16: Hoare triple {41834#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {41834#true} is VALID [2022-04-28 15:36:06,674 INFO L290 TraceCheckUtils]: 17: Hoare triple {41834#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {41834#true} is VALID [2022-04-28 15:36:06,674 INFO L290 TraceCheckUtils]: 18: Hoare triple {41834#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {41834#true} is VALID [2022-04-28 15:36:06,674 INFO L290 TraceCheckUtils]: 19: Hoare triple {41834#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {41834#true} is VALID [2022-04-28 15:36:06,674 INFO L290 TraceCheckUtils]: 20: Hoare triple {41834#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {41834#true} is VALID [2022-04-28 15:36:06,674 INFO L290 TraceCheckUtils]: 21: Hoare triple {41834#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {41834#true} is VALID [2022-04-28 15:36:06,674 INFO L290 TraceCheckUtils]: 22: Hoare triple {41834#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {41834#true} is VALID [2022-04-28 15:36:06,674 INFO L290 TraceCheckUtils]: 23: Hoare triple {41834#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {41834#true} is VALID [2022-04-28 15:36:06,675 INFO L290 TraceCheckUtils]: 24: Hoare triple {41834#true} assume 8464 == #t~mem55;havoc #t~mem55; {41834#true} is VALID [2022-04-28 15:36:06,675 INFO L290 TraceCheckUtils]: 25: Hoare triple {41834#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {41834#true} is VALID [2022-04-28 15:36:06,675 INFO L290 TraceCheckUtils]: 26: Hoare triple {41834#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {41834#true} is VALID [2022-04-28 15:36:06,675 INFO L290 TraceCheckUtils]: 27: Hoare triple {41834#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {41834#true} is VALID [2022-04-28 15:36:06,675 INFO L290 TraceCheckUtils]: 28: Hoare triple {41834#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {41834#true} is VALID [2022-04-28 15:36:06,675 INFO L290 TraceCheckUtils]: 29: Hoare triple {41834#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {41834#true} is VALID [2022-04-28 15:36:06,675 INFO L290 TraceCheckUtils]: 30: Hoare triple {41834#true} ~skip~0 := 0; {41834#true} is VALID [2022-04-28 15:36:06,675 INFO L290 TraceCheckUtils]: 31: Hoare triple {41834#true} assume !false; {41834#true} is VALID [2022-04-28 15:36:06,675 INFO L290 TraceCheckUtils]: 32: Hoare triple {41834#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {41834#true} is VALID [2022-04-28 15:36:06,675 INFO L290 TraceCheckUtils]: 33: Hoare triple {41834#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {41834#true} is VALID [2022-04-28 15:36:06,675 INFO L290 TraceCheckUtils]: 34: Hoare triple {41834#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {41834#true} is VALID [2022-04-28 15:36:06,675 INFO L290 TraceCheckUtils]: 35: Hoare triple {41834#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {41834#true} is VALID [2022-04-28 15:36:06,675 INFO L290 TraceCheckUtils]: 36: Hoare triple {41834#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {41834#true} is VALID [2022-04-28 15:36:06,675 INFO L290 TraceCheckUtils]: 37: Hoare triple {41834#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {41834#true} is VALID [2022-04-28 15:36:06,676 INFO L290 TraceCheckUtils]: 38: Hoare triple {41834#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {41834#true} is VALID [2022-04-28 15:36:06,676 INFO L290 TraceCheckUtils]: 39: Hoare triple {41834#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {41834#true} is VALID [2022-04-28 15:36:06,676 INFO L290 TraceCheckUtils]: 40: Hoare triple {41834#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {41834#true} is VALID [2022-04-28 15:36:06,676 INFO L290 TraceCheckUtils]: 41: Hoare triple {41834#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {41834#true} is VALID [2022-04-28 15:36:06,676 INFO L290 TraceCheckUtils]: 42: Hoare triple {41834#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {41834#true} is VALID [2022-04-28 15:36:06,676 INFO L290 TraceCheckUtils]: 43: Hoare triple {41834#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {41834#true} is VALID [2022-04-28 15:36:06,676 INFO L290 TraceCheckUtils]: 44: Hoare triple {41834#true} assume 8496 == #t~mem58;havoc #t~mem58; {41834#true} is VALID [2022-04-28 15:36:06,676 INFO L290 TraceCheckUtils]: 45: Hoare triple {41834#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {41834#true} is VALID [2022-04-28 15:36:06,676 INFO L290 TraceCheckUtils]: 46: Hoare triple {41834#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {41834#true} is VALID [2022-04-28 15:36:06,676 INFO L290 TraceCheckUtils]: 47: Hoare triple {41834#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {41834#true} is VALID [2022-04-28 15:36:06,677 INFO L290 TraceCheckUtils]: 48: Hoare triple {41834#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {41839#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} is VALID [2022-04-28 15:36:06,677 INFO L290 TraceCheckUtils]: 49: Hoare triple {41839#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {41839#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} is VALID [2022-04-28 15:36:06,678 INFO L290 TraceCheckUtils]: 50: Hoare triple {41839#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {41839#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} is VALID [2022-04-28 15:36:06,678 INFO L290 TraceCheckUtils]: 51: Hoare triple {41839#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {41839#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} is VALID [2022-04-28 15:36:06,678 INFO L290 TraceCheckUtils]: 52: Hoare triple {41839#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} ~skip~0 := 0; {41839#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} is VALID [2022-04-28 15:36:06,679 INFO L290 TraceCheckUtils]: 53: Hoare triple {41839#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} assume !false; {41839#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} is VALID [2022-04-28 15:36:06,679 INFO L290 TraceCheckUtils]: 54: Hoare triple {41839#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {41839#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} is VALID [2022-04-28 15:36:06,679 INFO L290 TraceCheckUtils]: 55: Hoare triple {41839#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {41839#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} is VALID [2022-04-28 15:36:06,680 INFO L290 TraceCheckUtils]: 56: Hoare triple {41839#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {41839#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} is VALID [2022-04-28 15:36:06,680 INFO L290 TraceCheckUtils]: 57: Hoare triple {41839#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {41839#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} is VALID [2022-04-28 15:36:06,680 INFO L290 TraceCheckUtils]: 58: Hoare triple {41839#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {41839#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} is VALID [2022-04-28 15:36:06,681 INFO L290 TraceCheckUtils]: 59: Hoare triple {41839#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {41839#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} is VALID [2022-04-28 15:36:06,681 INFO L290 TraceCheckUtils]: 60: Hoare triple {41839#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {41839#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} is VALID [2022-04-28 15:36:06,681 INFO L290 TraceCheckUtils]: 61: Hoare triple {41839#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {41839#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} is VALID [2022-04-28 15:36:06,682 INFO L290 TraceCheckUtils]: 62: Hoare triple {41839#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {41839#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} is VALID [2022-04-28 15:36:06,682 INFO L290 TraceCheckUtils]: 63: Hoare triple {41839#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {41839#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} is VALID [2022-04-28 15:36:06,682 INFO L290 TraceCheckUtils]: 64: Hoare triple {41839#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {41839#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} is VALID [2022-04-28 15:36:06,683 INFO L290 TraceCheckUtils]: 65: Hoare triple {41839#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {41839#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} is VALID [2022-04-28 15:36:06,683 INFO L290 TraceCheckUtils]: 66: Hoare triple {41839#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {41839#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} is VALID [2022-04-28 15:36:06,683 INFO L290 TraceCheckUtils]: 67: Hoare triple {41839#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {41840#(not (= |ssl3_accept_#t~mem60| 8512))} is VALID [2022-04-28 15:36:06,684 INFO L290 TraceCheckUtils]: 68: Hoare triple {41840#(not (= |ssl3_accept_#t~mem60| 8512))} assume 8512 == #t~mem60;havoc #t~mem60; {41835#false} is VALID [2022-04-28 15:36:06,684 INFO L290 TraceCheckUtils]: 69: Hoare triple {41835#false} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 888 + #t~mem95.offset, 8);call #t~mem97 := read~int(#t~mem96.base, 20 + #t~mem96.offset, 8); {41835#false} is VALID [2022-04-28 15:36:06,684 INFO L290 TraceCheckUtils]: 70: Hoare triple {41835#false} assume 0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 18446744073709551616;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;~skip~0 := 1; {41835#false} is VALID [2022-04-28 15:36:06,684 INFO L290 TraceCheckUtils]: 71: Hoare triple {41835#false} call write~int(8528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {41835#false} is VALID [2022-04-28 15:36:06,684 INFO L290 TraceCheckUtils]: 72: Hoare triple {41835#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {41835#false} is VALID [2022-04-28 15:36:06,684 INFO L290 TraceCheckUtils]: 73: Hoare triple {41835#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {41835#false} is VALID [2022-04-28 15:36:06,684 INFO L290 TraceCheckUtils]: 74: Hoare triple {41835#false} ~skip~0 := 0; {41835#false} is VALID [2022-04-28 15:36:06,684 INFO L290 TraceCheckUtils]: 75: Hoare triple {41835#false} assume !false; {41835#false} is VALID [2022-04-28 15:36:06,684 INFO L290 TraceCheckUtils]: 76: Hoare triple {41835#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {41835#false} is VALID [2022-04-28 15:36:06,684 INFO L290 TraceCheckUtils]: 77: Hoare triple {41835#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {41835#false} is VALID [2022-04-28 15:36:06,684 INFO L290 TraceCheckUtils]: 78: Hoare triple {41835#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {41835#false} is VALID [2022-04-28 15:36:06,685 INFO L290 TraceCheckUtils]: 79: Hoare triple {41835#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {41835#false} is VALID [2022-04-28 15:36:06,685 INFO L290 TraceCheckUtils]: 80: Hoare triple {41835#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {41835#false} is VALID [2022-04-28 15:36:06,685 INFO L290 TraceCheckUtils]: 81: Hoare triple {41835#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {41835#false} is VALID [2022-04-28 15:36:06,685 INFO L290 TraceCheckUtils]: 82: Hoare triple {41835#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {41835#false} is VALID [2022-04-28 15:36:06,685 INFO L290 TraceCheckUtils]: 83: Hoare triple {41835#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {41835#false} is VALID [2022-04-28 15:36:06,685 INFO L290 TraceCheckUtils]: 84: Hoare triple {41835#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {41835#false} is VALID [2022-04-28 15:36:06,685 INFO L290 TraceCheckUtils]: 85: Hoare triple {41835#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {41835#false} is VALID [2022-04-28 15:36:06,685 INFO L290 TraceCheckUtils]: 86: Hoare triple {41835#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {41835#false} is VALID [2022-04-28 15:36:06,685 INFO L290 TraceCheckUtils]: 87: Hoare triple {41835#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {41835#false} is VALID [2022-04-28 15:36:06,685 INFO L290 TraceCheckUtils]: 88: Hoare triple {41835#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {41835#false} is VALID [2022-04-28 15:36:06,685 INFO L290 TraceCheckUtils]: 89: Hoare triple {41835#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {41835#false} is VALID [2022-04-28 15:36:06,685 INFO L290 TraceCheckUtils]: 90: Hoare triple {41835#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {41835#false} is VALID [2022-04-28 15:36:06,685 INFO L290 TraceCheckUtils]: 91: Hoare triple {41835#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {41835#false} is VALID [2022-04-28 15:36:06,685 INFO L290 TraceCheckUtils]: 92: Hoare triple {41835#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {41835#false} is VALID [2022-04-28 15:36:06,685 INFO L290 TraceCheckUtils]: 93: Hoare triple {41835#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {41835#false} is VALID [2022-04-28 15:36:06,686 INFO L290 TraceCheckUtils]: 94: Hoare triple {41835#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {41835#false} is VALID [2022-04-28 15:36:06,686 INFO L290 TraceCheckUtils]: 95: Hoare triple {41835#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {41835#false} is VALID [2022-04-28 15:36:06,686 INFO L290 TraceCheckUtils]: 96: Hoare triple {41835#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {41835#false} is VALID [2022-04-28 15:36:06,686 INFO L290 TraceCheckUtils]: 97: Hoare triple {41835#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {41835#false} is VALID [2022-04-28 15:36:06,686 INFO L290 TraceCheckUtils]: 98: Hoare triple {41835#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {41835#false} is VALID [2022-04-28 15:36:06,686 INFO L290 TraceCheckUtils]: 99: Hoare triple {41835#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {41835#false} is VALID [2022-04-28 15:36:06,686 INFO L290 TraceCheckUtils]: 100: Hoare triple {41835#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {41835#false} is VALID [2022-04-28 15:36:06,686 INFO L290 TraceCheckUtils]: 101: Hoare triple {41835#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {41835#false} is VALID [2022-04-28 15:36:06,686 INFO L290 TraceCheckUtils]: 102: Hoare triple {41835#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {41835#false} is VALID [2022-04-28 15:36:06,686 INFO L290 TraceCheckUtils]: 103: Hoare triple {41835#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {41835#false} is VALID [2022-04-28 15:36:06,686 INFO L290 TraceCheckUtils]: 104: Hoare triple {41835#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {41835#false} is VALID [2022-04-28 15:36:06,686 INFO L290 TraceCheckUtils]: 105: Hoare triple {41835#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {41835#false} is VALID [2022-04-28 15:36:06,686 INFO L290 TraceCheckUtils]: 106: Hoare triple {41835#false} assume 8641 == #t~mem76;havoc #t~mem76; {41835#false} is VALID [2022-04-28 15:36:06,686 INFO L290 TraceCheckUtils]: 107: Hoare triple {41835#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {41835#false} is VALID [2022-04-28 15:36:06,687 INFO L290 TraceCheckUtils]: 108: Hoare triple {41835#false} assume !(4 == ~blastFlag~0); {41835#false} is VALID [2022-04-28 15:36:06,687 INFO L290 TraceCheckUtils]: 109: Hoare triple {41835#false} assume !(7 == ~blastFlag~0); {41835#false} is VALID [2022-04-28 15:36:06,687 INFO L290 TraceCheckUtils]: 110: Hoare triple {41835#false} assume !(10 == ~blastFlag~0); {41835#false} is VALID [2022-04-28 15:36:06,687 INFO L290 TraceCheckUtils]: 111: Hoare triple {41835#false} assume !false; {41835#false} is VALID [2022-04-28 15:36:06,687 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 15:36:06,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:36:06,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706148345] [2022-04-28 15:36:06,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706148345] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:36:06,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:36:06,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:36:06,688 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:36:06,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1861761240] [2022-04-28 15:36:06,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1861761240] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:36:06,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:36:06,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:36:06,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625138139] [2022-04-28 15:36:06,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:36:06,688 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 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 112 [2022-04-28 15:36:06,688 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:36:06,689 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 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-28 15:36:06,757 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-28 15:36:06,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:36:06,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:36:06,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:36:06,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:36:06,759 INFO L87 Difference]: Start difference. First operand 318 states and 472 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 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-28 15:36:14,811 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:36:15,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:36:15,776 INFO L93 Difference]: Finished difference Result 699 states and 1054 transitions. [2022-04-28 15:36:15,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:36:15,777 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 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 112 [2022-04-28 15:36:15,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:36:15,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 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-28 15:36:15,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 588 transitions. [2022-04-28 15:36:15,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 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-28 15:36:15,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 588 transitions. [2022-04-28 15:36:15,784 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 588 transitions. [2022-04-28 15:36:16,026 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 588 edges. 588 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:36:16,033 INFO L225 Difference]: With dead ends: 699 [2022-04-28 15:36:16,033 INFO L226 Difference]: Without dead ends: 407 [2022-04-28 15:36:16,035 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-28 15:36:16,035 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 126 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 51 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-04-28 15:36:16,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 396 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 475 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2022-04-28 15:36:16,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2022-04-28 15:36:16,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 324. [2022-04-28 15:36:16,049 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:36:16,049 INFO L82 GeneralOperation]: Start isEquivalent. First operand 407 states. Second operand has 324 states, 319 states have (on average 1.4952978056426331) internal successors, (477), 319 states have internal predecessors, (477), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:36:16,049 INFO L74 IsIncluded]: Start isIncluded. First operand 407 states. Second operand has 324 states, 319 states have (on average 1.4952978056426331) internal successors, (477), 319 states have internal predecessors, (477), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:36:16,050 INFO L87 Difference]: Start difference. First operand 407 states. Second operand has 324 states, 319 states have (on average 1.4952978056426331) internal successors, (477), 319 states have internal predecessors, (477), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:36:16,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:36:16,055 INFO L93 Difference]: Finished difference Result 407 states and 609 transitions. [2022-04-28 15:36:16,055 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 609 transitions. [2022-04-28 15:36:16,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:36:16,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:36:16,056 INFO L74 IsIncluded]: Start isIncluded. First operand has 324 states, 319 states have (on average 1.4952978056426331) internal successors, (477), 319 states have internal predecessors, (477), 3 states have call successors, (3), 3 states 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-28 15:36:16,057 INFO L87 Difference]: Start difference. First operand has 324 states, 319 states have (on average 1.4952978056426331) internal successors, (477), 319 states have internal predecessors, (477), 3 states have call successors, (3), 3 states 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-28 15:36:16,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:36:16,063 INFO L93 Difference]: Finished difference Result 407 states and 609 transitions. [2022-04-28 15:36:16,063 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 609 transitions. [2022-04-28 15:36:16,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:36:16,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:36:16,063 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:36:16,063 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:36:16,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 319 states have (on average 1.4952978056426331) internal successors, (477), 319 states have internal predecessors, (477), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:36:16,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 481 transitions. [2022-04-28 15:36:16,068 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 481 transitions. Word has length 112 [2022-04-28 15:36:16,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:36:16,069 INFO L495 AbstractCegarLoop]: Abstraction has 324 states and 481 transitions. [2022-04-28 15:36:16,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 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-28 15:36:16,069 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 324 states and 481 transitions. [2022-04-28 15:36:16,418 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 481 edges. 481 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:36:16,418 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 481 transitions. [2022-04-28 15:36:16,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-04-28 15:36:16,419 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:36:16,420 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1] [2022-04-28 15:36:16,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-28 15:36:16,420 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:36:16,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:36:16,429 INFO L85 PathProgramCache]: Analyzing trace with hash -413683904, now seen corresponding path program 1 times [2022-04-28 15:36:16,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:36:16,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [193144743] [2022-04-28 15:36:16,483 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:36:16,483 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:36:16,483 INFO L85 PathProgramCache]: Analyzing trace with hash -413683904, now seen corresponding path program 2 times [2022-04-28 15:36:16,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:36:16,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137031914] [2022-04-28 15:36:16,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:36:16,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:36:16,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:36:16,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:36:16,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:36:16,579 INFO L290 TraceCheckUtils]: 0: Hoare triple {44713#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {44706#true} is VALID [2022-04-28 15:36:16,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {44706#true} assume true; {44706#true} is VALID [2022-04-28 15:36:16,580 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {44706#true} {44706#true} #703#return; {44706#true} is VALID [2022-04-28 15:36:16,580 INFO L272 TraceCheckUtils]: 0: Hoare triple {44706#true} call ULTIMATE.init(); {44713#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-28 15:36:16,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {44713#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {44706#true} is VALID [2022-04-28 15:36:16,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {44706#true} assume true; {44706#true} is VALID [2022-04-28 15:36:16,580 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44706#true} {44706#true} #703#return; {44706#true} is VALID [2022-04-28 15:36:16,581 INFO L272 TraceCheckUtils]: 4: Hoare triple {44706#true} call #t~ret161 := main(); {44706#true} is VALID [2022-04-28 15:36:16,581 INFO L290 TraceCheckUtils]: 5: Hoare triple {44706#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {44706#true} is VALID [2022-04-28 15:36:16,581 INFO L290 TraceCheckUtils]: 6: Hoare triple {44706#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {44706#true} is VALID [2022-04-28 15:36:16,581 INFO L272 TraceCheckUtils]: 7: Hoare triple {44706#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {44706#true} is VALID [2022-04-28 15:36:16,581 INFO L290 TraceCheckUtils]: 8: Hoare triple {44706#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {44706#true} is VALID [2022-04-28 15:36:16,581 INFO L290 TraceCheckUtils]: 9: Hoare triple {44706#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {44706#true} is VALID [2022-04-28 15:36:16,581 INFO L290 TraceCheckUtils]: 10: Hoare triple {44706#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {44706#true} is VALID [2022-04-28 15:36:16,581 INFO L290 TraceCheckUtils]: 11: Hoare triple {44706#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {44706#true} is VALID [2022-04-28 15:36:16,581 INFO L290 TraceCheckUtils]: 12: Hoare triple {44706#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {44706#true} is VALID [2022-04-28 15:36:16,581 INFO L290 TraceCheckUtils]: 13: Hoare triple {44706#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {44706#true} is VALID [2022-04-28 15:36:16,581 INFO L290 TraceCheckUtils]: 14: Hoare triple {44706#true} assume !false; {44706#true} is VALID [2022-04-28 15:36:16,581 INFO L290 TraceCheckUtils]: 15: Hoare triple {44706#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {44706#true} is VALID [2022-04-28 15:36:16,581 INFO L290 TraceCheckUtils]: 16: Hoare triple {44706#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {44706#true} is VALID [2022-04-28 15:36:16,581 INFO L290 TraceCheckUtils]: 17: Hoare triple {44706#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {44706#true} is VALID [2022-04-28 15:36:16,582 INFO L290 TraceCheckUtils]: 18: Hoare triple {44706#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {44706#true} is VALID [2022-04-28 15:36:16,582 INFO L290 TraceCheckUtils]: 19: Hoare triple {44706#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {44706#true} is VALID [2022-04-28 15:36:16,582 INFO L290 TraceCheckUtils]: 20: Hoare triple {44706#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {44706#true} is VALID [2022-04-28 15:36:16,582 INFO L290 TraceCheckUtils]: 21: Hoare triple {44706#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {44706#true} is VALID [2022-04-28 15:36:16,582 INFO L290 TraceCheckUtils]: 22: Hoare triple {44706#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {44706#true} is VALID [2022-04-28 15:36:16,582 INFO L290 TraceCheckUtils]: 23: Hoare triple {44706#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {44706#true} is VALID [2022-04-28 15:36:16,582 INFO L290 TraceCheckUtils]: 24: Hoare triple {44706#true} assume 8464 == #t~mem55;havoc #t~mem55; {44706#true} is VALID [2022-04-28 15:36:16,582 INFO L290 TraceCheckUtils]: 25: Hoare triple {44706#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {44706#true} is VALID [2022-04-28 15:36:16,582 INFO L290 TraceCheckUtils]: 26: Hoare triple {44706#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {44706#true} is VALID [2022-04-28 15:36:16,582 INFO L290 TraceCheckUtils]: 27: Hoare triple {44706#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {44706#true} is VALID [2022-04-28 15:36:16,582 INFO L290 TraceCheckUtils]: 28: Hoare triple {44706#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {44706#true} is VALID [2022-04-28 15:36:16,582 INFO L290 TraceCheckUtils]: 29: Hoare triple {44706#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {44706#true} is VALID [2022-04-28 15:36:16,582 INFO L290 TraceCheckUtils]: 30: Hoare triple {44706#true} ~skip~0 := 0; {44706#true} is VALID [2022-04-28 15:36:16,582 INFO L290 TraceCheckUtils]: 31: Hoare triple {44706#true} assume !false; {44706#true} is VALID [2022-04-28 15:36:16,583 INFO L290 TraceCheckUtils]: 32: Hoare triple {44706#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {44706#true} is VALID [2022-04-28 15:36:16,583 INFO L290 TraceCheckUtils]: 33: Hoare triple {44706#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {44706#true} is VALID [2022-04-28 15:36:16,583 INFO L290 TraceCheckUtils]: 34: Hoare triple {44706#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {44706#true} is VALID [2022-04-28 15:36:16,583 INFO L290 TraceCheckUtils]: 35: Hoare triple {44706#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {44706#true} is VALID [2022-04-28 15:36:16,583 INFO L290 TraceCheckUtils]: 36: Hoare triple {44706#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {44706#true} is VALID [2022-04-28 15:36:16,583 INFO L290 TraceCheckUtils]: 37: Hoare triple {44706#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {44706#true} is VALID [2022-04-28 15:36:16,583 INFO L290 TraceCheckUtils]: 38: Hoare triple {44706#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {44706#true} is VALID [2022-04-28 15:36:16,583 INFO L290 TraceCheckUtils]: 39: Hoare triple {44706#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {44706#true} is VALID [2022-04-28 15:36:16,583 INFO L290 TraceCheckUtils]: 40: Hoare triple {44706#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {44706#true} is VALID [2022-04-28 15:36:16,583 INFO L290 TraceCheckUtils]: 41: Hoare triple {44706#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {44706#true} is VALID [2022-04-28 15:36:16,583 INFO L290 TraceCheckUtils]: 42: Hoare triple {44706#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {44706#true} is VALID [2022-04-28 15:36:16,583 INFO L290 TraceCheckUtils]: 43: Hoare triple {44706#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {44706#true} is VALID [2022-04-28 15:36:16,583 INFO L290 TraceCheckUtils]: 44: Hoare triple {44706#true} assume 8496 == #t~mem58;havoc #t~mem58; {44706#true} is VALID [2022-04-28 15:36:16,583 INFO L290 TraceCheckUtils]: 45: Hoare triple {44706#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {44706#true} is VALID [2022-04-28 15:36:16,583 INFO L290 TraceCheckUtils]: 46: Hoare triple {44706#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {44706#true} is VALID [2022-04-28 15:36:16,584 INFO L290 TraceCheckUtils]: 47: Hoare triple {44706#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {44706#true} is VALID [2022-04-28 15:36:16,584 INFO L290 TraceCheckUtils]: 48: Hoare triple {44706#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 72 + ~s.offset, 4); {44706#true} is VALID [2022-04-28 15:36:16,584 INFO L290 TraceCheckUtils]: 49: Hoare triple {44706#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {44706#true} is VALID [2022-04-28 15:36:16,584 INFO L290 TraceCheckUtils]: 50: Hoare triple {44706#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {44706#true} is VALID [2022-04-28 15:36:16,584 INFO L290 TraceCheckUtils]: 51: Hoare triple {44706#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {44706#true} is VALID [2022-04-28 15:36:16,584 INFO L290 TraceCheckUtils]: 52: Hoare triple {44706#true} ~skip~0 := 0; {44706#true} is VALID [2022-04-28 15:36:16,584 INFO L290 TraceCheckUtils]: 53: Hoare triple {44706#true} assume !false; {44706#true} is VALID [2022-04-28 15:36:16,584 INFO L290 TraceCheckUtils]: 54: Hoare triple {44706#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {44706#true} is VALID [2022-04-28 15:36:16,584 INFO L290 TraceCheckUtils]: 55: Hoare triple {44706#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {44706#true} is VALID [2022-04-28 15:36:16,584 INFO L290 TraceCheckUtils]: 56: Hoare triple {44706#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {44706#true} is VALID [2022-04-28 15:36:16,584 INFO L290 TraceCheckUtils]: 57: Hoare triple {44706#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {44706#true} is VALID [2022-04-28 15:36:16,584 INFO L290 TraceCheckUtils]: 58: Hoare triple {44706#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {44706#true} is VALID [2022-04-28 15:36:16,584 INFO L290 TraceCheckUtils]: 59: Hoare triple {44706#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {44706#true} is VALID [2022-04-28 15:36:16,584 INFO L290 TraceCheckUtils]: 60: Hoare triple {44706#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {44706#true} is VALID [2022-04-28 15:36:16,585 INFO L290 TraceCheckUtils]: 61: Hoare triple {44706#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {44706#true} is VALID [2022-04-28 15:36:16,585 INFO L290 TraceCheckUtils]: 62: Hoare triple {44706#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {44706#true} is VALID [2022-04-28 15:36:16,585 INFO L290 TraceCheckUtils]: 63: Hoare triple {44706#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {44706#true} is VALID [2022-04-28 15:36:16,585 INFO L290 TraceCheckUtils]: 64: Hoare triple {44706#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {44706#true} is VALID [2022-04-28 15:36:16,585 INFO L290 TraceCheckUtils]: 65: Hoare triple {44706#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {44706#true} is VALID [2022-04-28 15:36:16,585 INFO L290 TraceCheckUtils]: 66: Hoare triple {44706#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {44706#true} is VALID [2022-04-28 15:36:16,585 INFO L290 TraceCheckUtils]: 67: Hoare triple {44706#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {44706#true} is VALID [2022-04-28 15:36:16,585 INFO L290 TraceCheckUtils]: 68: Hoare triple {44706#true} assume 8512 == #t~mem60;havoc #t~mem60; {44706#true} is VALID [2022-04-28 15:36:16,585 INFO L290 TraceCheckUtils]: 69: Hoare triple {44706#true} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 888 + #t~mem95.offset, 8);call #t~mem97 := read~int(#t~mem96.base, 20 + #t~mem96.offset, 8); {44706#true} is VALID [2022-04-28 15:36:16,585 INFO L290 TraceCheckUtils]: 70: Hoare triple {44706#true} assume 0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 18446744073709551616;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;~skip~0 := 1; {44706#true} is VALID [2022-04-28 15:36:16,586 INFO L290 TraceCheckUtils]: 71: Hoare triple {44706#true} call write~int(8528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {44711#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:16,586 INFO L290 TraceCheckUtils]: 72: Hoare triple {44711#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {44711#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:16,587 INFO L290 TraceCheckUtils]: 73: Hoare triple {44711#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {44711#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:16,587 INFO L290 TraceCheckUtils]: 74: Hoare triple {44711#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {44711#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:16,587 INFO L290 TraceCheckUtils]: 75: Hoare triple {44711#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {44711#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:16,588 INFO L290 TraceCheckUtils]: 76: Hoare triple {44711#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {44711#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:16,588 INFO L290 TraceCheckUtils]: 77: Hoare triple {44711#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {44711#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:16,588 INFO L290 TraceCheckUtils]: 78: Hoare triple {44711#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {44711#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:16,589 INFO L290 TraceCheckUtils]: 79: Hoare triple {44711#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {44711#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:16,589 INFO L290 TraceCheckUtils]: 80: Hoare triple {44711#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {44711#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:16,589 INFO L290 TraceCheckUtils]: 81: Hoare triple {44711#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {44711#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:16,590 INFO L290 TraceCheckUtils]: 82: Hoare triple {44711#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {44711#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:16,590 INFO L290 TraceCheckUtils]: 83: Hoare triple {44711#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {44711#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:16,590 INFO L290 TraceCheckUtils]: 84: Hoare triple {44711#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {44711#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:16,591 INFO L290 TraceCheckUtils]: 85: Hoare triple {44711#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {44711#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:16,591 INFO L290 TraceCheckUtils]: 86: Hoare triple {44711#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {44711#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:16,591 INFO L290 TraceCheckUtils]: 87: Hoare triple {44711#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {44711#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:16,592 INFO L290 TraceCheckUtils]: 88: Hoare triple {44711#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {44711#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:16,592 INFO L290 TraceCheckUtils]: 89: Hoare triple {44711#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {44711#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:16,592 INFO L290 TraceCheckUtils]: 90: Hoare triple {44711#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {44711#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:16,593 INFO L290 TraceCheckUtils]: 91: Hoare triple {44711#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {44712#(= |ssl3_accept_#t~mem62| 8528)} is VALID [2022-04-28 15:36:16,593 INFO L290 TraceCheckUtils]: 92: Hoare triple {44712#(= |ssl3_accept_#t~mem62| 8528)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {44707#false} is VALID [2022-04-28 15:36:16,593 INFO L290 TraceCheckUtils]: 93: Hoare triple {44707#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {44707#false} is VALID [2022-04-28 15:36:16,593 INFO L290 TraceCheckUtils]: 94: Hoare triple {44707#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {44707#false} is VALID [2022-04-28 15:36:16,593 INFO L290 TraceCheckUtils]: 95: Hoare triple {44707#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {44707#false} is VALID [2022-04-28 15:36:16,593 INFO L290 TraceCheckUtils]: 96: Hoare triple {44707#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {44707#false} is VALID [2022-04-28 15:36:16,593 INFO L290 TraceCheckUtils]: 97: Hoare triple {44707#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {44707#false} is VALID [2022-04-28 15:36:16,593 INFO L290 TraceCheckUtils]: 98: Hoare triple {44707#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {44707#false} is VALID [2022-04-28 15:36:16,593 INFO L290 TraceCheckUtils]: 99: Hoare triple {44707#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {44707#false} is VALID [2022-04-28 15:36:16,593 INFO L290 TraceCheckUtils]: 100: Hoare triple {44707#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {44707#false} is VALID [2022-04-28 15:36:16,594 INFO L290 TraceCheckUtils]: 101: Hoare triple {44707#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {44707#false} is VALID [2022-04-28 15:36:16,594 INFO L290 TraceCheckUtils]: 102: Hoare triple {44707#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {44707#false} is VALID [2022-04-28 15:36:16,594 INFO L290 TraceCheckUtils]: 103: Hoare triple {44707#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {44707#false} is VALID [2022-04-28 15:36:16,594 INFO L290 TraceCheckUtils]: 104: Hoare triple {44707#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {44707#false} is VALID [2022-04-28 15:36:16,594 INFO L290 TraceCheckUtils]: 105: Hoare triple {44707#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {44707#false} is VALID [2022-04-28 15:36:16,594 INFO L290 TraceCheckUtils]: 106: Hoare triple {44707#false} assume 8641 == #t~mem76;havoc #t~mem76; {44707#false} is VALID [2022-04-28 15:36:16,594 INFO L290 TraceCheckUtils]: 107: Hoare triple {44707#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {44707#false} is VALID [2022-04-28 15:36:16,594 INFO L290 TraceCheckUtils]: 108: Hoare triple {44707#false} assume !(4 == ~blastFlag~0); {44707#false} is VALID [2022-04-28 15:36:16,594 INFO L290 TraceCheckUtils]: 109: Hoare triple {44707#false} assume !(7 == ~blastFlag~0); {44707#false} is VALID [2022-04-28 15:36:16,594 INFO L290 TraceCheckUtils]: 110: Hoare triple {44707#false} assume !(10 == ~blastFlag~0); {44707#false} is VALID [2022-04-28 15:36:16,594 INFO L290 TraceCheckUtils]: 111: Hoare triple {44707#false} assume !false; {44707#false} is VALID [2022-04-28 15:36:16,595 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-28 15:36:16,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:36:16,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137031914] [2022-04-28 15:36:16,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137031914] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:36:16,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:36:16,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:36:16,595 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:36:16,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [193144743] [2022-04-28 15:36:16,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [193144743] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:36:16,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:36:16,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:36:16,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335342445] [2022-04-28 15:36:16,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:36:16,596 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 112 [2022-04-28 15:36:16,596 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:36:16,596 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:36:16,649 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:36:16,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:36:16,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:36:16,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:36:16,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:36:16,650 INFO L87 Difference]: Start difference. First operand 324 states and 481 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:36:20,044 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:36:26,693 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:36:27,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:36:27,718 INFO L93 Difference]: Finished difference Result 661 states and 988 transitions. [2022-04-28 15:36:27,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:36:27,719 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 112 [2022-04-28 15:36:27,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:36:27,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:36:27,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 479 transitions. [2022-04-28 15:36:27,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:36:27,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 479 transitions. [2022-04-28 15:36:27,738 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 479 transitions. [2022-04-28 15:36:28,032 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-28 15:36:28,038 INFO L225 Difference]: With dead ends: 661 [2022-04-28 15:36:28,039 INFO L226 Difference]: Without dead ends: 363 [2022-04-28 15:36:28,047 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-28 15:36:28,051 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 27 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:36:28,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 603 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 445 Invalid, 1 Unknown, 0 Unchecked, 5.3s Time] [2022-04-28 15:36:28,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2022-04-28 15:36:28,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 350. [2022-04-28 15:36:28,074 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:36:28,074 INFO L82 GeneralOperation]: Start isEquivalent. First operand 363 states. Second operand has 350 states, 345 states have (on average 1.489855072463768) internal successors, (514), 345 states have internal predecessors, (514), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:36:28,074 INFO L74 IsIncluded]: Start isIncluded. First operand 363 states. Second operand has 350 states, 345 states have (on average 1.489855072463768) internal successors, (514), 345 states have internal predecessors, (514), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:36:28,075 INFO L87 Difference]: Start difference. First operand 363 states. Second operand has 350 states, 345 states have (on average 1.489855072463768) internal successors, (514), 345 states have internal predecessors, (514), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:36:28,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:36:28,079 INFO L93 Difference]: Finished difference Result 363 states and 536 transitions. [2022-04-28 15:36:28,079 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 536 transitions. [2022-04-28 15:36:28,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:36:28,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:36:28,080 INFO L74 IsIncluded]: Start isIncluded. First operand has 350 states, 345 states have (on average 1.489855072463768) internal successors, (514), 345 states have internal predecessors, (514), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 363 states. [2022-04-28 15:36:28,080 INFO L87 Difference]: Start difference. First operand has 350 states, 345 states have (on average 1.489855072463768) internal successors, (514), 345 states have internal predecessors, (514), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 363 states. [2022-04-28 15:36:28,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:36:28,085 INFO L93 Difference]: Finished difference Result 363 states and 536 transitions. [2022-04-28 15:36:28,085 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 536 transitions. [2022-04-28 15:36:28,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:36:28,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:36:28,085 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:36:28,085 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:36:28,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 345 states have (on average 1.489855072463768) internal successors, (514), 345 states have internal predecessors, (514), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:36:28,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 518 transitions. [2022-04-28 15:36:28,091 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 518 transitions. Word has length 112 [2022-04-28 15:36:28,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:36:28,091 INFO L495 AbstractCegarLoop]: Abstraction has 350 states and 518 transitions. [2022-04-28 15:36:28,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:36:28,091 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 350 states and 518 transitions. [2022-04-28 15:36:28,517 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 518 edges. 518 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:36:28,517 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 518 transitions. [2022-04-28 15:36:28,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-04-28 15:36:28,518 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:36:28,518 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, 1, 1, 1, 1, 1] [2022-04-28 15:36:28,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-28 15:36:28,518 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:36:28,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:36:28,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1144200194, now seen corresponding path program 1 times [2022-04-28 15:36:28,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:36:28,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [255051715] [2022-04-28 15:36:28,573 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:36:28,573 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:36:28,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1144200194, now seen corresponding path program 2 times [2022-04-28 15:36:28,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:36:28,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869107235] [2022-04-28 15:36:28,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:36:28,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:36:28,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:36:28,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:36:28,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:36:28,676 INFO L290 TraceCheckUtils]: 0: Hoare triple {47473#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {47466#true} is VALID [2022-04-28 15:36:28,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {47466#true} assume true; {47466#true} is VALID [2022-04-28 15:36:28,677 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {47466#true} {47466#true} #703#return; {47466#true} is VALID [2022-04-28 15:36:28,677 INFO L272 TraceCheckUtils]: 0: Hoare triple {47466#true} call ULTIMATE.init(); {47473#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-28 15:36:28,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {47473#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {47466#true} is VALID [2022-04-28 15:36:28,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {47466#true} assume true; {47466#true} is VALID [2022-04-28 15:36:28,678 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47466#true} {47466#true} #703#return; {47466#true} is VALID [2022-04-28 15:36:28,678 INFO L272 TraceCheckUtils]: 4: Hoare triple {47466#true} call #t~ret161 := main(); {47466#true} is VALID [2022-04-28 15:36:28,678 INFO L290 TraceCheckUtils]: 5: Hoare triple {47466#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {47466#true} is VALID [2022-04-28 15:36:28,678 INFO L290 TraceCheckUtils]: 6: Hoare triple {47466#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {47466#true} is VALID [2022-04-28 15:36:28,678 INFO L272 TraceCheckUtils]: 7: Hoare triple {47466#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {47466#true} is VALID [2022-04-28 15:36:28,678 INFO L290 TraceCheckUtils]: 8: Hoare triple {47466#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {47466#true} is VALID [2022-04-28 15:36:28,678 INFO L290 TraceCheckUtils]: 9: Hoare triple {47466#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {47466#true} is VALID [2022-04-28 15:36:28,678 INFO L290 TraceCheckUtils]: 10: Hoare triple {47466#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {47466#true} is VALID [2022-04-28 15:36:28,678 INFO L290 TraceCheckUtils]: 11: Hoare triple {47466#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {47466#true} is VALID [2022-04-28 15:36:28,678 INFO L290 TraceCheckUtils]: 12: Hoare triple {47466#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {47466#true} is VALID [2022-04-28 15:36:28,678 INFO L290 TraceCheckUtils]: 13: Hoare triple {47466#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {47466#true} is VALID [2022-04-28 15:36:28,678 INFO L290 TraceCheckUtils]: 14: Hoare triple {47466#true} assume !false; {47466#true} is VALID [2022-04-28 15:36:28,678 INFO L290 TraceCheckUtils]: 15: Hoare triple {47466#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {47466#true} is VALID [2022-04-28 15:36:28,680 INFO L290 TraceCheckUtils]: 16: Hoare triple {47466#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {47466#true} is VALID [2022-04-28 15:36:28,680 INFO L290 TraceCheckUtils]: 17: Hoare triple {47466#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {47466#true} is VALID [2022-04-28 15:36:28,681 INFO L290 TraceCheckUtils]: 18: Hoare triple {47466#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {47466#true} is VALID [2022-04-28 15:36:28,681 INFO L290 TraceCheckUtils]: 19: Hoare triple {47466#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {47466#true} is VALID [2022-04-28 15:36:28,681 INFO L290 TraceCheckUtils]: 20: Hoare triple {47466#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {47466#true} is VALID [2022-04-28 15:36:28,681 INFO L290 TraceCheckUtils]: 21: Hoare triple {47466#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {47466#true} is VALID [2022-04-28 15:36:28,681 INFO L290 TraceCheckUtils]: 22: Hoare triple {47466#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {47466#true} is VALID [2022-04-28 15:36:28,681 INFO L290 TraceCheckUtils]: 23: Hoare triple {47466#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {47466#true} is VALID [2022-04-28 15:36:28,681 INFO L290 TraceCheckUtils]: 24: Hoare triple {47466#true} assume 8464 == #t~mem55;havoc #t~mem55; {47466#true} is VALID [2022-04-28 15:36:28,681 INFO L290 TraceCheckUtils]: 25: Hoare triple {47466#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {47466#true} is VALID [2022-04-28 15:36:28,681 INFO L290 TraceCheckUtils]: 26: Hoare triple {47466#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {47466#true} is VALID [2022-04-28 15:36:28,681 INFO L290 TraceCheckUtils]: 27: Hoare triple {47466#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {47466#true} is VALID [2022-04-28 15:36:28,681 INFO L290 TraceCheckUtils]: 28: Hoare triple {47466#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {47466#true} is VALID [2022-04-28 15:36:28,681 INFO L290 TraceCheckUtils]: 29: Hoare triple {47466#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {47466#true} is VALID [2022-04-28 15:36:28,681 INFO L290 TraceCheckUtils]: 30: Hoare triple {47466#true} ~skip~0 := 0; {47466#true} is VALID [2022-04-28 15:36:28,681 INFO L290 TraceCheckUtils]: 31: Hoare triple {47466#true} assume !false; {47466#true} is VALID [2022-04-28 15:36:28,682 INFO L290 TraceCheckUtils]: 32: Hoare triple {47466#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {47466#true} is VALID [2022-04-28 15:36:28,682 INFO L290 TraceCheckUtils]: 33: Hoare triple {47466#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {47466#true} is VALID [2022-04-28 15:36:28,682 INFO L290 TraceCheckUtils]: 34: Hoare triple {47466#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {47466#true} is VALID [2022-04-28 15:36:28,682 INFO L290 TraceCheckUtils]: 35: Hoare triple {47466#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {47466#true} is VALID [2022-04-28 15:36:28,682 INFO L290 TraceCheckUtils]: 36: Hoare triple {47466#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {47466#true} is VALID [2022-04-28 15:36:28,682 INFO L290 TraceCheckUtils]: 37: Hoare triple {47466#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {47466#true} is VALID [2022-04-28 15:36:28,682 INFO L290 TraceCheckUtils]: 38: Hoare triple {47466#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {47466#true} is VALID [2022-04-28 15:36:28,682 INFO L290 TraceCheckUtils]: 39: Hoare triple {47466#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {47466#true} is VALID [2022-04-28 15:36:28,682 INFO L290 TraceCheckUtils]: 40: Hoare triple {47466#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {47466#true} is VALID [2022-04-28 15:36:28,682 INFO L290 TraceCheckUtils]: 41: Hoare triple {47466#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {47466#true} is VALID [2022-04-28 15:36:28,682 INFO L290 TraceCheckUtils]: 42: Hoare triple {47466#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {47466#true} is VALID [2022-04-28 15:36:28,682 INFO L290 TraceCheckUtils]: 43: Hoare triple {47466#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {47466#true} is VALID [2022-04-28 15:36:28,682 INFO L290 TraceCheckUtils]: 44: Hoare triple {47466#true} assume 8496 == #t~mem58;havoc #t~mem58; {47466#true} is VALID [2022-04-28 15:36:28,682 INFO L290 TraceCheckUtils]: 45: Hoare triple {47466#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {47466#true} is VALID [2022-04-28 15:36:28,682 INFO L290 TraceCheckUtils]: 46: Hoare triple {47466#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {47466#true} is VALID [2022-04-28 15:36:28,683 INFO L290 TraceCheckUtils]: 47: Hoare triple {47466#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {47466#true} is VALID [2022-04-28 15:36:28,683 INFO L290 TraceCheckUtils]: 48: Hoare triple {47466#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {47471#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:36:28,684 INFO L290 TraceCheckUtils]: 49: Hoare triple {47471#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {47471#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:36:28,684 INFO L290 TraceCheckUtils]: 50: Hoare triple {47471#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {47471#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:36:28,685 INFO L290 TraceCheckUtils]: 51: Hoare triple {47471#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {47471#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:36:28,685 INFO L290 TraceCheckUtils]: 52: Hoare triple {47471#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} ~skip~0 := 0; {47471#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:36:28,685 INFO L290 TraceCheckUtils]: 53: Hoare triple {47471#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {47471#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:36:28,686 INFO L290 TraceCheckUtils]: 54: Hoare triple {47471#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {47471#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:36:28,686 INFO L290 TraceCheckUtils]: 55: Hoare triple {47471#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {47471#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:36:28,686 INFO L290 TraceCheckUtils]: 56: Hoare triple {47471#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {47471#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:36:28,687 INFO L290 TraceCheckUtils]: 57: Hoare triple {47471#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {47471#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:36:28,687 INFO L290 TraceCheckUtils]: 58: Hoare triple {47471#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {47471#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:36:28,687 INFO L290 TraceCheckUtils]: 59: Hoare triple {47471#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {47471#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:36:28,688 INFO L290 TraceCheckUtils]: 60: Hoare triple {47471#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {47471#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:36:28,688 INFO L290 TraceCheckUtils]: 61: Hoare triple {47471#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {47471#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:36:28,688 INFO L290 TraceCheckUtils]: 62: Hoare triple {47471#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {47471#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:36:28,689 INFO L290 TraceCheckUtils]: 63: Hoare triple {47471#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {47471#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:36:28,689 INFO L290 TraceCheckUtils]: 64: Hoare triple {47471#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {47471#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:36:28,689 INFO L290 TraceCheckUtils]: 65: Hoare triple {47471#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {47471#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:36:28,690 INFO L290 TraceCheckUtils]: 66: Hoare triple {47471#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {47471#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:36:28,690 INFO L290 TraceCheckUtils]: 67: Hoare triple {47471#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {47471#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:36:28,690 INFO L290 TraceCheckUtils]: 68: Hoare triple {47471#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {47471#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:36:28,691 INFO L290 TraceCheckUtils]: 69: Hoare triple {47471#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {47471#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:36:28,691 INFO L290 TraceCheckUtils]: 70: Hoare triple {47471#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {47471#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:36:28,691 INFO L290 TraceCheckUtils]: 71: Hoare triple {47471#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {47472#(not (= |ssl3_accept_#t~mem64| 8544))} is VALID [2022-04-28 15:36:28,692 INFO L290 TraceCheckUtils]: 72: Hoare triple {47472#(not (= |ssl3_accept_#t~mem64| 8544))} assume 8544 == #t~mem64;havoc #t~mem64; {47467#false} is VALID [2022-04-28 15:36:28,692 INFO L290 TraceCheckUtils]: 73: Hoare triple {47467#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {47467#false} is VALID [2022-04-28 15:36:28,692 INFO L290 TraceCheckUtils]: 74: Hoare triple {47467#false} assume !(0 != #t~mem116);havoc #t~mem116;~skip~0 := 1;call #t~mem129.base, #t~mem129.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(0, #t~mem129.base, 975 + #t~mem129.offset, 4);havoc #t~mem129.base, #t~mem129.offset;call write~int(8560, ~s.base, 72 + ~s.offset, 4); {47467#false} is VALID [2022-04-28 15:36:28,692 INFO L290 TraceCheckUtils]: 75: Hoare triple {47467#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {47467#false} is VALID [2022-04-28 15:36:28,692 INFO L290 TraceCheckUtils]: 76: Hoare triple {47467#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {47467#false} is VALID [2022-04-28 15:36:28,692 INFO L290 TraceCheckUtils]: 77: Hoare triple {47467#false} ~skip~0 := 0; {47467#false} is VALID [2022-04-28 15:36:28,692 INFO L290 TraceCheckUtils]: 78: Hoare triple {47467#false} assume !false; {47467#false} is VALID [2022-04-28 15:36:28,692 INFO L290 TraceCheckUtils]: 79: Hoare triple {47467#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {47467#false} is VALID [2022-04-28 15:36:28,692 INFO L290 TraceCheckUtils]: 80: Hoare triple {47467#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {47467#false} is VALID [2022-04-28 15:36:28,692 INFO L290 TraceCheckUtils]: 81: Hoare triple {47467#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {47467#false} is VALID [2022-04-28 15:36:28,692 INFO L290 TraceCheckUtils]: 82: Hoare triple {47467#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {47467#false} is VALID [2022-04-28 15:36:28,692 INFO L290 TraceCheckUtils]: 83: Hoare triple {47467#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {47467#false} is VALID [2022-04-28 15:36:28,693 INFO L290 TraceCheckUtils]: 84: Hoare triple {47467#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {47467#false} is VALID [2022-04-28 15:36:28,693 INFO L290 TraceCheckUtils]: 85: Hoare triple {47467#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {47467#false} is VALID [2022-04-28 15:36:28,693 INFO L290 TraceCheckUtils]: 86: Hoare triple {47467#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {47467#false} is VALID [2022-04-28 15:36:28,693 INFO L290 TraceCheckUtils]: 87: Hoare triple {47467#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {47467#false} is VALID [2022-04-28 15:36:28,693 INFO L290 TraceCheckUtils]: 88: Hoare triple {47467#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {47467#false} is VALID [2022-04-28 15:36:28,693 INFO L290 TraceCheckUtils]: 89: Hoare triple {47467#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {47467#false} is VALID [2022-04-28 15:36:28,693 INFO L290 TraceCheckUtils]: 90: Hoare triple {47467#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {47467#false} is VALID [2022-04-28 15:36:28,693 INFO L290 TraceCheckUtils]: 91: Hoare triple {47467#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {47467#false} is VALID [2022-04-28 15:36:28,693 INFO L290 TraceCheckUtils]: 92: Hoare triple {47467#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {47467#false} is VALID [2022-04-28 15:36:28,693 INFO L290 TraceCheckUtils]: 93: Hoare triple {47467#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {47467#false} is VALID [2022-04-28 15:36:28,693 INFO L290 TraceCheckUtils]: 94: Hoare triple {47467#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {47467#false} is VALID [2022-04-28 15:36:28,693 INFO L290 TraceCheckUtils]: 95: Hoare triple {47467#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {47467#false} is VALID [2022-04-28 15:36:28,693 INFO L290 TraceCheckUtils]: 96: Hoare triple {47467#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {47467#false} is VALID [2022-04-28 15:36:28,693 INFO L290 TraceCheckUtils]: 97: Hoare triple {47467#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {47467#false} is VALID [2022-04-28 15:36:28,693 INFO L290 TraceCheckUtils]: 98: Hoare triple {47467#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {47467#false} is VALID [2022-04-28 15:36:28,694 INFO L290 TraceCheckUtils]: 99: Hoare triple {47467#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {47467#false} is VALID [2022-04-28 15:36:28,694 INFO L290 TraceCheckUtils]: 100: Hoare triple {47467#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {47467#false} is VALID [2022-04-28 15:36:28,694 INFO L290 TraceCheckUtils]: 101: Hoare triple {47467#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {47467#false} is VALID [2022-04-28 15:36:28,694 INFO L290 TraceCheckUtils]: 102: Hoare triple {47467#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {47467#false} is VALID [2022-04-28 15:36:28,694 INFO L290 TraceCheckUtils]: 103: Hoare triple {47467#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {47467#false} is VALID [2022-04-28 15:36:28,694 INFO L290 TraceCheckUtils]: 104: Hoare triple {47467#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {47467#false} is VALID [2022-04-28 15:36:28,694 INFO L290 TraceCheckUtils]: 105: Hoare triple {47467#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {47467#false} is VALID [2022-04-28 15:36:28,694 INFO L290 TraceCheckUtils]: 106: Hoare triple {47467#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {47467#false} is VALID [2022-04-28 15:36:28,694 INFO L290 TraceCheckUtils]: 107: Hoare triple {47467#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {47467#false} is VALID [2022-04-28 15:36:28,694 INFO L290 TraceCheckUtils]: 108: Hoare triple {47467#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {47467#false} is VALID [2022-04-28 15:36:28,694 INFO L290 TraceCheckUtils]: 109: Hoare triple {47467#false} assume 8641 == #t~mem76;havoc #t~mem76; {47467#false} is VALID [2022-04-28 15:36:28,694 INFO L290 TraceCheckUtils]: 110: Hoare triple {47467#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {47467#false} is VALID [2022-04-28 15:36:28,694 INFO L290 TraceCheckUtils]: 111: Hoare triple {47467#false} assume !(4 == ~blastFlag~0); {47467#false} is VALID [2022-04-28 15:36:28,694 INFO L290 TraceCheckUtils]: 112: Hoare triple {47467#false} assume !(7 == ~blastFlag~0); {47467#false} is VALID [2022-04-28 15:36:28,695 INFO L290 TraceCheckUtils]: 113: Hoare triple {47467#false} assume !(10 == ~blastFlag~0); {47467#false} is VALID [2022-04-28 15:36:28,695 INFO L290 TraceCheckUtils]: 114: Hoare triple {47467#false} assume !false; {47467#false} is VALID [2022-04-28 15:36:28,708 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-28 15:36:28,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:36:28,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869107235] [2022-04-28 15:36:28,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869107235] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:36:28,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:36:28,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:36:28,709 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:36:28,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [255051715] [2022-04-28 15:36:28,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [255051715] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:36:28,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:36:28,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:36:28,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522473965] [2022-04-28 15:36:28,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:36:28,711 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 115 [2022-04-28 15:36:28,711 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:36:28,711 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:36:28,784 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:36:28,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:36:28,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:36:28,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:36:28,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:36:28,784 INFO L87 Difference]: Start difference. First operand 350 states and 518 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:36:31,289 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:36:35,884 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:36:39,759 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:36:40,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:36:40,869 INFO L93 Difference]: Finished difference Result 796 states and 1197 transitions. [2022-04-28 15:36:40,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:36:40,869 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 115 [2022-04-28 15:36:40,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:36:40,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:36:40,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 587 transitions. [2022-04-28 15:36:40,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:36:40,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 587 transitions. [2022-04-28 15:36:40,874 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 587 transitions. [2022-04-28 15:36:41,279 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-28 15:36:41,288 INFO L225 Difference]: With dead ends: 796 [2022-04-28 15:36:41,288 INFO L226 Difference]: Without dead ends: 472 [2022-04-28 15:36:41,289 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-28 15:36:41,289 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 122 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-04-28 15:36:41,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 386 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2022-04-28 15:36:41,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2022-04-28 15:36:41,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 382. [2022-04-28 15:36:41,324 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:36:41,324 INFO L82 GeneralOperation]: Start isEquivalent. First operand 472 states. Second operand has 382 states, 377 states have (on average 1.4880636604774535) internal successors, (561), 377 states have internal predecessors, (561), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:36:41,325 INFO L74 IsIncluded]: Start isIncluded. First operand 472 states. Second operand has 382 states, 377 states have (on average 1.4880636604774535) internal successors, (561), 377 states have internal predecessors, (561), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:36:41,325 INFO L87 Difference]: Start difference. First operand 472 states. Second operand has 382 states, 377 states have (on average 1.4880636604774535) internal successors, (561), 377 states have internal predecessors, (561), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:36:41,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:36:41,332 INFO L93 Difference]: Finished difference Result 472 states and 706 transitions. [2022-04-28 15:36:41,332 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 706 transitions. [2022-04-28 15:36:41,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:36:41,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:36:41,333 INFO L74 IsIncluded]: Start isIncluded. First operand has 382 states, 377 states have (on average 1.4880636604774535) internal successors, (561), 377 states have internal predecessors, (561), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 472 states. [2022-04-28 15:36:41,333 INFO L87 Difference]: Start difference. First operand has 382 states, 377 states have (on average 1.4880636604774535) internal successors, (561), 377 states have internal predecessors, (561), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 472 states. [2022-04-28 15:36:41,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:36:41,340 INFO L93 Difference]: Finished difference Result 472 states and 706 transitions. [2022-04-28 15:36:41,340 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 706 transitions. [2022-04-28 15:36:41,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:36:41,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:36:41,341 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:36:41,341 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:36:41,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 377 states have (on average 1.4880636604774535) internal successors, (561), 377 states have internal predecessors, (561), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:36:41,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 565 transitions. [2022-04-28 15:36:41,348 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 565 transitions. Word has length 115 [2022-04-28 15:36:41,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:36:41,348 INFO L495 AbstractCegarLoop]: Abstraction has 382 states and 565 transitions. [2022-04-28 15:36:41,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:36:41,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 382 states and 565 transitions. [2022-04-28 15:36:41,773 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 565 edges. 565 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:36:41,774 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 565 transitions. [2022-04-28 15:36:41,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-04-28 15:36:41,774 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:36:41,775 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 15:36:41,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-28 15:36:41,775 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:36:41,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:36:41,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1348972035, now seen corresponding path program 1 times [2022-04-28 15:36:41,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:36:41,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [370606281] [2022-04-28 15:36:41,837 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:36:41,837 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:36:41,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1348972035, now seen corresponding path program 2 times [2022-04-28 15:36:41,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:36:41,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270822262] [2022-04-28 15:36:41,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:36:41,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:36:41,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:36:41,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:36:41,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:36:42,001 INFO L290 TraceCheckUtils]: 0: Hoare triple {50785#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {50778#true} is VALID [2022-04-28 15:36:42,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {50778#true} assume true; {50778#true} is VALID [2022-04-28 15:36:42,001 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {50778#true} {50778#true} #703#return; {50778#true} is VALID [2022-04-28 15:36:42,002 INFO L272 TraceCheckUtils]: 0: Hoare triple {50778#true} call ULTIMATE.init(); {50785#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-28 15:36:42,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {50785#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {50778#true} is VALID [2022-04-28 15:36:42,002 INFO L290 TraceCheckUtils]: 2: Hoare triple {50778#true} assume true; {50778#true} is VALID [2022-04-28 15:36:42,002 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50778#true} {50778#true} #703#return; {50778#true} is VALID [2022-04-28 15:36:42,002 INFO L272 TraceCheckUtils]: 4: Hoare triple {50778#true} call #t~ret161 := main(); {50778#true} is VALID [2022-04-28 15:36:42,002 INFO L290 TraceCheckUtils]: 5: Hoare triple {50778#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {50778#true} is VALID [2022-04-28 15:36:42,002 INFO L290 TraceCheckUtils]: 6: Hoare triple {50778#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {50778#true} is VALID [2022-04-28 15:36:42,002 INFO L272 TraceCheckUtils]: 7: Hoare triple {50778#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {50778#true} is VALID [2022-04-28 15:36:42,002 INFO L290 TraceCheckUtils]: 8: Hoare triple {50778#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {50778#true} is VALID [2022-04-28 15:36:42,002 INFO L290 TraceCheckUtils]: 9: Hoare triple {50778#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {50778#true} is VALID [2022-04-28 15:36:42,002 INFO L290 TraceCheckUtils]: 10: Hoare triple {50778#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {50778#true} is VALID [2022-04-28 15:36:42,003 INFO L290 TraceCheckUtils]: 11: Hoare triple {50778#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {50778#true} is VALID [2022-04-28 15:36:42,003 INFO L290 TraceCheckUtils]: 12: Hoare triple {50778#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {50778#true} is VALID [2022-04-28 15:36:42,003 INFO L290 TraceCheckUtils]: 13: Hoare triple {50778#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {50778#true} is VALID [2022-04-28 15:36:42,003 INFO L290 TraceCheckUtils]: 14: Hoare triple {50778#true} assume !false; {50778#true} is VALID [2022-04-28 15:36:42,003 INFO L290 TraceCheckUtils]: 15: Hoare triple {50778#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {50778#true} is VALID [2022-04-28 15:36:42,003 INFO L290 TraceCheckUtils]: 16: Hoare triple {50778#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {50778#true} is VALID [2022-04-28 15:36:42,003 INFO L290 TraceCheckUtils]: 17: Hoare triple {50778#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {50778#true} is VALID [2022-04-28 15:36:42,003 INFO L290 TraceCheckUtils]: 18: Hoare triple {50778#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {50778#true} is VALID [2022-04-28 15:36:42,003 INFO L290 TraceCheckUtils]: 19: Hoare triple {50778#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {50778#true} is VALID [2022-04-28 15:36:42,003 INFO L290 TraceCheckUtils]: 20: Hoare triple {50778#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {50778#true} is VALID [2022-04-28 15:36:42,003 INFO L290 TraceCheckUtils]: 21: Hoare triple {50778#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {50778#true} is VALID [2022-04-28 15:36:42,003 INFO L290 TraceCheckUtils]: 22: Hoare triple {50778#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {50778#true} is VALID [2022-04-28 15:36:42,003 INFO L290 TraceCheckUtils]: 23: Hoare triple {50778#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {50778#true} is VALID [2022-04-28 15:36:42,003 INFO L290 TraceCheckUtils]: 24: Hoare triple {50778#true} assume 8464 == #t~mem55;havoc #t~mem55; {50778#true} is VALID [2022-04-28 15:36:42,004 INFO L290 TraceCheckUtils]: 25: Hoare triple {50778#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {50778#true} is VALID [2022-04-28 15:36:42,004 INFO L290 TraceCheckUtils]: 26: Hoare triple {50778#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {50778#true} is VALID [2022-04-28 15:36:42,004 INFO L290 TraceCheckUtils]: 27: Hoare triple {50778#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {50778#true} is VALID [2022-04-28 15:36:42,004 INFO L290 TraceCheckUtils]: 28: Hoare triple {50778#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {50778#true} is VALID [2022-04-28 15:36:42,004 INFO L290 TraceCheckUtils]: 29: Hoare triple {50778#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {50778#true} is VALID [2022-04-28 15:36:42,004 INFO L290 TraceCheckUtils]: 30: Hoare triple {50778#true} ~skip~0 := 0; {50778#true} is VALID [2022-04-28 15:36:42,004 INFO L290 TraceCheckUtils]: 31: Hoare triple {50778#true} assume !false; {50778#true} is VALID [2022-04-28 15:36:42,004 INFO L290 TraceCheckUtils]: 32: Hoare triple {50778#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {50778#true} is VALID [2022-04-28 15:36:42,004 INFO L290 TraceCheckUtils]: 33: Hoare triple {50778#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {50778#true} is VALID [2022-04-28 15:36:42,004 INFO L290 TraceCheckUtils]: 34: Hoare triple {50778#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {50778#true} is VALID [2022-04-28 15:36:42,004 INFO L290 TraceCheckUtils]: 35: Hoare triple {50778#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {50778#true} is VALID [2022-04-28 15:36:42,004 INFO L290 TraceCheckUtils]: 36: Hoare triple {50778#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {50778#true} is VALID [2022-04-28 15:36:42,004 INFO L290 TraceCheckUtils]: 37: Hoare triple {50778#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {50778#true} is VALID [2022-04-28 15:36:42,004 INFO L290 TraceCheckUtils]: 38: Hoare triple {50778#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {50778#true} is VALID [2022-04-28 15:36:42,005 INFO L290 TraceCheckUtils]: 39: Hoare triple {50778#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {50778#true} is VALID [2022-04-28 15:36:42,005 INFO L290 TraceCheckUtils]: 40: Hoare triple {50778#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {50778#true} is VALID [2022-04-28 15:36:42,005 INFO L290 TraceCheckUtils]: 41: Hoare triple {50778#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {50778#true} is VALID [2022-04-28 15:36:42,005 INFO L290 TraceCheckUtils]: 42: Hoare triple {50778#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {50778#true} is VALID [2022-04-28 15:36:42,005 INFO L290 TraceCheckUtils]: 43: Hoare triple {50778#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {50778#true} is VALID [2022-04-28 15:36:42,005 INFO L290 TraceCheckUtils]: 44: Hoare triple {50778#true} assume 8496 == #t~mem58;havoc #t~mem58; {50778#true} is VALID [2022-04-28 15:36:42,005 INFO L290 TraceCheckUtils]: 45: Hoare triple {50778#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {50778#true} is VALID [2022-04-28 15:36:42,005 INFO L290 TraceCheckUtils]: 46: Hoare triple {50778#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {50778#true} is VALID [2022-04-28 15:36:42,005 INFO L290 TraceCheckUtils]: 47: Hoare triple {50778#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {50778#true} is VALID [2022-04-28 15:36:42,020 INFO L290 TraceCheckUtils]: 48: Hoare triple {50778#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {50783#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:42,020 INFO L290 TraceCheckUtils]: 49: Hoare triple {50783#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {50783#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:42,021 INFO L290 TraceCheckUtils]: 50: Hoare triple {50783#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {50783#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:42,021 INFO L290 TraceCheckUtils]: 51: Hoare triple {50783#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {50783#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:42,021 INFO L290 TraceCheckUtils]: 52: Hoare triple {50783#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {50783#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:42,022 INFO L290 TraceCheckUtils]: 53: Hoare triple {50783#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {50783#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:42,022 INFO L290 TraceCheckUtils]: 54: Hoare triple {50783#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {50783#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:42,022 INFO L290 TraceCheckUtils]: 55: Hoare triple {50783#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {50783#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:42,023 INFO L290 TraceCheckUtils]: 56: Hoare triple {50783#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {50783#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:42,023 INFO L290 TraceCheckUtils]: 57: Hoare triple {50783#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {50783#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:42,023 INFO L290 TraceCheckUtils]: 58: Hoare triple {50783#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {50783#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:42,024 INFO L290 TraceCheckUtils]: 59: Hoare triple {50783#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {50783#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:42,024 INFO L290 TraceCheckUtils]: 60: Hoare triple {50783#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {50783#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:42,024 INFO L290 TraceCheckUtils]: 61: Hoare triple {50783#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {50783#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:42,025 INFO L290 TraceCheckUtils]: 62: Hoare triple {50783#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {50783#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:42,025 INFO L290 TraceCheckUtils]: 63: Hoare triple {50783#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {50783#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:42,025 INFO L290 TraceCheckUtils]: 64: Hoare triple {50783#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {50783#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:42,026 INFO L290 TraceCheckUtils]: 65: Hoare triple {50783#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {50783#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:42,026 INFO L290 TraceCheckUtils]: 66: Hoare triple {50783#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {50783#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:42,026 INFO L290 TraceCheckUtils]: 67: Hoare triple {50783#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {50783#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:42,027 INFO L290 TraceCheckUtils]: 68: Hoare triple {50783#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {50783#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:42,027 INFO L290 TraceCheckUtils]: 69: Hoare triple {50783#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {50783#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:42,027 INFO L290 TraceCheckUtils]: 70: Hoare triple {50783#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {50783#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:42,028 INFO L290 TraceCheckUtils]: 71: Hoare triple {50783#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {50783#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:42,028 INFO L290 TraceCheckUtils]: 72: Hoare triple {50783#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {50784#(= |ssl3_accept_#t~mem65| 8656)} is VALID [2022-04-28 15:36:42,028 INFO L290 TraceCheckUtils]: 73: Hoare triple {50784#(= |ssl3_accept_#t~mem65| 8656)} assume 8545 == #t~mem65;havoc #t~mem65; {50779#false} is VALID [2022-04-28 15:36:42,028 INFO L290 TraceCheckUtils]: 74: Hoare triple {50779#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {50779#false} is VALID [2022-04-28 15:36:42,028 INFO L290 TraceCheckUtils]: 75: Hoare triple {50779#false} assume !(0 != #t~mem116);havoc #t~mem116;~skip~0 := 1;call #t~mem129.base, #t~mem129.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(0, #t~mem129.base, 975 + #t~mem129.offset, 4);havoc #t~mem129.base, #t~mem129.offset;call write~int(8560, ~s.base, 72 + ~s.offset, 4); {50779#false} is VALID [2022-04-28 15:36:42,029 INFO L290 TraceCheckUtils]: 76: Hoare triple {50779#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {50779#false} is VALID [2022-04-28 15:36:42,029 INFO L290 TraceCheckUtils]: 77: Hoare triple {50779#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {50779#false} is VALID [2022-04-28 15:36:42,029 INFO L290 TraceCheckUtils]: 78: Hoare triple {50779#false} ~skip~0 := 0; {50779#false} is VALID [2022-04-28 15:36:42,029 INFO L290 TraceCheckUtils]: 79: Hoare triple {50779#false} assume !false; {50779#false} is VALID [2022-04-28 15:36:42,029 INFO L290 TraceCheckUtils]: 80: Hoare triple {50779#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {50779#false} is VALID [2022-04-28 15:36:42,029 INFO L290 TraceCheckUtils]: 81: Hoare triple {50779#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {50779#false} is VALID [2022-04-28 15:36:42,029 INFO L290 TraceCheckUtils]: 82: Hoare triple {50779#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {50779#false} is VALID [2022-04-28 15:36:42,029 INFO L290 TraceCheckUtils]: 83: Hoare triple {50779#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {50779#false} is VALID [2022-04-28 15:36:42,029 INFO L290 TraceCheckUtils]: 84: Hoare triple {50779#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {50779#false} is VALID [2022-04-28 15:36:42,029 INFO L290 TraceCheckUtils]: 85: Hoare triple {50779#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {50779#false} is VALID [2022-04-28 15:36:42,029 INFO L290 TraceCheckUtils]: 86: Hoare triple {50779#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {50779#false} is VALID [2022-04-28 15:36:42,029 INFO L290 TraceCheckUtils]: 87: Hoare triple {50779#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {50779#false} is VALID [2022-04-28 15:36:42,029 INFO L290 TraceCheckUtils]: 88: Hoare triple {50779#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {50779#false} is VALID [2022-04-28 15:36:42,029 INFO L290 TraceCheckUtils]: 89: Hoare triple {50779#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {50779#false} is VALID [2022-04-28 15:36:42,029 INFO L290 TraceCheckUtils]: 90: Hoare triple {50779#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {50779#false} is VALID [2022-04-28 15:36:42,030 INFO L290 TraceCheckUtils]: 91: Hoare triple {50779#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {50779#false} is VALID [2022-04-28 15:36:42,030 INFO L290 TraceCheckUtils]: 92: Hoare triple {50779#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {50779#false} is VALID [2022-04-28 15:36:42,030 INFO L290 TraceCheckUtils]: 93: Hoare triple {50779#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {50779#false} is VALID [2022-04-28 15:36:42,030 INFO L290 TraceCheckUtils]: 94: Hoare triple {50779#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {50779#false} is VALID [2022-04-28 15:36:42,030 INFO L290 TraceCheckUtils]: 95: Hoare triple {50779#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {50779#false} is VALID [2022-04-28 15:36:42,030 INFO L290 TraceCheckUtils]: 96: Hoare triple {50779#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {50779#false} is VALID [2022-04-28 15:36:42,030 INFO L290 TraceCheckUtils]: 97: Hoare triple {50779#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {50779#false} is VALID [2022-04-28 15:36:42,030 INFO L290 TraceCheckUtils]: 98: Hoare triple {50779#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {50779#false} is VALID [2022-04-28 15:36:42,030 INFO L290 TraceCheckUtils]: 99: Hoare triple {50779#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {50779#false} is VALID [2022-04-28 15:36:42,030 INFO L290 TraceCheckUtils]: 100: Hoare triple {50779#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {50779#false} is VALID [2022-04-28 15:36:42,030 INFO L290 TraceCheckUtils]: 101: Hoare triple {50779#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {50779#false} is VALID [2022-04-28 15:36:42,030 INFO L290 TraceCheckUtils]: 102: Hoare triple {50779#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {50779#false} is VALID [2022-04-28 15:36:42,030 INFO L290 TraceCheckUtils]: 103: Hoare triple {50779#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {50779#false} is VALID [2022-04-28 15:36:42,030 INFO L290 TraceCheckUtils]: 104: Hoare triple {50779#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {50779#false} is VALID [2022-04-28 15:36:42,031 INFO L290 TraceCheckUtils]: 105: Hoare triple {50779#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {50779#false} is VALID [2022-04-28 15:36:42,031 INFO L290 TraceCheckUtils]: 106: Hoare triple {50779#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {50779#false} is VALID [2022-04-28 15:36:42,031 INFO L290 TraceCheckUtils]: 107: Hoare triple {50779#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {50779#false} is VALID [2022-04-28 15:36:42,031 INFO L290 TraceCheckUtils]: 108: Hoare triple {50779#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {50779#false} is VALID [2022-04-28 15:36:42,031 INFO L290 TraceCheckUtils]: 109: Hoare triple {50779#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {50779#false} is VALID [2022-04-28 15:36:42,031 INFO L290 TraceCheckUtils]: 110: Hoare triple {50779#false} assume 8641 == #t~mem76;havoc #t~mem76; {50779#false} is VALID [2022-04-28 15:36:42,031 INFO L290 TraceCheckUtils]: 111: Hoare triple {50779#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {50779#false} is VALID [2022-04-28 15:36:42,031 INFO L290 TraceCheckUtils]: 112: Hoare triple {50779#false} assume !(4 == ~blastFlag~0); {50779#false} is VALID [2022-04-28 15:36:42,031 INFO L290 TraceCheckUtils]: 113: Hoare triple {50779#false} assume !(7 == ~blastFlag~0); {50779#false} is VALID [2022-04-28 15:36:42,031 INFO L290 TraceCheckUtils]: 114: Hoare triple {50779#false} assume !(10 == ~blastFlag~0); {50779#false} is VALID [2022-04-28 15:36:42,031 INFO L290 TraceCheckUtils]: 115: Hoare triple {50779#false} assume !false; {50779#false} is VALID [2022-04-28 15:36:42,032 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 15:36:42,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:36:42,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270822262] [2022-04-28 15:36:42,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270822262] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:36:42,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:36:42,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:36:42,032 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:36:42,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [370606281] [2022-04-28 15:36:42,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [370606281] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:36:42,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:36:42,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:36:42,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278331826] [2022-04-28 15:36:42,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:36:42,033 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 116 [2022-04-28 15:36:42,033 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:36:42,033 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:36:42,110 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:36:42,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:36:42,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:36:42,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:36:42,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:36:42,111 INFO L87 Difference]: Start difference. First operand 382 states and 565 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:36:46,696 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:36:49,128 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:36:51,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:36:51,223 INFO L93 Difference]: Finished difference Result 775 states and 1151 transitions. [2022-04-28 15:36:51,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:36:51,223 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 116 [2022-04-28 15:36:51,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:36:51,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:36:51,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 539 transitions. [2022-04-28 15:36:51,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:36:51,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 539 transitions. [2022-04-28 15:36:51,227 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 539 transitions. [2022-04-28 15:36:51,573 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 539 edges. 539 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:36:51,581 INFO L225 Difference]: With dead ends: 775 [2022-04-28 15:36:51,581 INFO L226 Difference]: Without dead ends: 419 [2022-04-28 15:36:51,582 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-28 15:36:51,583 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 72 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:36:51,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 529 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 490 Invalid, 1 Unknown, 0 Unchecked, 5.4s Time] [2022-04-28 15:36:51,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2022-04-28 15:36:51,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 382. [2022-04-28 15:36:51,623 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:36:51,623 INFO L82 GeneralOperation]: Start isEquivalent. First operand 419 states. Second operand has 382 states, 377 states have (on average 1.4854111405835544) internal successors, (560), 377 states have internal predecessors, (560), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:36:51,624 INFO L74 IsIncluded]: Start isIncluded. First operand 419 states. Second operand has 382 states, 377 states have (on average 1.4854111405835544) internal successors, (560), 377 states have internal predecessors, (560), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:36:51,624 INFO L87 Difference]: Start difference. First operand 419 states. Second operand has 382 states, 377 states have (on average 1.4854111405835544) internal successors, (560), 377 states have internal predecessors, (560), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:36:51,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:36:51,630 INFO L93 Difference]: Finished difference Result 419 states and 615 transitions. [2022-04-28 15:36:51,630 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 615 transitions. [2022-04-28 15:36:51,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:36:51,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:36:51,631 INFO L74 IsIncluded]: Start isIncluded. First operand has 382 states, 377 states have (on average 1.4854111405835544) internal successors, (560), 377 states have internal predecessors, (560), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 419 states. [2022-04-28 15:36:51,631 INFO L87 Difference]: Start difference. First operand has 382 states, 377 states have (on average 1.4854111405835544) internal successors, (560), 377 states have internal predecessors, (560), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 419 states. [2022-04-28 15:36:51,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:36:51,640 INFO L93 Difference]: Finished difference Result 419 states and 615 transitions. [2022-04-28 15:36:51,640 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 615 transitions. [2022-04-28 15:36:51,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:36:51,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:36:51,640 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:36:51,640 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:36:51,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 377 states have (on average 1.4854111405835544) internal successors, (560), 377 states have internal predecessors, (560), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:36:51,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 564 transitions. [2022-04-28 15:36:51,647 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 564 transitions. Word has length 116 [2022-04-28 15:36:51,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:36:51,648 INFO L495 AbstractCegarLoop]: Abstraction has 382 states and 564 transitions. [2022-04-28 15:36:51,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:36:51,648 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 382 states and 564 transitions. [2022-04-28 15:36:52,080 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 564 edges. 564 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:36:52,080 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 564 transitions. [2022-04-28 15:36:52,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-04-28 15:36:52,081 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:36:52,081 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 15:36:52,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-28 15:36:52,081 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:36:52,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:36:52,081 INFO L85 PathProgramCache]: Analyzing trace with hash -898042456, now seen corresponding path program 1 times [2022-04-28 15:36:52,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:36:52,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [634065467] [2022-04-28 15:36:52,167 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:36:52,167 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:36:52,167 INFO L85 PathProgramCache]: Analyzing trace with hash -898042456, now seen corresponding path program 2 times [2022-04-28 15:36:52,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:36:52,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954149217] [2022-04-28 15:36:52,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:36:52,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:36:52,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:36:52,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:36:52,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:36:52,370 INFO L290 TraceCheckUtils]: 0: Hoare triple {53949#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {53942#true} is VALID [2022-04-28 15:36:52,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {53942#true} assume true; {53942#true} is VALID [2022-04-28 15:36:52,370 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {53942#true} {53942#true} #703#return; {53942#true} is VALID [2022-04-28 15:36:52,371 INFO L272 TraceCheckUtils]: 0: Hoare triple {53942#true} call ULTIMATE.init(); {53949#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-28 15:36:52,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {53949#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {53942#true} is VALID [2022-04-28 15:36:52,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {53942#true} assume true; {53942#true} is VALID [2022-04-28 15:36:52,371 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53942#true} {53942#true} #703#return; {53942#true} is VALID [2022-04-28 15:36:52,371 INFO L272 TraceCheckUtils]: 4: Hoare triple {53942#true} call #t~ret161 := main(); {53942#true} is VALID [2022-04-28 15:36:52,372 INFO L290 TraceCheckUtils]: 5: Hoare triple {53942#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {53942#true} is VALID [2022-04-28 15:36:52,372 INFO L290 TraceCheckUtils]: 6: Hoare triple {53942#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {53942#true} is VALID [2022-04-28 15:36:52,372 INFO L272 TraceCheckUtils]: 7: Hoare triple {53942#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {53942#true} is VALID [2022-04-28 15:36:52,372 INFO L290 TraceCheckUtils]: 8: Hoare triple {53942#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {53942#true} is VALID [2022-04-28 15:36:52,372 INFO L290 TraceCheckUtils]: 9: Hoare triple {53942#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {53942#true} is VALID [2022-04-28 15:36:52,372 INFO L290 TraceCheckUtils]: 10: Hoare triple {53942#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {53942#true} is VALID [2022-04-28 15:36:52,372 INFO L290 TraceCheckUtils]: 11: Hoare triple {53942#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {53942#true} is VALID [2022-04-28 15:36:52,372 INFO L290 TraceCheckUtils]: 12: Hoare triple {53942#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {53942#true} is VALID [2022-04-28 15:36:52,372 INFO L290 TraceCheckUtils]: 13: Hoare triple {53942#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {53942#true} is VALID [2022-04-28 15:36:52,372 INFO L290 TraceCheckUtils]: 14: Hoare triple {53942#true} assume !false; {53942#true} is VALID [2022-04-28 15:36:52,372 INFO L290 TraceCheckUtils]: 15: Hoare triple {53942#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {53942#true} is VALID [2022-04-28 15:36:52,372 INFO L290 TraceCheckUtils]: 16: Hoare triple {53942#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {53942#true} is VALID [2022-04-28 15:36:52,372 INFO L290 TraceCheckUtils]: 17: Hoare triple {53942#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {53942#true} is VALID [2022-04-28 15:36:52,372 INFO L290 TraceCheckUtils]: 18: Hoare triple {53942#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {53942#true} is VALID [2022-04-28 15:36:52,373 INFO L290 TraceCheckUtils]: 19: Hoare triple {53942#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {53942#true} is VALID [2022-04-28 15:36:52,373 INFO L290 TraceCheckUtils]: 20: Hoare triple {53942#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {53942#true} is VALID [2022-04-28 15:36:52,373 INFO L290 TraceCheckUtils]: 21: Hoare triple {53942#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {53942#true} is VALID [2022-04-28 15:36:52,373 INFO L290 TraceCheckUtils]: 22: Hoare triple {53942#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {53942#true} is VALID [2022-04-28 15:36:52,373 INFO L290 TraceCheckUtils]: 23: Hoare triple {53942#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {53942#true} is VALID [2022-04-28 15:36:52,373 INFO L290 TraceCheckUtils]: 24: Hoare triple {53942#true} assume 8464 == #t~mem55;havoc #t~mem55; {53942#true} is VALID [2022-04-28 15:36:52,373 INFO L290 TraceCheckUtils]: 25: Hoare triple {53942#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {53942#true} is VALID [2022-04-28 15:36:52,373 INFO L290 TraceCheckUtils]: 26: Hoare triple {53942#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {53942#true} is VALID [2022-04-28 15:36:52,373 INFO L290 TraceCheckUtils]: 27: Hoare triple {53942#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {53942#true} is VALID [2022-04-28 15:36:52,373 INFO L290 TraceCheckUtils]: 28: Hoare triple {53942#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {53942#true} is VALID [2022-04-28 15:36:52,373 INFO L290 TraceCheckUtils]: 29: Hoare triple {53942#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {53942#true} is VALID [2022-04-28 15:36:52,373 INFO L290 TraceCheckUtils]: 30: Hoare triple {53942#true} ~skip~0 := 0; {53942#true} is VALID [2022-04-28 15:36:52,373 INFO L290 TraceCheckUtils]: 31: Hoare triple {53942#true} assume !false; {53942#true} is VALID [2022-04-28 15:36:52,373 INFO L290 TraceCheckUtils]: 32: Hoare triple {53942#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {53942#true} is VALID [2022-04-28 15:36:52,374 INFO L290 TraceCheckUtils]: 33: Hoare triple {53942#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {53942#true} is VALID [2022-04-28 15:36:52,374 INFO L290 TraceCheckUtils]: 34: Hoare triple {53942#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {53942#true} is VALID [2022-04-28 15:36:52,374 INFO L290 TraceCheckUtils]: 35: Hoare triple {53942#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {53942#true} is VALID [2022-04-28 15:36:52,374 INFO L290 TraceCheckUtils]: 36: Hoare triple {53942#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {53942#true} is VALID [2022-04-28 15:36:52,374 INFO L290 TraceCheckUtils]: 37: Hoare triple {53942#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {53942#true} is VALID [2022-04-28 15:36:52,374 INFO L290 TraceCheckUtils]: 38: Hoare triple {53942#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {53942#true} is VALID [2022-04-28 15:36:52,374 INFO L290 TraceCheckUtils]: 39: Hoare triple {53942#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {53942#true} is VALID [2022-04-28 15:36:52,374 INFO L290 TraceCheckUtils]: 40: Hoare triple {53942#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {53942#true} is VALID [2022-04-28 15:36:52,374 INFO L290 TraceCheckUtils]: 41: Hoare triple {53942#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {53942#true} is VALID [2022-04-28 15:36:52,374 INFO L290 TraceCheckUtils]: 42: Hoare triple {53942#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {53942#true} is VALID [2022-04-28 15:36:52,374 INFO L290 TraceCheckUtils]: 43: Hoare triple {53942#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {53942#true} is VALID [2022-04-28 15:36:52,374 INFO L290 TraceCheckUtils]: 44: Hoare triple {53942#true} assume 8496 == #t~mem58;havoc #t~mem58; {53942#true} is VALID [2022-04-28 15:36:52,374 INFO L290 TraceCheckUtils]: 45: Hoare triple {53942#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {53942#true} is VALID [2022-04-28 15:36:52,374 INFO L290 TraceCheckUtils]: 46: Hoare triple {53942#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {53942#true} is VALID [2022-04-28 15:36:52,374 INFO L290 TraceCheckUtils]: 47: Hoare triple {53942#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {53942#true} is VALID [2022-04-28 15:36:52,375 INFO L290 TraceCheckUtils]: 48: Hoare triple {53942#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {53947#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:36:52,376 INFO L290 TraceCheckUtils]: 49: Hoare triple {53947#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {53947#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:36:52,376 INFO L290 TraceCheckUtils]: 50: Hoare triple {53947#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {53947#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:36:52,376 INFO L290 TraceCheckUtils]: 51: Hoare triple {53947#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {53947#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:36:52,377 INFO L290 TraceCheckUtils]: 52: Hoare triple {53947#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} ~skip~0 := 0; {53947#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:36:52,377 INFO L290 TraceCheckUtils]: 53: Hoare triple {53947#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {53947#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:36:52,377 INFO L290 TraceCheckUtils]: 54: Hoare triple {53947#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {53947#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:36:52,378 INFO L290 TraceCheckUtils]: 55: Hoare triple {53947#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {53947#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:36:52,378 INFO L290 TraceCheckUtils]: 56: Hoare triple {53947#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {53947#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:36:52,378 INFO L290 TraceCheckUtils]: 57: Hoare triple {53947#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {53947#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:36:52,379 INFO L290 TraceCheckUtils]: 58: Hoare triple {53947#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {53947#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:36:52,379 INFO L290 TraceCheckUtils]: 59: Hoare triple {53947#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {53947#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:36:52,379 INFO L290 TraceCheckUtils]: 60: Hoare triple {53947#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {53947#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:36:52,380 INFO L290 TraceCheckUtils]: 61: Hoare triple {53947#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {53947#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:36:52,380 INFO L290 TraceCheckUtils]: 62: Hoare triple {53947#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {53947#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:36:52,380 INFO L290 TraceCheckUtils]: 63: Hoare triple {53947#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {53947#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:36:52,381 INFO L290 TraceCheckUtils]: 64: Hoare triple {53947#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {53947#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:36:52,381 INFO L290 TraceCheckUtils]: 65: Hoare triple {53947#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {53947#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:36:52,381 INFO L290 TraceCheckUtils]: 66: Hoare triple {53947#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {53947#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:36:52,382 INFO L290 TraceCheckUtils]: 67: Hoare triple {53947#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {53947#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:36:52,382 INFO L290 TraceCheckUtils]: 68: Hoare triple {53947#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {53947#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:36:52,382 INFO L290 TraceCheckUtils]: 69: Hoare triple {53947#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {53947#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:36:52,383 INFO L290 TraceCheckUtils]: 70: Hoare triple {53947#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {53947#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:36:52,383 INFO L290 TraceCheckUtils]: 71: Hoare triple {53947#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {53947#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:36:52,383 INFO L290 TraceCheckUtils]: 72: Hoare triple {53947#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {53947#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:36:52,384 INFO L290 TraceCheckUtils]: 73: Hoare triple {53947#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {53948#(not (= 8560 |ssl3_accept_#t~mem66|))} is VALID [2022-04-28 15:36:52,384 INFO L290 TraceCheckUtils]: 74: Hoare triple {53948#(not (= 8560 |ssl3_accept_#t~mem66|))} assume 8560 == #t~mem66;havoc #t~mem66; {53943#false} is VALID [2022-04-28 15:36:52,384 INFO L290 TraceCheckUtils]: 75: Hoare triple {53943#false} assume -2147483648 <= #t~nondet130 && #t~nondet130 <= 2147483647;~ret~0 := #t~nondet130;havoc #t~nondet130; {53943#false} is VALID [2022-04-28 15:36:52,384 INFO L290 TraceCheckUtils]: 76: Hoare triple {53943#false} assume !(~ret~0 <= 0);call #t~mem131.base, #t~mem131.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8576, #t~mem131.base, 904 + #t~mem131.offset, 4);havoc #t~mem131.base, #t~mem131.offset;call write~int(8448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {53943#false} is VALID [2022-04-28 15:36:52,384 INFO L290 TraceCheckUtils]: 77: Hoare triple {53943#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {53943#false} is VALID [2022-04-28 15:36:52,384 INFO L290 TraceCheckUtils]: 78: Hoare triple {53943#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {53943#false} is VALID [2022-04-28 15:36:52,384 INFO L290 TraceCheckUtils]: 79: Hoare triple {53943#false} ~skip~0 := 0; {53943#false} is VALID [2022-04-28 15:36:52,385 INFO L290 TraceCheckUtils]: 80: Hoare triple {53943#false} assume !false; {53943#false} is VALID [2022-04-28 15:36:52,385 INFO L290 TraceCheckUtils]: 81: Hoare triple {53943#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {53943#false} is VALID [2022-04-28 15:36:52,385 INFO L290 TraceCheckUtils]: 82: Hoare triple {53943#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {53943#false} is VALID [2022-04-28 15:36:52,385 INFO L290 TraceCheckUtils]: 83: Hoare triple {53943#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {53943#false} is VALID [2022-04-28 15:36:52,385 INFO L290 TraceCheckUtils]: 84: Hoare triple {53943#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {53943#false} is VALID [2022-04-28 15:36:52,385 INFO L290 TraceCheckUtils]: 85: Hoare triple {53943#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {53943#false} is VALID [2022-04-28 15:36:52,385 INFO L290 TraceCheckUtils]: 86: Hoare triple {53943#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {53943#false} is VALID [2022-04-28 15:36:52,385 INFO L290 TraceCheckUtils]: 87: Hoare triple {53943#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {53943#false} is VALID [2022-04-28 15:36:52,385 INFO L290 TraceCheckUtils]: 88: Hoare triple {53943#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {53943#false} is VALID [2022-04-28 15:36:52,385 INFO L290 TraceCheckUtils]: 89: Hoare triple {53943#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {53943#false} is VALID [2022-04-28 15:36:52,385 INFO L290 TraceCheckUtils]: 90: Hoare triple {53943#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {53943#false} is VALID [2022-04-28 15:36:52,385 INFO L290 TraceCheckUtils]: 91: Hoare triple {53943#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {53943#false} is VALID [2022-04-28 15:36:52,385 INFO L290 TraceCheckUtils]: 92: Hoare triple {53943#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {53943#false} is VALID [2022-04-28 15:36:52,385 INFO L290 TraceCheckUtils]: 93: Hoare triple {53943#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {53943#false} is VALID [2022-04-28 15:36:52,386 INFO L290 TraceCheckUtils]: 94: Hoare triple {53943#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {53943#false} is VALID [2022-04-28 15:36:52,386 INFO L290 TraceCheckUtils]: 95: Hoare triple {53943#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {53943#false} is VALID [2022-04-28 15:36:52,386 INFO L290 TraceCheckUtils]: 96: Hoare triple {53943#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {53943#false} is VALID [2022-04-28 15:36:52,386 INFO L290 TraceCheckUtils]: 97: Hoare triple {53943#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {53943#false} is VALID [2022-04-28 15:36:52,386 INFO L290 TraceCheckUtils]: 98: Hoare triple {53943#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {53943#false} is VALID [2022-04-28 15:36:52,386 INFO L290 TraceCheckUtils]: 99: Hoare triple {53943#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {53943#false} is VALID [2022-04-28 15:36:52,386 INFO L290 TraceCheckUtils]: 100: Hoare triple {53943#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {53943#false} is VALID [2022-04-28 15:36:52,386 INFO L290 TraceCheckUtils]: 101: Hoare triple {53943#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {53943#false} is VALID [2022-04-28 15:36:52,386 INFO L290 TraceCheckUtils]: 102: Hoare triple {53943#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {53943#false} is VALID [2022-04-28 15:36:52,386 INFO L290 TraceCheckUtils]: 103: Hoare triple {53943#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {53943#false} is VALID [2022-04-28 15:36:52,386 INFO L290 TraceCheckUtils]: 104: Hoare triple {53943#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {53943#false} is VALID [2022-04-28 15:36:52,386 INFO L290 TraceCheckUtils]: 105: Hoare triple {53943#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {53943#false} is VALID [2022-04-28 15:36:52,386 INFO L290 TraceCheckUtils]: 106: Hoare triple {53943#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {53943#false} is VALID [2022-04-28 15:36:52,386 INFO L290 TraceCheckUtils]: 107: Hoare triple {53943#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {53943#false} is VALID [2022-04-28 15:36:52,386 INFO L290 TraceCheckUtils]: 108: Hoare triple {53943#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {53943#false} is VALID [2022-04-28 15:36:52,387 INFO L290 TraceCheckUtils]: 109: Hoare triple {53943#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {53943#false} is VALID [2022-04-28 15:36:52,387 INFO L290 TraceCheckUtils]: 110: Hoare triple {53943#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {53943#false} is VALID [2022-04-28 15:36:52,387 INFO L290 TraceCheckUtils]: 111: Hoare triple {53943#false} assume 8641 == #t~mem76;havoc #t~mem76; {53943#false} is VALID [2022-04-28 15:36:52,387 INFO L290 TraceCheckUtils]: 112: Hoare triple {53943#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {53943#false} is VALID [2022-04-28 15:36:52,387 INFO L290 TraceCheckUtils]: 113: Hoare triple {53943#false} assume !(4 == ~blastFlag~0); {53943#false} is VALID [2022-04-28 15:36:52,387 INFO L290 TraceCheckUtils]: 114: Hoare triple {53943#false} assume !(7 == ~blastFlag~0); {53943#false} is VALID [2022-04-28 15:36:52,387 INFO L290 TraceCheckUtils]: 115: Hoare triple {53943#false} assume !(10 == ~blastFlag~0); {53943#false} is VALID [2022-04-28 15:36:52,387 INFO L290 TraceCheckUtils]: 116: Hoare triple {53943#false} assume !false; {53943#false} is VALID [2022-04-28 15:36:52,387 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 15:36:52,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:36:52,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954149217] [2022-04-28 15:36:52,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954149217] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:36:52,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:36:52,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:36:52,388 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:36:52,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [634065467] [2022-04-28 15:36:52,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [634065467] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:36:52,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:36:52,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:36:52,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506750373] [2022-04-28 15:36:52,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:36:52,389 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 117 [2022-04-28 15:36:52,389 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:36:52,389 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:36:52,463 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:36:52,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:36:52,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:36:52,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:36:52,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:36:52,464 INFO L87 Difference]: Start difference. First operand 382 states and 564 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:36:54,632 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:37:00,886 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:37:02,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:37:02,079 INFO L93 Difference]: Finished difference Result 856 states and 1280 transitions. [2022-04-28 15:37:02,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:37:02,080 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 117 [2022-04-28 15:37:02,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:37:02,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:37:02,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 587 transitions. [2022-04-28 15:37:02,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:37:02,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 587 transitions. [2022-04-28 15:37:02,088 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 587 transitions. [2022-04-28 15:37:02,476 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-28 15:37:02,486 INFO L225 Difference]: With dead ends: 856 [2022-04-28 15:37:02,487 INFO L226 Difference]: Without dead ends: 500 [2022-04-28 15:37:02,488 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-28 15:37:02,488 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 120 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 48 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-04-28 15:37:02,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 386 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 471 Invalid, 1 Unknown, 0 Unchecked, 4.9s Time] [2022-04-28 15:37:02,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2022-04-28 15:37:02,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 414. [2022-04-28 15:37:02,505 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:37:02,506 INFO L82 GeneralOperation]: Start isEquivalent. First operand 500 states. Second operand has 414 states, 409 states have (on average 1.4816625916870416) internal successors, (606), 409 states have internal predecessors, (606), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:37:02,506 INFO L74 IsIncluded]: Start isIncluded. First operand 500 states. Second operand has 414 states, 409 states have (on average 1.4816625916870416) internal successors, (606), 409 states have internal predecessors, (606), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:37:02,506 INFO L87 Difference]: Start difference. First operand 500 states. Second operand has 414 states, 409 states have (on average 1.4816625916870416) internal successors, (606), 409 states have internal predecessors, (606), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:37:02,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:37:02,514 INFO L93 Difference]: Finished difference Result 500 states and 743 transitions. [2022-04-28 15:37:02,514 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 743 transitions. [2022-04-28 15:37:02,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:37:02,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:37:02,515 INFO L74 IsIncluded]: Start isIncluded. First operand has 414 states, 409 states have (on average 1.4816625916870416) internal successors, (606), 409 states have internal predecessors, (606), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 500 states. [2022-04-28 15:37:02,516 INFO L87 Difference]: Start difference. First operand has 414 states, 409 states have (on average 1.4816625916870416) internal successors, (606), 409 states have internal predecessors, (606), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 500 states. [2022-04-28 15:37:02,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:37:02,524 INFO L93 Difference]: Finished difference Result 500 states and 743 transitions. [2022-04-28 15:37:02,524 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 743 transitions. [2022-04-28 15:37:02,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:37:02,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:37:02,524 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:37:02,525 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:37:02,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 409 states have (on average 1.4816625916870416) internal successors, (606), 409 states have internal predecessors, (606), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:37:02,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 610 transitions. [2022-04-28 15:37:02,533 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 610 transitions. Word has length 117 [2022-04-28 15:37:02,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:37:02,533 INFO L495 AbstractCegarLoop]: Abstraction has 414 states and 610 transitions. [2022-04-28 15:37:02,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:37:02,533 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 414 states and 610 transitions. [2022-04-28 15:37:03,044 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 610 edges. 610 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:37:03,044 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 610 transitions. [2022-04-28 15:37:03,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-04-28 15:37:03,045 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:37:03,045 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 15:37:03,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-28 15:37:03,046 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:37:03,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:37:03,046 INFO L85 PathProgramCache]: Analyzing trace with hash -457817079, now seen corresponding path program 1 times [2022-04-28 15:37:03,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:37:03,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [707727840] [2022-04-28 15:37:03,108 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:37:03,108 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:37:03,108 INFO L85 PathProgramCache]: Analyzing trace with hash -457817079, now seen corresponding path program 2 times [2022-04-28 15:37:03,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:37:03,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455512920] [2022-04-28 15:37:03,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:37:03,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:37:03,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:37:03,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:37:03,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:37:03,212 INFO L290 TraceCheckUtils]: 0: Hoare triple {57501#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {57494#true} is VALID [2022-04-28 15:37:03,212 INFO L290 TraceCheckUtils]: 1: Hoare triple {57494#true} assume true; {57494#true} is VALID [2022-04-28 15:37:03,212 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {57494#true} {57494#true} #703#return; {57494#true} is VALID [2022-04-28 15:37:03,213 INFO L272 TraceCheckUtils]: 0: Hoare triple {57494#true} call ULTIMATE.init(); {57501#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-28 15:37:03,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {57501#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {57494#true} is VALID [2022-04-28 15:37:03,213 INFO L290 TraceCheckUtils]: 2: Hoare triple {57494#true} assume true; {57494#true} is VALID [2022-04-28 15:37:03,213 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57494#true} {57494#true} #703#return; {57494#true} is VALID [2022-04-28 15:37:03,213 INFO L272 TraceCheckUtils]: 4: Hoare triple {57494#true} call #t~ret161 := main(); {57494#true} is VALID [2022-04-28 15:37:03,214 INFO L290 TraceCheckUtils]: 5: Hoare triple {57494#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {57494#true} is VALID [2022-04-28 15:37:03,214 INFO L290 TraceCheckUtils]: 6: Hoare triple {57494#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {57494#true} is VALID [2022-04-28 15:37:03,214 INFO L272 TraceCheckUtils]: 7: Hoare triple {57494#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {57494#true} is VALID [2022-04-28 15:37:03,214 INFO L290 TraceCheckUtils]: 8: Hoare triple {57494#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {57494#true} is VALID [2022-04-28 15:37:03,214 INFO L290 TraceCheckUtils]: 9: Hoare triple {57494#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {57494#true} is VALID [2022-04-28 15:37:03,214 INFO L290 TraceCheckUtils]: 10: Hoare triple {57494#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {57494#true} is VALID [2022-04-28 15:37:03,214 INFO L290 TraceCheckUtils]: 11: Hoare triple {57494#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {57494#true} is VALID [2022-04-28 15:37:03,214 INFO L290 TraceCheckUtils]: 12: Hoare triple {57494#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {57494#true} is VALID [2022-04-28 15:37:03,214 INFO L290 TraceCheckUtils]: 13: Hoare triple {57494#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {57494#true} is VALID [2022-04-28 15:37:03,214 INFO L290 TraceCheckUtils]: 14: Hoare triple {57494#true} assume !false; {57494#true} is VALID [2022-04-28 15:37:03,214 INFO L290 TraceCheckUtils]: 15: Hoare triple {57494#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {57494#true} is VALID [2022-04-28 15:37:03,214 INFO L290 TraceCheckUtils]: 16: Hoare triple {57494#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {57494#true} is VALID [2022-04-28 15:37:03,214 INFO L290 TraceCheckUtils]: 17: Hoare triple {57494#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {57494#true} is VALID [2022-04-28 15:37:03,214 INFO L290 TraceCheckUtils]: 18: Hoare triple {57494#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {57494#true} is VALID [2022-04-28 15:37:03,215 INFO L290 TraceCheckUtils]: 19: Hoare triple {57494#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {57494#true} is VALID [2022-04-28 15:37:03,215 INFO L290 TraceCheckUtils]: 20: Hoare triple {57494#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {57494#true} is VALID [2022-04-28 15:37:03,215 INFO L290 TraceCheckUtils]: 21: Hoare triple {57494#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {57494#true} is VALID [2022-04-28 15:37:03,215 INFO L290 TraceCheckUtils]: 22: Hoare triple {57494#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {57494#true} is VALID [2022-04-28 15:37:03,215 INFO L290 TraceCheckUtils]: 23: Hoare triple {57494#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {57494#true} is VALID [2022-04-28 15:37:03,215 INFO L290 TraceCheckUtils]: 24: Hoare triple {57494#true} assume 8464 == #t~mem55;havoc #t~mem55; {57494#true} is VALID [2022-04-28 15:37:03,215 INFO L290 TraceCheckUtils]: 25: Hoare triple {57494#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {57494#true} is VALID [2022-04-28 15:37:03,215 INFO L290 TraceCheckUtils]: 26: Hoare triple {57494#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {57494#true} is VALID [2022-04-28 15:37:03,215 INFO L290 TraceCheckUtils]: 27: Hoare triple {57494#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {57494#true} is VALID [2022-04-28 15:37:03,215 INFO L290 TraceCheckUtils]: 28: Hoare triple {57494#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {57494#true} is VALID [2022-04-28 15:37:03,215 INFO L290 TraceCheckUtils]: 29: Hoare triple {57494#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {57494#true} is VALID [2022-04-28 15:37:03,215 INFO L290 TraceCheckUtils]: 30: Hoare triple {57494#true} ~skip~0 := 0; {57494#true} is VALID [2022-04-28 15:37:03,215 INFO L290 TraceCheckUtils]: 31: Hoare triple {57494#true} assume !false; {57494#true} is VALID [2022-04-28 15:37:03,215 INFO L290 TraceCheckUtils]: 32: Hoare triple {57494#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {57494#true} is VALID [2022-04-28 15:37:03,216 INFO L290 TraceCheckUtils]: 33: Hoare triple {57494#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {57494#true} is VALID [2022-04-28 15:37:03,216 INFO L290 TraceCheckUtils]: 34: Hoare triple {57494#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {57494#true} is VALID [2022-04-28 15:37:03,216 INFO L290 TraceCheckUtils]: 35: Hoare triple {57494#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {57494#true} is VALID [2022-04-28 15:37:03,216 INFO L290 TraceCheckUtils]: 36: Hoare triple {57494#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {57494#true} is VALID [2022-04-28 15:37:03,216 INFO L290 TraceCheckUtils]: 37: Hoare triple {57494#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {57494#true} is VALID [2022-04-28 15:37:03,216 INFO L290 TraceCheckUtils]: 38: Hoare triple {57494#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {57494#true} is VALID [2022-04-28 15:37:03,216 INFO L290 TraceCheckUtils]: 39: Hoare triple {57494#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {57494#true} is VALID [2022-04-28 15:37:03,216 INFO L290 TraceCheckUtils]: 40: Hoare triple {57494#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {57494#true} is VALID [2022-04-28 15:37:03,216 INFO L290 TraceCheckUtils]: 41: Hoare triple {57494#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {57494#true} is VALID [2022-04-28 15:37:03,216 INFO L290 TraceCheckUtils]: 42: Hoare triple {57494#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {57494#true} is VALID [2022-04-28 15:37:03,216 INFO L290 TraceCheckUtils]: 43: Hoare triple {57494#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {57494#true} is VALID [2022-04-28 15:37:03,216 INFO L290 TraceCheckUtils]: 44: Hoare triple {57494#true} assume 8496 == #t~mem58;havoc #t~mem58; {57494#true} is VALID [2022-04-28 15:37:03,216 INFO L290 TraceCheckUtils]: 45: Hoare triple {57494#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {57494#true} is VALID [2022-04-28 15:37:03,217 INFO L290 TraceCheckUtils]: 46: Hoare triple {57494#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {57494#true} is VALID [2022-04-28 15:37:03,217 INFO L290 TraceCheckUtils]: 47: Hoare triple {57494#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {57494#true} is VALID [2022-04-28 15:37:03,217 INFO L290 TraceCheckUtils]: 48: Hoare triple {57494#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {57499#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:03,218 INFO L290 TraceCheckUtils]: 49: Hoare triple {57499#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {57499#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:03,218 INFO L290 TraceCheckUtils]: 50: Hoare triple {57499#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {57499#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:03,219 INFO L290 TraceCheckUtils]: 51: Hoare triple {57499#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {57499#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:03,219 INFO L290 TraceCheckUtils]: 52: Hoare triple {57499#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {57499#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:03,219 INFO L290 TraceCheckUtils]: 53: Hoare triple {57499#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {57499#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:03,220 INFO L290 TraceCheckUtils]: 54: Hoare triple {57499#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {57499#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:03,220 INFO L290 TraceCheckUtils]: 55: Hoare triple {57499#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {57499#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:03,220 INFO L290 TraceCheckUtils]: 56: Hoare triple {57499#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {57499#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:03,221 INFO L290 TraceCheckUtils]: 57: Hoare triple {57499#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {57499#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:03,221 INFO L290 TraceCheckUtils]: 58: Hoare triple {57499#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {57499#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:03,221 INFO L290 TraceCheckUtils]: 59: Hoare triple {57499#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {57499#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:03,222 INFO L290 TraceCheckUtils]: 60: Hoare triple {57499#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {57499#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:03,222 INFO L290 TraceCheckUtils]: 61: Hoare triple {57499#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {57499#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:03,222 INFO L290 TraceCheckUtils]: 62: Hoare triple {57499#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {57499#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:03,223 INFO L290 TraceCheckUtils]: 63: Hoare triple {57499#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {57499#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:03,223 INFO L290 TraceCheckUtils]: 64: Hoare triple {57499#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {57499#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:03,224 INFO L290 TraceCheckUtils]: 65: Hoare triple {57499#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {57499#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:03,224 INFO L290 TraceCheckUtils]: 66: Hoare triple {57499#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {57499#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:03,224 INFO L290 TraceCheckUtils]: 67: Hoare triple {57499#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {57499#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:03,225 INFO L290 TraceCheckUtils]: 68: Hoare triple {57499#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {57499#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:03,225 INFO L290 TraceCheckUtils]: 69: Hoare triple {57499#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {57499#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:03,225 INFO L290 TraceCheckUtils]: 70: Hoare triple {57499#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {57499#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:03,226 INFO L290 TraceCheckUtils]: 71: Hoare triple {57499#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {57499#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:03,226 INFO L290 TraceCheckUtils]: 72: Hoare triple {57499#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {57499#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:03,226 INFO L290 TraceCheckUtils]: 73: Hoare triple {57499#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {57499#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:03,227 INFO L290 TraceCheckUtils]: 74: Hoare triple {57499#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {57500#(= |ssl3_accept_#t~mem67| 8656)} is VALID [2022-04-28 15:37:03,227 INFO L290 TraceCheckUtils]: 75: Hoare triple {57500#(= |ssl3_accept_#t~mem67| 8656)} assume 8561 == #t~mem67;havoc #t~mem67; {57495#false} is VALID [2022-04-28 15:37:03,227 INFO L290 TraceCheckUtils]: 76: Hoare triple {57495#false} assume -2147483648 <= #t~nondet130 && #t~nondet130 <= 2147483647;~ret~0 := #t~nondet130;havoc #t~nondet130; {57495#false} is VALID [2022-04-28 15:37:03,227 INFO L290 TraceCheckUtils]: 77: Hoare triple {57495#false} assume !(~ret~0 <= 0);call #t~mem131.base, #t~mem131.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8576, #t~mem131.base, 904 + #t~mem131.offset, 4);havoc #t~mem131.base, #t~mem131.offset;call write~int(8448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {57495#false} is VALID [2022-04-28 15:37:03,227 INFO L290 TraceCheckUtils]: 78: Hoare triple {57495#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {57495#false} is VALID [2022-04-28 15:37:03,227 INFO L290 TraceCheckUtils]: 79: Hoare triple {57495#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {57495#false} is VALID [2022-04-28 15:37:03,227 INFO L290 TraceCheckUtils]: 80: Hoare triple {57495#false} ~skip~0 := 0; {57495#false} is VALID [2022-04-28 15:37:03,227 INFO L290 TraceCheckUtils]: 81: Hoare triple {57495#false} assume !false; {57495#false} is VALID [2022-04-28 15:37:03,227 INFO L290 TraceCheckUtils]: 82: Hoare triple {57495#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {57495#false} is VALID [2022-04-28 15:37:03,227 INFO L290 TraceCheckUtils]: 83: Hoare triple {57495#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {57495#false} is VALID [2022-04-28 15:37:03,228 INFO L290 TraceCheckUtils]: 84: Hoare triple {57495#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {57495#false} is VALID [2022-04-28 15:37:03,228 INFO L290 TraceCheckUtils]: 85: Hoare triple {57495#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {57495#false} is VALID [2022-04-28 15:37:03,228 INFO L290 TraceCheckUtils]: 86: Hoare triple {57495#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {57495#false} is VALID [2022-04-28 15:37:03,228 INFO L290 TraceCheckUtils]: 87: Hoare triple {57495#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {57495#false} is VALID [2022-04-28 15:37:03,228 INFO L290 TraceCheckUtils]: 88: Hoare triple {57495#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {57495#false} is VALID [2022-04-28 15:37:03,228 INFO L290 TraceCheckUtils]: 89: Hoare triple {57495#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {57495#false} is VALID [2022-04-28 15:37:03,228 INFO L290 TraceCheckUtils]: 90: Hoare triple {57495#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {57495#false} is VALID [2022-04-28 15:37:03,228 INFO L290 TraceCheckUtils]: 91: Hoare triple {57495#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {57495#false} is VALID [2022-04-28 15:37:03,228 INFO L290 TraceCheckUtils]: 92: Hoare triple {57495#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {57495#false} is VALID [2022-04-28 15:37:03,228 INFO L290 TraceCheckUtils]: 93: Hoare triple {57495#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {57495#false} is VALID [2022-04-28 15:37:03,228 INFO L290 TraceCheckUtils]: 94: Hoare triple {57495#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {57495#false} is VALID [2022-04-28 15:37:03,228 INFO L290 TraceCheckUtils]: 95: Hoare triple {57495#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {57495#false} is VALID [2022-04-28 15:37:03,228 INFO L290 TraceCheckUtils]: 96: Hoare triple {57495#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {57495#false} is VALID [2022-04-28 15:37:03,228 INFO L290 TraceCheckUtils]: 97: Hoare triple {57495#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {57495#false} is VALID [2022-04-28 15:37:03,229 INFO L290 TraceCheckUtils]: 98: Hoare triple {57495#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {57495#false} is VALID [2022-04-28 15:37:03,229 INFO L290 TraceCheckUtils]: 99: Hoare triple {57495#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {57495#false} is VALID [2022-04-28 15:37:03,229 INFO L290 TraceCheckUtils]: 100: Hoare triple {57495#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {57495#false} is VALID [2022-04-28 15:37:03,229 INFO L290 TraceCheckUtils]: 101: Hoare triple {57495#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {57495#false} is VALID [2022-04-28 15:37:03,229 INFO L290 TraceCheckUtils]: 102: Hoare triple {57495#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {57495#false} is VALID [2022-04-28 15:37:03,229 INFO L290 TraceCheckUtils]: 103: Hoare triple {57495#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {57495#false} is VALID [2022-04-28 15:37:03,229 INFO L290 TraceCheckUtils]: 104: Hoare triple {57495#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {57495#false} is VALID [2022-04-28 15:37:03,229 INFO L290 TraceCheckUtils]: 105: Hoare triple {57495#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {57495#false} is VALID [2022-04-28 15:37:03,229 INFO L290 TraceCheckUtils]: 106: Hoare triple {57495#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {57495#false} is VALID [2022-04-28 15:37:03,229 INFO L290 TraceCheckUtils]: 107: Hoare triple {57495#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {57495#false} is VALID [2022-04-28 15:37:03,229 INFO L290 TraceCheckUtils]: 108: Hoare triple {57495#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {57495#false} is VALID [2022-04-28 15:37:03,229 INFO L290 TraceCheckUtils]: 109: Hoare triple {57495#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {57495#false} is VALID [2022-04-28 15:37:03,229 INFO L290 TraceCheckUtils]: 110: Hoare triple {57495#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {57495#false} is VALID [2022-04-28 15:37:03,229 INFO L290 TraceCheckUtils]: 111: Hoare triple {57495#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {57495#false} is VALID [2022-04-28 15:37:03,229 INFO L290 TraceCheckUtils]: 112: Hoare triple {57495#false} assume 8641 == #t~mem76;havoc #t~mem76; {57495#false} is VALID [2022-04-28 15:37:03,230 INFO L290 TraceCheckUtils]: 113: Hoare triple {57495#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {57495#false} is VALID [2022-04-28 15:37:03,230 INFO L290 TraceCheckUtils]: 114: Hoare triple {57495#false} assume !(4 == ~blastFlag~0); {57495#false} is VALID [2022-04-28 15:37:03,230 INFO L290 TraceCheckUtils]: 115: Hoare triple {57495#false} assume !(7 == ~blastFlag~0); {57495#false} is VALID [2022-04-28 15:37:03,230 INFO L290 TraceCheckUtils]: 116: Hoare triple {57495#false} assume !(10 == ~blastFlag~0); {57495#false} is VALID [2022-04-28 15:37:03,230 INFO L290 TraceCheckUtils]: 117: Hoare triple {57495#false} assume !false; {57495#false} is VALID [2022-04-28 15:37:03,230 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 15:37:03,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:37:03,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455512920] [2022-04-28 15:37:03,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455512920] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:37:03,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:37:03,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:37:03,231 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:37:03,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [707727840] [2022-04-28 15:37:03,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [707727840] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:37:03,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:37:03,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:37:03,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356148822] [2022-04-28 15:37:03,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:37:03,231 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 118 [2022-04-28 15:37:03,232 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:37:03,232 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:37:03,303 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:37:03,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:37:03,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:37:03,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:37:03,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:37:03,304 INFO L87 Difference]: Start difference. First operand 414 states and 610 transitions. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:37:05,626 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:37:09,423 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:37:11,461 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:37:14,232 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-28 15:37:15,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:37:15,348 INFO L93 Difference]: Finished difference Result 837 states and 1239 transitions. [2022-04-28 15:37:15,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:37:15,348 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 118 [2022-04-28 15:37:15,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:37:15,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:37:15,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 535 transitions. [2022-04-28 15:37:15,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:37:15,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 535 transitions. [2022-04-28 15:37:15,352 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 535 transitions. [2022-04-28 15:37:15,678 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 535 edges. 535 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:37:15,687 INFO L225 Difference]: With dead ends: 837 [2022-04-28 15:37:15,687 INFO L226 Difference]: Without dead ends: 449 [2022-04-28 15:37:15,687 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-28 15:37:15,688 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 67 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-04-28 15:37:15,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 531 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2022-04-28 15:37:15,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2022-04-28 15:37:15,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 414. [2022-04-28 15:37:15,704 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:37:15,704 INFO L82 GeneralOperation]: Start isEquivalent. First operand 449 states. Second operand has 414 states, 409 states have (on average 1.4792176039119804) internal successors, (605), 409 states have internal predecessors, (605), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:37:15,704 INFO L74 IsIncluded]: Start isIncluded. First operand 449 states. Second operand has 414 states, 409 states have (on average 1.4792176039119804) internal successors, (605), 409 states have internal predecessors, (605), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:37:15,705 INFO L87 Difference]: Start difference. First operand 449 states. Second operand has 414 states, 409 states have (on average 1.4792176039119804) internal successors, (605), 409 states have internal predecessors, (605), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:37:15,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:37:15,711 INFO L93 Difference]: Finished difference Result 449 states and 658 transitions. [2022-04-28 15:37:15,711 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 658 transitions. [2022-04-28 15:37:15,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:37:15,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:37:15,712 INFO L74 IsIncluded]: Start isIncluded. First operand has 414 states, 409 states have (on average 1.4792176039119804) internal successors, (605), 409 states have internal predecessors, (605), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 449 states. [2022-04-28 15:37:15,712 INFO L87 Difference]: Start difference. First operand has 414 states, 409 states have (on average 1.4792176039119804) internal successors, (605), 409 states have internal predecessors, (605), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 449 states. [2022-04-28 15:37:15,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:37:15,719 INFO L93 Difference]: Finished difference Result 449 states and 658 transitions. [2022-04-28 15:37:15,719 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 658 transitions. [2022-04-28 15:37:15,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:37:15,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:37:15,719 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:37:15,719 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:37:15,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 409 states have (on average 1.4792176039119804) internal successors, (605), 409 states have internal predecessors, (605), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:37:15,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 609 transitions. [2022-04-28 15:37:15,727 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 609 transitions. Word has length 118 [2022-04-28 15:37:15,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:37:15,727 INFO L495 AbstractCegarLoop]: Abstraction has 414 states and 609 transitions. [2022-04-28 15:37:15,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:37:15,728 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 414 states and 609 transitions. [2022-04-28 15:37:16,215 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 609 edges. 609 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:37:16,215 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 609 transitions. [2022-04-28 15:37:16,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-04-28 15:37:16,216 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:37:16,216 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:37:16,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-28 15:37:16,216 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:37:16,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:37:16,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1885087564, now seen corresponding path program 1 times [2022-04-28 15:37:16,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:37:16,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1391350624] [2022-04-28 15:37:16,270 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:37:16,271 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:37:16,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1885087564, now seen corresponding path program 2 times [2022-04-28 15:37:16,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:37:16,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038430386] [2022-04-28 15:37:16,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:37:16,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:37:16,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:37:16,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:37:16,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:37:16,380 INFO L290 TraceCheckUtils]: 0: Hoare triple {60913#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {60906#true} is VALID [2022-04-28 15:37:16,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {60906#true} assume true; {60906#true} is VALID [2022-04-28 15:37:16,380 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {60906#true} {60906#true} #703#return; {60906#true} is VALID [2022-04-28 15:37:16,381 INFO L272 TraceCheckUtils]: 0: Hoare triple {60906#true} call ULTIMATE.init(); {60913#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-28 15:37:16,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {60913#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {60906#true} is VALID [2022-04-28 15:37:16,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {60906#true} assume true; {60906#true} is VALID [2022-04-28 15:37:16,381 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60906#true} {60906#true} #703#return; {60906#true} is VALID [2022-04-28 15:37:16,381 INFO L272 TraceCheckUtils]: 4: Hoare triple {60906#true} call #t~ret161 := main(); {60906#true} is VALID [2022-04-28 15:37:16,381 INFO L290 TraceCheckUtils]: 5: Hoare triple {60906#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {60906#true} is VALID [2022-04-28 15:37:16,381 INFO L290 TraceCheckUtils]: 6: Hoare triple {60906#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {60906#true} is VALID [2022-04-28 15:37:16,381 INFO L272 TraceCheckUtils]: 7: Hoare triple {60906#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {60906#true} is VALID [2022-04-28 15:37:16,381 INFO L290 TraceCheckUtils]: 8: Hoare triple {60906#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {60906#true} is VALID [2022-04-28 15:37:16,381 INFO L290 TraceCheckUtils]: 9: Hoare triple {60906#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {60906#true} is VALID [2022-04-28 15:37:16,381 INFO L290 TraceCheckUtils]: 10: Hoare triple {60906#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {60906#true} is VALID [2022-04-28 15:37:16,381 INFO L290 TraceCheckUtils]: 11: Hoare triple {60906#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {60906#true} is VALID [2022-04-28 15:37:16,381 INFO L290 TraceCheckUtils]: 12: Hoare triple {60906#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {60906#true} is VALID [2022-04-28 15:37:16,382 INFO L290 TraceCheckUtils]: 13: Hoare triple {60906#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {60906#true} is VALID [2022-04-28 15:37:16,382 INFO L290 TraceCheckUtils]: 14: Hoare triple {60906#true} assume !false; {60906#true} is VALID [2022-04-28 15:37:16,382 INFO L290 TraceCheckUtils]: 15: Hoare triple {60906#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {60906#true} is VALID [2022-04-28 15:37:16,382 INFO L290 TraceCheckUtils]: 16: Hoare triple {60906#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {60906#true} is VALID [2022-04-28 15:37:16,382 INFO L290 TraceCheckUtils]: 17: Hoare triple {60906#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {60906#true} is VALID [2022-04-28 15:37:16,382 INFO L290 TraceCheckUtils]: 18: Hoare triple {60906#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {60906#true} is VALID [2022-04-28 15:37:16,382 INFO L290 TraceCheckUtils]: 19: Hoare triple {60906#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {60906#true} is VALID [2022-04-28 15:37:16,382 INFO L290 TraceCheckUtils]: 20: Hoare triple {60906#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {60906#true} is VALID [2022-04-28 15:37:16,382 INFO L290 TraceCheckUtils]: 21: Hoare triple {60906#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {60906#true} is VALID [2022-04-28 15:37:16,382 INFO L290 TraceCheckUtils]: 22: Hoare triple {60906#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {60906#true} is VALID [2022-04-28 15:37:16,382 INFO L290 TraceCheckUtils]: 23: Hoare triple {60906#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {60906#true} is VALID [2022-04-28 15:37:16,382 INFO L290 TraceCheckUtils]: 24: Hoare triple {60906#true} assume 8464 == #t~mem55;havoc #t~mem55; {60906#true} is VALID [2022-04-28 15:37:16,382 INFO L290 TraceCheckUtils]: 25: Hoare triple {60906#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {60906#true} is VALID [2022-04-28 15:37:16,382 INFO L290 TraceCheckUtils]: 26: Hoare triple {60906#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {60906#true} is VALID [2022-04-28 15:37:16,382 INFO L290 TraceCheckUtils]: 27: Hoare triple {60906#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {60906#true} is VALID [2022-04-28 15:37:16,383 INFO L290 TraceCheckUtils]: 28: Hoare triple {60906#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {60906#true} is VALID [2022-04-28 15:37:16,383 INFO L290 TraceCheckUtils]: 29: Hoare triple {60906#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {60906#true} is VALID [2022-04-28 15:37:16,383 INFO L290 TraceCheckUtils]: 30: Hoare triple {60906#true} ~skip~0 := 0; {60906#true} is VALID [2022-04-28 15:37:16,383 INFO L290 TraceCheckUtils]: 31: Hoare triple {60906#true} assume !false; {60906#true} is VALID [2022-04-28 15:37:16,383 INFO L290 TraceCheckUtils]: 32: Hoare triple {60906#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {60906#true} is VALID [2022-04-28 15:37:16,383 INFO L290 TraceCheckUtils]: 33: Hoare triple {60906#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {60906#true} is VALID [2022-04-28 15:37:16,383 INFO L290 TraceCheckUtils]: 34: Hoare triple {60906#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {60906#true} is VALID [2022-04-28 15:37:16,383 INFO L290 TraceCheckUtils]: 35: Hoare triple {60906#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {60906#true} is VALID [2022-04-28 15:37:16,383 INFO L290 TraceCheckUtils]: 36: Hoare triple {60906#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {60906#true} is VALID [2022-04-28 15:37:16,383 INFO L290 TraceCheckUtils]: 37: Hoare triple {60906#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {60906#true} is VALID [2022-04-28 15:37:16,383 INFO L290 TraceCheckUtils]: 38: Hoare triple {60906#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {60906#true} is VALID [2022-04-28 15:37:16,383 INFO L290 TraceCheckUtils]: 39: Hoare triple {60906#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {60906#true} is VALID [2022-04-28 15:37:16,383 INFO L290 TraceCheckUtils]: 40: Hoare triple {60906#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {60906#true} is VALID [2022-04-28 15:37:16,383 INFO L290 TraceCheckUtils]: 41: Hoare triple {60906#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {60906#true} is VALID [2022-04-28 15:37:16,384 INFO L290 TraceCheckUtils]: 42: Hoare triple {60906#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {60906#true} is VALID [2022-04-28 15:37:16,384 INFO L290 TraceCheckUtils]: 43: Hoare triple {60906#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {60906#true} is VALID [2022-04-28 15:37:16,384 INFO L290 TraceCheckUtils]: 44: Hoare triple {60906#true} assume 8496 == #t~mem58;havoc #t~mem58; {60906#true} is VALID [2022-04-28 15:37:16,384 INFO L290 TraceCheckUtils]: 45: Hoare triple {60906#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {60906#true} is VALID [2022-04-28 15:37:16,384 INFO L290 TraceCheckUtils]: 46: Hoare triple {60906#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {60906#true} is VALID [2022-04-28 15:37:16,384 INFO L290 TraceCheckUtils]: 47: Hoare triple {60906#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {60906#true} is VALID [2022-04-28 15:37:16,384 INFO L290 TraceCheckUtils]: 48: Hoare triple {60906#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {60911#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:37:16,385 INFO L290 TraceCheckUtils]: 49: Hoare triple {60911#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {60911#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:37:16,385 INFO L290 TraceCheckUtils]: 50: Hoare triple {60911#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {60911#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:37:16,386 INFO L290 TraceCheckUtils]: 51: Hoare triple {60911#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {60911#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:37:16,386 INFO L290 TraceCheckUtils]: 52: Hoare triple {60911#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} ~skip~0 := 0; {60911#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:37:16,386 INFO L290 TraceCheckUtils]: 53: Hoare triple {60911#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {60911#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:37:16,387 INFO L290 TraceCheckUtils]: 54: Hoare triple {60911#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {60911#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:37:16,387 INFO L290 TraceCheckUtils]: 55: Hoare triple {60911#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {60911#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:37:16,387 INFO L290 TraceCheckUtils]: 56: Hoare triple {60911#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {60911#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:37:16,388 INFO L290 TraceCheckUtils]: 57: Hoare triple {60911#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {60911#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:37:16,388 INFO L290 TraceCheckUtils]: 58: Hoare triple {60911#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {60911#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:37:16,388 INFO L290 TraceCheckUtils]: 59: Hoare triple {60911#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {60911#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:37:16,389 INFO L290 TraceCheckUtils]: 60: Hoare triple {60911#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {60911#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:37:16,389 INFO L290 TraceCheckUtils]: 61: Hoare triple {60911#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {60911#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:37:16,389 INFO L290 TraceCheckUtils]: 62: Hoare triple {60911#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {60911#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:37:16,390 INFO L290 TraceCheckUtils]: 63: Hoare triple {60911#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {60911#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:37:16,390 INFO L290 TraceCheckUtils]: 64: Hoare triple {60911#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {60911#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:37:16,390 INFO L290 TraceCheckUtils]: 65: Hoare triple {60911#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {60911#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:37:16,391 INFO L290 TraceCheckUtils]: 66: Hoare triple {60911#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {60911#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:37:16,391 INFO L290 TraceCheckUtils]: 67: Hoare triple {60911#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {60911#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:37:16,391 INFO L290 TraceCheckUtils]: 68: Hoare triple {60911#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {60911#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:37:16,392 INFO L290 TraceCheckUtils]: 69: Hoare triple {60911#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {60911#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:37:16,392 INFO L290 TraceCheckUtils]: 70: Hoare triple {60911#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {60911#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:37:16,392 INFO L290 TraceCheckUtils]: 71: Hoare triple {60911#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {60911#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:37:16,393 INFO L290 TraceCheckUtils]: 72: Hoare triple {60911#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {60911#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:37:16,393 INFO L290 TraceCheckUtils]: 73: Hoare triple {60911#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {60911#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:37:16,393 INFO L290 TraceCheckUtils]: 74: Hoare triple {60911#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {60911#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:37:16,394 INFO L290 TraceCheckUtils]: 75: Hoare triple {60911#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {60912#(not (= 8448 |ssl3_accept_#t~mem68|))} is VALID [2022-04-28 15:37:16,394 INFO L290 TraceCheckUtils]: 76: Hoare triple {60912#(not (= 8448 |ssl3_accept_#t~mem68|))} assume 8448 == #t~mem68;havoc #t~mem68; {60907#false} is VALID [2022-04-28 15:37:16,394 INFO L290 TraceCheckUtils]: 77: Hoare triple {60907#false} assume !(~num1~0 > 0); {60907#false} is VALID [2022-04-28 15:37:16,394 INFO L290 TraceCheckUtils]: 78: Hoare triple {60907#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem133 := read~int(#t~mem132.base, 904 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 72 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {60907#false} is VALID [2022-04-28 15:37:16,394 INFO L290 TraceCheckUtils]: 79: Hoare triple {60907#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {60907#false} is VALID [2022-04-28 15:37:16,394 INFO L290 TraceCheckUtils]: 80: Hoare triple {60907#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {60907#false} is VALID [2022-04-28 15:37:16,394 INFO L290 TraceCheckUtils]: 81: Hoare triple {60907#false} ~skip~0 := 0; {60907#false} is VALID [2022-04-28 15:37:16,394 INFO L290 TraceCheckUtils]: 82: Hoare triple {60907#false} assume !false; {60907#false} is VALID [2022-04-28 15:37:16,395 INFO L290 TraceCheckUtils]: 83: Hoare triple {60907#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {60907#false} is VALID [2022-04-28 15:37:16,395 INFO L290 TraceCheckUtils]: 84: Hoare triple {60907#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {60907#false} is VALID [2022-04-28 15:37:16,395 INFO L290 TraceCheckUtils]: 85: Hoare triple {60907#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {60907#false} is VALID [2022-04-28 15:37:16,395 INFO L290 TraceCheckUtils]: 86: Hoare triple {60907#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {60907#false} is VALID [2022-04-28 15:37:16,395 INFO L290 TraceCheckUtils]: 87: Hoare triple {60907#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {60907#false} is VALID [2022-04-28 15:37:16,395 INFO L290 TraceCheckUtils]: 88: Hoare triple {60907#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {60907#false} is VALID [2022-04-28 15:37:16,395 INFO L290 TraceCheckUtils]: 89: Hoare triple {60907#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {60907#false} is VALID [2022-04-28 15:37:16,395 INFO L290 TraceCheckUtils]: 90: Hoare triple {60907#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {60907#false} is VALID [2022-04-28 15:37:16,395 INFO L290 TraceCheckUtils]: 91: Hoare triple {60907#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {60907#false} is VALID [2022-04-28 15:37:16,395 INFO L290 TraceCheckUtils]: 92: Hoare triple {60907#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {60907#false} is VALID [2022-04-28 15:37:16,395 INFO L290 TraceCheckUtils]: 93: Hoare triple {60907#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {60907#false} is VALID [2022-04-28 15:37:16,395 INFO L290 TraceCheckUtils]: 94: Hoare triple {60907#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {60907#false} is VALID [2022-04-28 15:37:16,395 INFO L290 TraceCheckUtils]: 95: Hoare triple {60907#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {60907#false} is VALID [2022-04-28 15:37:16,395 INFO L290 TraceCheckUtils]: 96: Hoare triple {60907#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {60907#false} is VALID [2022-04-28 15:37:16,395 INFO L290 TraceCheckUtils]: 97: Hoare triple {60907#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {60907#false} is VALID [2022-04-28 15:37:16,396 INFO L290 TraceCheckUtils]: 98: Hoare triple {60907#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {60907#false} is VALID [2022-04-28 15:37:16,396 INFO L290 TraceCheckUtils]: 99: Hoare triple {60907#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {60907#false} is VALID [2022-04-28 15:37:16,396 INFO L290 TraceCheckUtils]: 100: Hoare triple {60907#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {60907#false} is VALID [2022-04-28 15:37:16,396 INFO L290 TraceCheckUtils]: 101: Hoare triple {60907#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {60907#false} is VALID [2022-04-28 15:37:16,396 INFO L290 TraceCheckUtils]: 102: Hoare triple {60907#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {60907#false} is VALID [2022-04-28 15:37:16,396 INFO L290 TraceCheckUtils]: 103: Hoare triple {60907#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {60907#false} is VALID [2022-04-28 15:37:16,396 INFO L290 TraceCheckUtils]: 104: Hoare triple {60907#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {60907#false} is VALID [2022-04-28 15:37:16,396 INFO L290 TraceCheckUtils]: 105: Hoare triple {60907#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {60907#false} is VALID [2022-04-28 15:37:16,396 INFO L290 TraceCheckUtils]: 106: Hoare triple {60907#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {60907#false} is VALID [2022-04-28 15:37:16,396 INFO L290 TraceCheckUtils]: 107: Hoare triple {60907#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {60907#false} is VALID [2022-04-28 15:37:16,396 INFO L290 TraceCheckUtils]: 108: Hoare triple {60907#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {60907#false} is VALID [2022-04-28 15:37:16,396 INFO L290 TraceCheckUtils]: 109: Hoare triple {60907#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {60907#false} is VALID [2022-04-28 15:37:16,396 INFO L290 TraceCheckUtils]: 110: Hoare triple {60907#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {60907#false} is VALID [2022-04-28 15:37:16,396 INFO L290 TraceCheckUtils]: 111: Hoare triple {60907#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {60907#false} is VALID [2022-04-28 15:37:16,397 INFO L290 TraceCheckUtils]: 112: Hoare triple {60907#false} assume 8640 == #t~mem75;havoc #t~mem75; {60907#false} is VALID [2022-04-28 15:37:16,397 INFO L290 TraceCheckUtils]: 113: Hoare triple {60907#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {60907#false} is VALID [2022-04-28 15:37:16,397 INFO L290 TraceCheckUtils]: 114: Hoare triple {60907#false} assume !(4 == ~blastFlag~0); {60907#false} is VALID [2022-04-28 15:37:16,397 INFO L290 TraceCheckUtils]: 115: Hoare triple {60907#false} assume !(7 == ~blastFlag~0); {60907#false} is VALID [2022-04-28 15:37:16,397 INFO L290 TraceCheckUtils]: 116: Hoare triple {60907#false} assume !(10 == ~blastFlag~0); {60907#false} is VALID [2022-04-28 15:37:16,397 INFO L290 TraceCheckUtils]: 117: Hoare triple {60907#false} assume !false; {60907#false} is VALID [2022-04-28 15:37:16,397 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 15:37:16,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:37:16,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038430386] [2022-04-28 15:37:16,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038430386] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:37:16,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:37:16,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:37:16,398 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:37:16,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1391350624] [2022-04-28 15:37:16,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1391350624] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:37:16,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:37:16,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:37:16,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521849287] [2022-04-28 15:37:16,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:37:16,398 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 118 [2022-04-28 15:37:16,398 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:37:16,399 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:37:16,470 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:37:16,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:37:16,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:37:16,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:37:16,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:37:16,470 INFO L87 Difference]: Start difference. First operand 414 states and 609 transitions. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:37:19,888 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:37:21,910 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:37:23,935 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:37:25,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:37:25,113 INFO L93 Difference]: Finished difference Result 945 states and 1405 transitions. [2022-04-28 15:37:25,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:37:25,114 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 118 [2022-04-28 15:37:25,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:37:25,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:37:25,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 583 transitions. [2022-04-28 15:37:25,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:37:25,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 583 transitions. [2022-04-28 15:37:25,118 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 583 transitions. [2022-04-28 15:37:25,452 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-28 15:37:25,465 INFO L225 Difference]: With dead ends: 945 [2022-04-28 15:37:25,465 INFO L226 Difference]: Without dead ends: 557 [2022-04-28 15:37:25,465 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-28 15:37:25,466 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 117 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 42 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:37:25,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 396 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 461 Invalid, 3 Unknown, 0 Unchecked, 7.3s Time] [2022-04-28 15:37:25,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2022-04-28 15:37:25,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 478. [2022-04-28 15:37:25,485 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:37:25,486 INFO L82 GeneralOperation]: Start isEquivalent. First operand 557 states. Second operand has 478 states, 473 states have (on average 1.4756871035940804) internal successors, (698), 473 states have internal predecessors, (698), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:37:25,487 INFO L74 IsIncluded]: Start isIncluded. First operand 557 states. Second operand has 478 states, 473 states have (on average 1.4756871035940804) internal successors, (698), 473 states have internal predecessors, (698), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:37:25,487 INFO L87 Difference]: Start difference. First operand 557 states. Second operand has 478 states, 473 states have (on average 1.4756871035940804) internal successors, (698), 473 states have internal predecessors, (698), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:37:25,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:37:25,496 INFO L93 Difference]: Finished difference Result 557 states and 823 transitions. [2022-04-28 15:37:25,497 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 823 transitions. [2022-04-28 15:37:25,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:37:25,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:37:25,498 INFO L74 IsIncluded]: Start isIncluded. First operand has 478 states, 473 states have (on average 1.4756871035940804) internal successors, (698), 473 states have internal predecessors, (698), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 557 states. [2022-04-28 15:37:25,498 INFO L87 Difference]: Start difference. First operand has 478 states, 473 states have (on average 1.4756871035940804) internal successors, (698), 473 states have internal predecessors, (698), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 557 states. [2022-04-28 15:37:25,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:37:25,508 INFO L93 Difference]: Finished difference Result 557 states and 823 transitions. [2022-04-28 15:37:25,508 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 823 transitions. [2022-04-28 15:37:25,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:37:25,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:37:25,509 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:37:25,509 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:37:25,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 473 states have (on average 1.4756871035940804) internal successors, (698), 473 states have internal predecessors, (698), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:37:25,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 702 transitions. [2022-04-28 15:37:25,519 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 702 transitions. Word has length 118 [2022-04-28 15:37:25,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:37:25,519 INFO L495 AbstractCegarLoop]: Abstraction has 478 states and 702 transitions. [2022-04-28 15:37:25,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:37:25,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 478 states and 702 transitions. [2022-04-28 15:37:26,059 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 702 edges. 702 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:37:26,059 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 702 transitions. [2022-04-28 15:37:26,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-04-28 15:37:26,061 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:37:26,062 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:37:26,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-28 15:37:26,062 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:37:26,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:37:26,062 INFO L85 PathProgramCache]: Analyzing trace with hash -2024116243, now seen corresponding path program 1 times [2022-04-28 15:37:26,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:37:26,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1226082450] [2022-04-28 15:37:26,130 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:37:26,130 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:37:26,130 INFO L85 PathProgramCache]: Analyzing trace with hash -2024116243, now seen corresponding path program 2 times [2022-04-28 15:37:26,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:37:26,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677643074] [2022-04-28 15:37:26,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:37:26,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:37:26,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:37:26,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:37:26,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:37:26,254 INFO L290 TraceCheckUtils]: 0: Hoare triple {64885#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {64878#true} is VALID [2022-04-28 15:37:26,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {64878#true} assume true; {64878#true} is VALID [2022-04-28 15:37:26,254 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {64878#true} {64878#true} #703#return; {64878#true} is VALID [2022-04-28 15:37:26,254 INFO L272 TraceCheckUtils]: 0: Hoare triple {64878#true} call ULTIMATE.init(); {64885#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-28 15:37:26,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {64885#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {64878#true} is VALID [2022-04-28 15:37:26,255 INFO L290 TraceCheckUtils]: 2: Hoare triple {64878#true} assume true; {64878#true} is VALID [2022-04-28 15:37:26,255 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64878#true} {64878#true} #703#return; {64878#true} is VALID [2022-04-28 15:37:26,255 INFO L272 TraceCheckUtils]: 4: Hoare triple {64878#true} call #t~ret161 := main(); {64878#true} is VALID [2022-04-28 15:37:26,255 INFO L290 TraceCheckUtils]: 5: Hoare triple {64878#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {64878#true} is VALID [2022-04-28 15:37:26,255 INFO L290 TraceCheckUtils]: 6: Hoare triple {64878#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {64878#true} is VALID [2022-04-28 15:37:26,255 INFO L272 TraceCheckUtils]: 7: Hoare triple {64878#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {64878#true} is VALID [2022-04-28 15:37:26,255 INFO L290 TraceCheckUtils]: 8: Hoare triple {64878#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {64878#true} is VALID [2022-04-28 15:37:26,255 INFO L290 TraceCheckUtils]: 9: Hoare triple {64878#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {64878#true} is VALID [2022-04-28 15:37:26,255 INFO L290 TraceCheckUtils]: 10: Hoare triple {64878#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {64878#true} is VALID [2022-04-28 15:37:26,255 INFO L290 TraceCheckUtils]: 11: Hoare triple {64878#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {64878#true} is VALID [2022-04-28 15:37:26,255 INFO L290 TraceCheckUtils]: 12: Hoare triple {64878#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {64878#true} is VALID [2022-04-28 15:37:26,255 INFO L290 TraceCheckUtils]: 13: Hoare triple {64878#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {64878#true} is VALID [2022-04-28 15:37:26,255 INFO L290 TraceCheckUtils]: 14: Hoare triple {64878#true} assume !false; {64878#true} is VALID [2022-04-28 15:37:26,255 INFO L290 TraceCheckUtils]: 15: Hoare triple {64878#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {64878#true} is VALID [2022-04-28 15:37:26,255 INFO L290 TraceCheckUtils]: 16: Hoare triple {64878#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {64878#true} is VALID [2022-04-28 15:37:26,256 INFO L290 TraceCheckUtils]: 17: Hoare triple {64878#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {64878#true} is VALID [2022-04-28 15:37:26,256 INFO L290 TraceCheckUtils]: 18: Hoare triple {64878#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {64878#true} is VALID [2022-04-28 15:37:26,256 INFO L290 TraceCheckUtils]: 19: Hoare triple {64878#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {64878#true} is VALID [2022-04-28 15:37:26,256 INFO L290 TraceCheckUtils]: 20: Hoare triple {64878#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {64878#true} is VALID [2022-04-28 15:37:26,256 INFO L290 TraceCheckUtils]: 21: Hoare triple {64878#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {64878#true} is VALID [2022-04-28 15:37:26,256 INFO L290 TraceCheckUtils]: 22: Hoare triple {64878#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {64878#true} is VALID [2022-04-28 15:37:26,256 INFO L290 TraceCheckUtils]: 23: Hoare triple {64878#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {64878#true} is VALID [2022-04-28 15:37:26,256 INFO L290 TraceCheckUtils]: 24: Hoare triple {64878#true} assume 8464 == #t~mem55;havoc #t~mem55; {64878#true} is VALID [2022-04-28 15:37:26,256 INFO L290 TraceCheckUtils]: 25: Hoare triple {64878#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {64878#true} is VALID [2022-04-28 15:37:26,256 INFO L290 TraceCheckUtils]: 26: Hoare triple {64878#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {64878#true} is VALID [2022-04-28 15:37:26,256 INFO L290 TraceCheckUtils]: 27: Hoare triple {64878#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {64878#true} is VALID [2022-04-28 15:37:26,256 INFO L290 TraceCheckUtils]: 28: Hoare triple {64878#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {64878#true} is VALID [2022-04-28 15:37:26,256 INFO L290 TraceCheckUtils]: 29: Hoare triple {64878#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {64878#true} is VALID [2022-04-28 15:37:26,256 INFO L290 TraceCheckUtils]: 30: Hoare triple {64878#true} ~skip~0 := 0; {64878#true} is VALID [2022-04-28 15:37:26,256 INFO L290 TraceCheckUtils]: 31: Hoare triple {64878#true} assume !false; {64878#true} is VALID [2022-04-28 15:37:26,257 INFO L290 TraceCheckUtils]: 32: Hoare triple {64878#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {64878#true} is VALID [2022-04-28 15:37:26,257 INFO L290 TraceCheckUtils]: 33: Hoare triple {64878#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {64878#true} is VALID [2022-04-28 15:37:26,257 INFO L290 TraceCheckUtils]: 34: Hoare triple {64878#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {64878#true} is VALID [2022-04-28 15:37:26,257 INFO L290 TraceCheckUtils]: 35: Hoare triple {64878#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {64878#true} is VALID [2022-04-28 15:37:26,257 INFO L290 TraceCheckUtils]: 36: Hoare triple {64878#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {64878#true} is VALID [2022-04-28 15:37:26,257 INFO L290 TraceCheckUtils]: 37: Hoare triple {64878#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {64878#true} is VALID [2022-04-28 15:37:26,257 INFO L290 TraceCheckUtils]: 38: Hoare triple {64878#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {64878#true} is VALID [2022-04-28 15:37:26,257 INFO L290 TraceCheckUtils]: 39: Hoare triple {64878#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {64878#true} is VALID [2022-04-28 15:37:26,257 INFO L290 TraceCheckUtils]: 40: Hoare triple {64878#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {64878#true} is VALID [2022-04-28 15:37:26,257 INFO L290 TraceCheckUtils]: 41: Hoare triple {64878#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {64878#true} is VALID [2022-04-28 15:37:26,257 INFO L290 TraceCheckUtils]: 42: Hoare triple {64878#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {64878#true} is VALID [2022-04-28 15:37:26,257 INFO L290 TraceCheckUtils]: 43: Hoare triple {64878#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {64878#true} is VALID [2022-04-28 15:37:26,257 INFO L290 TraceCheckUtils]: 44: Hoare triple {64878#true} assume 8496 == #t~mem58;havoc #t~mem58; {64878#true} is VALID [2022-04-28 15:37:26,257 INFO L290 TraceCheckUtils]: 45: Hoare triple {64878#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {64878#true} is VALID [2022-04-28 15:37:26,257 INFO L290 TraceCheckUtils]: 46: Hoare triple {64878#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {64878#true} is VALID [2022-04-28 15:37:26,258 INFO L290 TraceCheckUtils]: 47: Hoare triple {64878#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {64878#true} is VALID [2022-04-28 15:37:26,258 INFO L290 TraceCheckUtils]: 48: Hoare triple {64878#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {64883#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:26,259 INFO L290 TraceCheckUtils]: 49: Hoare triple {64883#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {64883#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:26,259 INFO L290 TraceCheckUtils]: 50: Hoare triple {64883#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {64883#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:26,259 INFO L290 TraceCheckUtils]: 51: Hoare triple {64883#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {64883#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:26,260 INFO L290 TraceCheckUtils]: 52: Hoare triple {64883#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {64883#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:26,260 INFO L290 TraceCheckUtils]: 53: Hoare triple {64883#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {64883#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:26,260 INFO L290 TraceCheckUtils]: 54: Hoare triple {64883#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {64883#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:26,261 INFO L290 TraceCheckUtils]: 55: Hoare triple {64883#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {64883#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:26,261 INFO L290 TraceCheckUtils]: 56: Hoare triple {64883#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {64883#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:26,261 INFO L290 TraceCheckUtils]: 57: Hoare triple {64883#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {64883#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:26,262 INFO L290 TraceCheckUtils]: 58: Hoare triple {64883#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {64883#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:26,262 INFO L290 TraceCheckUtils]: 59: Hoare triple {64883#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {64883#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:26,262 INFO L290 TraceCheckUtils]: 60: Hoare triple {64883#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {64883#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:26,263 INFO L290 TraceCheckUtils]: 61: Hoare triple {64883#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {64883#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:26,263 INFO L290 TraceCheckUtils]: 62: Hoare triple {64883#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {64883#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:26,263 INFO L290 TraceCheckUtils]: 63: Hoare triple {64883#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {64883#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:26,264 INFO L290 TraceCheckUtils]: 64: Hoare triple {64883#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {64883#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:26,264 INFO L290 TraceCheckUtils]: 65: Hoare triple {64883#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {64883#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:26,264 INFO L290 TraceCheckUtils]: 66: Hoare triple {64883#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {64883#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:26,265 INFO L290 TraceCheckUtils]: 67: Hoare triple {64883#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {64883#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:26,265 INFO L290 TraceCheckUtils]: 68: Hoare triple {64883#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {64883#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:26,265 INFO L290 TraceCheckUtils]: 69: Hoare triple {64883#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {64884#(= |ssl3_accept_#t~mem62| 8656)} is VALID [2022-04-28 15:37:26,265 INFO L290 TraceCheckUtils]: 70: Hoare triple {64884#(= |ssl3_accept_#t~mem62| 8656)} assume 8528 == #t~mem62;havoc #t~mem62; {64879#false} is VALID [2022-04-28 15:37:26,266 INFO L290 TraceCheckUtils]: 71: Hoare triple {64879#false} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 888 + #t~mem99.offset, 8);call #t~mem101 := read~int(#t~mem100.base, 20 + #t~mem100.offset, 8);~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, 332 + ~s.offset, 8); {64879#false} is VALID [2022-04-28 15:37:26,266 INFO L290 TraceCheckUtils]: 72: Hoare triple {64879#false} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 18446744073709551616;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem103.base, 935 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {64879#false} is VALID [2022-04-28 15:37:26,266 INFO L290 TraceCheckUtils]: 73: Hoare triple {64879#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem106 := read~int(#t~mem105.base, 935 + #t~mem105.offset, 4); {64879#false} is VALID [2022-04-28 15:37:26,266 INFO L290 TraceCheckUtils]: 74: Hoare triple {64879#false} assume 0 != #t~mem106;havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {64879#false} is VALID [2022-04-28 15:37:26,266 INFO L290 TraceCheckUtils]: 75: Hoare triple {64879#false} assume -2147483648 <= #t~nondet115 && #t~nondet115 <= 2147483647;~ret~0 := #t~nondet115;havoc #t~nondet115; {64879#false} is VALID [2022-04-28 15:37:26,266 INFO L290 TraceCheckUtils]: 76: Hoare triple {64879#false} assume !(~ret~0 <= 0); {64879#false} is VALID [2022-04-28 15:37:26,266 INFO L290 TraceCheckUtils]: 77: Hoare triple {64879#false} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {64879#false} is VALID [2022-04-28 15:37:26,266 INFO L290 TraceCheckUtils]: 78: Hoare triple {64879#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {64879#false} is VALID [2022-04-28 15:37:26,266 INFO L290 TraceCheckUtils]: 79: Hoare triple {64879#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {64879#false} is VALID [2022-04-28 15:37:26,266 INFO L290 TraceCheckUtils]: 80: Hoare triple {64879#false} ~skip~0 := 0; {64879#false} is VALID [2022-04-28 15:37:26,266 INFO L290 TraceCheckUtils]: 81: Hoare triple {64879#false} assume !false; {64879#false} is VALID [2022-04-28 15:37:26,266 INFO L290 TraceCheckUtils]: 82: Hoare triple {64879#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {64879#false} is VALID [2022-04-28 15:37:26,266 INFO L290 TraceCheckUtils]: 83: Hoare triple {64879#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {64879#false} is VALID [2022-04-28 15:37:26,266 INFO L290 TraceCheckUtils]: 84: Hoare triple {64879#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {64879#false} is VALID [2022-04-28 15:37:26,267 INFO L290 TraceCheckUtils]: 85: Hoare triple {64879#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {64879#false} is VALID [2022-04-28 15:37:26,267 INFO L290 TraceCheckUtils]: 86: Hoare triple {64879#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {64879#false} is VALID [2022-04-28 15:37:26,267 INFO L290 TraceCheckUtils]: 87: Hoare triple {64879#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {64879#false} is VALID [2022-04-28 15:37:26,267 INFO L290 TraceCheckUtils]: 88: Hoare triple {64879#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {64879#false} is VALID [2022-04-28 15:37:26,267 INFO L290 TraceCheckUtils]: 89: Hoare triple {64879#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {64879#false} is VALID [2022-04-28 15:37:26,267 INFO L290 TraceCheckUtils]: 90: Hoare triple {64879#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {64879#false} is VALID [2022-04-28 15:37:26,267 INFO L290 TraceCheckUtils]: 91: Hoare triple {64879#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {64879#false} is VALID [2022-04-28 15:37:26,267 INFO L290 TraceCheckUtils]: 92: Hoare triple {64879#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {64879#false} is VALID [2022-04-28 15:37:26,267 INFO L290 TraceCheckUtils]: 93: Hoare triple {64879#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {64879#false} is VALID [2022-04-28 15:37:26,267 INFO L290 TraceCheckUtils]: 94: Hoare triple {64879#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {64879#false} is VALID [2022-04-28 15:37:26,267 INFO L290 TraceCheckUtils]: 95: Hoare triple {64879#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {64879#false} is VALID [2022-04-28 15:37:26,267 INFO L290 TraceCheckUtils]: 96: Hoare triple {64879#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {64879#false} is VALID [2022-04-28 15:37:26,267 INFO L290 TraceCheckUtils]: 97: Hoare triple {64879#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {64879#false} is VALID [2022-04-28 15:37:26,267 INFO L290 TraceCheckUtils]: 98: Hoare triple {64879#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {64879#false} is VALID [2022-04-28 15:37:26,267 INFO L290 TraceCheckUtils]: 99: Hoare triple {64879#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {64879#false} is VALID [2022-04-28 15:37:26,268 INFO L290 TraceCheckUtils]: 100: Hoare triple {64879#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {64879#false} is VALID [2022-04-28 15:37:26,268 INFO L290 TraceCheckUtils]: 101: Hoare triple {64879#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {64879#false} is VALID [2022-04-28 15:37:26,268 INFO L290 TraceCheckUtils]: 102: Hoare triple {64879#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {64879#false} is VALID [2022-04-28 15:37:26,268 INFO L290 TraceCheckUtils]: 103: Hoare triple {64879#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {64879#false} is VALID [2022-04-28 15:37:26,268 INFO L290 TraceCheckUtils]: 104: Hoare triple {64879#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {64879#false} is VALID [2022-04-28 15:37:26,268 INFO L290 TraceCheckUtils]: 105: Hoare triple {64879#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {64879#false} is VALID [2022-04-28 15:37:26,268 INFO L290 TraceCheckUtils]: 106: Hoare triple {64879#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {64879#false} is VALID [2022-04-28 15:37:26,268 INFO L290 TraceCheckUtils]: 107: Hoare triple {64879#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {64879#false} is VALID [2022-04-28 15:37:26,268 INFO L290 TraceCheckUtils]: 108: Hoare triple {64879#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {64879#false} is VALID [2022-04-28 15:37:26,268 INFO L290 TraceCheckUtils]: 109: Hoare triple {64879#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {64879#false} is VALID [2022-04-28 15:37:26,268 INFO L290 TraceCheckUtils]: 110: Hoare triple {64879#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {64879#false} is VALID [2022-04-28 15:37:26,268 INFO L290 TraceCheckUtils]: 111: Hoare triple {64879#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {64879#false} is VALID [2022-04-28 15:37:26,268 INFO L290 TraceCheckUtils]: 112: Hoare triple {64879#false} assume 8641 == #t~mem76;havoc #t~mem76; {64879#false} is VALID [2022-04-28 15:37:26,268 INFO L290 TraceCheckUtils]: 113: Hoare triple {64879#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {64879#false} is VALID [2022-04-28 15:37:26,268 INFO L290 TraceCheckUtils]: 114: Hoare triple {64879#false} assume !(4 == ~blastFlag~0); {64879#false} is VALID [2022-04-28 15:37:26,269 INFO L290 TraceCheckUtils]: 115: Hoare triple {64879#false} assume !(7 == ~blastFlag~0); {64879#false} is VALID [2022-04-28 15:37:26,269 INFO L290 TraceCheckUtils]: 116: Hoare triple {64879#false} assume !(10 == ~blastFlag~0); {64879#false} is VALID [2022-04-28 15:37:26,269 INFO L290 TraceCheckUtils]: 117: Hoare triple {64879#false} assume !false; {64879#false} is VALID [2022-04-28 15:37:26,269 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-28 15:37:26,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:37:26,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677643074] [2022-04-28 15:37:26,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677643074] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:37:26,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:37:26,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:37:26,269 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:37:26,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1226082450] [2022-04-28 15:37:26,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1226082450] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:37:26,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:37:26,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:37:26,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190177668] [2022-04-28 15:37:26,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:37:26,272 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 118 [2022-04-28 15:37:26,272 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:37:26,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:37:26,339 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:37:26,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:37:26,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:37:26,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:37:26,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:37:26,342 INFO L87 Difference]: Start difference. First operand 478 states and 702 transitions. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:37:29,034 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:37:32,456 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-28 15:37:35,152 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:37:37,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:37:37,368 INFO L93 Difference]: Finished difference Result 962 states and 1419 transitions. [2022-04-28 15:37:37,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:37:37,369 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 118 [2022-04-28 15:37:37,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:37:37,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:37:37,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 529 transitions. [2022-04-28 15:37:37,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:37:37,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 529 transitions. [2022-04-28 15:37:37,372 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 529 transitions. [2022-04-28 15:37:37,712 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-28 15:37:37,723 INFO L225 Difference]: With dead ends: 962 [2022-04-28 15:37:37,723 INFO L226 Difference]: Without dead ends: 510 [2022-04-28 15:37:37,724 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-28 15:37:37,724 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 69 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:37:37,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 537 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-04-28 15:37:37,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2022-04-28 15:37:37,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 478. [2022-04-28 15:37:37,744 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:37:37,744 INFO L82 GeneralOperation]: Start isEquivalent. First operand 510 states. Second operand has 478 states, 473 states have (on average 1.4735729386892178) internal successors, (697), 473 states have internal predecessors, (697), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:37:37,744 INFO L74 IsIncluded]: Start isIncluded. First operand 510 states. Second operand has 478 states, 473 states have (on average 1.4735729386892178) internal successors, (697), 473 states have internal predecessors, (697), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:37:37,745 INFO L87 Difference]: Start difference. First operand 510 states. Second operand has 478 states, 473 states have (on average 1.4735729386892178) internal successors, (697), 473 states have internal predecessors, (697), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:37:37,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:37:37,753 INFO L93 Difference]: Finished difference Result 510 states and 746 transitions. [2022-04-28 15:37:37,753 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 746 transitions. [2022-04-28 15:37:37,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:37:37,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:37:37,754 INFO L74 IsIncluded]: Start isIncluded. First operand has 478 states, 473 states have (on average 1.4735729386892178) internal successors, (697), 473 states have internal predecessors, (697), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 510 states. [2022-04-28 15:37:37,754 INFO L87 Difference]: Start difference. First operand has 478 states, 473 states have (on average 1.4735729386892178) internal successors, (697), 473 states have internal predecessors, (697), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 510 states. [2022-04-28 15:37:37,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:37:37,762 INFO L93 Difference]: Finished difference Result 510 states and 746 transitions. [2022-04-28 15:37:37,763 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 746 transitions. [2022-04-28 15:37:37,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:37:37,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:37:37,763 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:37:37,763 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:37:37,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 473 states have (on average 1.4735729386892178) internal successors, (697), 473 states have internal predecessors, (697), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:37:37,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 701 transitions. [2022-04-28 15:37:37,773 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 701 transitions. Word has length 118 [2022-04-28 15:37:37,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:37:37,773 INFO L495 AbstractCegarLoop]: Abstraction has 478 states and 701 transitions. [2022-04-28 15:37:37,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:37:37,774 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 478 states and 701 transitions. [2022-04-28 15:37:38,336 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 701 edges. 701 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:37:38,336 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 701 transitions. [2022-04-28 15:37:38,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-04-28 15:37:38,338 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:37:38,338 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:37:38,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-04-28 15:37:38,338 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:37:38,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:37:38,339 INFO L85 PathProgramCache]: Analyzing trace with hash -162754836, now seen corresponding path program 1 times [2022-04-28 15:37:38,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:37:38,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [260909971] [2022-04-28 15:37:38,424 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:37:38,424 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:37:38,424 INFO L85 PathProgramCache]: Analyzing trace with hash -162754836, now seen corresponding path program 2 times [2022-04-28 15:37:38,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:37:38,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266281428] [2022-04-28 15:37:38,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:37:38,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:37:38,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:37:38,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:37:38,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:37:38,541 INFO L290 TraceCheckUtils]: 0: Hoare triple {68797#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {68790#true} is VALID [2022-04-28 15:37:38,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {68790#true} assume true; {68790#true} is VALID [2022-04-28 15:37:38,541 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {68790#true} {68790#true} #703#return; {68790#true} is VALID [2022-04-28 15:37:38,542 INFO L272 TraceCheckUtils]: 0: Hoare triple {68790#true} call ULTIMATE.init(); {68797#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-28 15:37:38,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {68797#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {68790#true} is VALID [2022-04-28 15:37:38,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {68790#true} assume true; {68790#true} is VALID [2022-04-28 15:37:38,542 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {68790#true} {68790#true} #703#return; {68790#true} is VALID [2022-04-28 15:37:38,542 INFO L272 TraceCheckUtils]: 4: Hoare triple {68790#true} call #t~ret161 := main(); {68790#true} is VALID [2022-04-28 15:37:38,542 INFO L290 TraceCheckUtils]: 5: Hoare triple {68790#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {68790#true} is VALID [2022-04-28 15:37:38,542 INFO L290 TraceCheckUtils]: 6: Hoare triple {68790#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {68790#true} is VALID [2022-04-28 15:37:38,542 INFO L272 TraceCheckUtils]: 7: Hoare triple {68790#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {68790#true} is VALID [2022-04-28 15:37:38,542 INFO L290 TraceCheckUtils]: 8: Hoare triple {68790#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {68790#true} is VALID [2022-04-28 15:37:38,542 INFO L290 TraceCheckUtils]: 9: Hoare triple {68790#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {68790#true} is VALID [2022-04-28 15:37:38,542 INFO L290 TraceCheckUtils]: 10: Hoare triple {68790#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {68790#true} is VALID [2022-04-28 15:37:38,542 INFO L290 TraceCheckUtils]: 11: Hoare triple {68790#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {68790#true} is VALID [2022-04-28 15:37:38,542 INFO L290 TraceCheckUtils]: 12: Hoare triple {68790#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {68790#true} is VALID [2022-04-28 15:37:38,542 INFO L290 TraceCheckUtils]: 13: Hoare triple {68790#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {68790#true} is VALID [2022-04-28 15:37:38,543 INFO L290 TraceCheckUtils]: 14: Hoare triple {68790#true} assume !false; {68790#true} is VALID [2022-04-28 15:37:38,543 INFO L290 TraceCheckUtils]: 15: Hoare triple {68790#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {68790#true} is VALID [2022-04-28 15:37:38,543 INFO L290 TraceCheckUtils]: 16: Hoare triple {68790#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {68790#true} is VALID [2022-04-28 15:37:38,543 INFO L290 TraceCheckUtils]: 17: Hoare triple {68790#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {68790#true} is VALID [2022-04-28 15:37:38,543 INFO L290 TraceCheckUtils]: 18: Hoare triple {68790#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {68790#true} is VALID [2022-04-28 15:37:38,543 INFO L290 TraceCheckUtils]: 19: Hoare triple {68790#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {68790#true} is VALID [2022-04-28 15:37:38,543 INFO L290 TraceCheckUtils]: 20: Hoare triple {68790#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {68790#true} is VALID [2022-04-28 15:37:38,543 INFO L290 TraceCheckUtils]: 21: Hoare triple {68790#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {68790#true} is VALID [2022-04-28 15:37:38,543 INFO L290 TraceCheckUtils]: 22: Hoare triple {68790#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {68790#true} is VALID [2022-04-28 15:37:38,543 INFO L290 TraceCheckUtils]: 23: Hoare triple {68790#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {68790#true} is VALID [2022-04-28 15:37:38,543 INFO L290 TraceCheckUtils]: 24: Hoare triple {68790#true} assume 8464 == #t~mem55;havoc #t~mem55; {68790#true} is VALID [2022-04-28 15:37:38,543 INFO L290 TraceCheckUtils]: 25: Hoare triple {68790#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {68790#true} is VALID [2022-04-28 15:37:38,543 INFO L290 TraceCheckUtils]: 26: Hoare triple {68790#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {68790#true} is VALID [2022-04-28 15:37:38,543 INFO L290 TraceCheckUtils]: 27: Hoare triple {68790#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {68790#true} is VALID [2022-04-28 15:37:38,543 INFO L290 TraceCheckUtils]: 28: Hoare triple {68790#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {68790#true} is VALID [2022-04-28 15:37:38,544 INFO L290 TraceCheckUtils]: 29: Hoare triple {68790#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {68790#true} is VALID [2022-04-28 15:37:38,544 INFO L290 TraceCheckUtils]: 30: Hoare triple {68790#true} ~skip~0 := 0; {68790#true} is VALID [2022-04-28 15:37:38,544 INFO L290 TraceCheckUtils]: 31: Hoare triple {68790#true} assume !false; {68790#true} is VALID [2022-04-28 15:37:38,544 INFO L290 TraceCheckUtils]: 32: Hoare triple {68790#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {68790#true} is VALID [2022-04-28 15:37:38,544 INFO L290 TraceCheckUtils]: 33: Hoare triple {68790#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {68790#true} is VALID [2022-04-28 15:37:38,544 INFO L290 TraceCheckUtils]: 34: Hoare triple {68790#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {68790#true} is VALID [2022-04-28 15:37:38,544 INFO L290 TraceCheckUtils]: 35: Hoare triple {68790#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {68790#true} is VALID [2022-04-28 15:37:38,544 INFO L290 TraceCheckUtils]: 36: Hoare triple {68790#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {68790#true} is VALID [2022-04-28 15:37:38,544 INFO L290 TraceCheckUtils]: 37: Hoare triple {68790#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {68790#true} is VALID [2022-04-28 15:37:38,544 INFO L290 TraceCheckUtils]: 38: Hoare triple {68790#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {68790#true} is VALID [2022-04-28 15:37:38,544 INFO L290 TraceCheckUtils]: 39: Hoare triple {68790#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {68790#true} is VALID [2022-04-28 15:37:38,544 INFO L290 TraceCheckUtils]: 40: Hoare triple {68790#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {68790#true} is VALID [2022-04-28 15:37:38,544 INFO L290 TraceCheckUtils]: 41: Hoare triple {68790#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {68790#true} is VALID [2022-04-28 15:37:38,544 INFO L290 TraceCheckUtils]: 42: Hoare triple {68790#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {68790#true} is VALID [2022-04-28 15:37:38,544 INFO L290 TraceCheckUtils]: 43: Hoare triple {68790#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {68790#true} is VALID [2022-04-28 15:37:38,545 INFO L290 TraceCheckUtils]: 44: Hoare triple {68790#true} assume 8496 == #t~mem58;havoc #t~mem58; {68790#true} is VALID [2022-04-28 15:37:38,545 INFO L290 TraceCheckUtils]: 45: Hoare triple {68790#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {68790#true} is VALID [2022-04-28 15:37:38,545 INFO L290 TraceCheckUtils]: 46: Hoare triple {68790#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {68790#true} is VALID [2022-04-28 15:37:38,545 INFO L290 TraceCheckUtils]: 47: Hoare triple {68790#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {68790#true} is VALID [2022-04-28 15:37:38,545 INFO L290 TraceCheckUtils]: 48: Hoare triple {68790#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {68795#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:38,546 INFO L290 TraceCheckUtils]: 49: Hoare triple {68795#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {68795#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:38,546 INFO L290 TraceCheckUtils]: 50: Hoare triple {68795#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {68795#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:38,547 INFO L290 TraceCheckUtils]: 51: Hoare triple {68795#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {68795#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:38,547 INFO L290 TraceCheckUtils]: 52: Hoare triple {68795#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {68795#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:38,547 INFO L290 TraceCheckUtils]: 53: Hoare triple {68795#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {68795#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:38,548 INFO L290 TraceCheckUtils]: 54: Hoare triple {68795#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {68795#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:38,548 INFO L290 TraceCheckUtils]: 55: Hoare triple {68795#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {68795#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:38,548 INFO L290 TraceCheckUtils]: 56: Hoare triple {68795#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {68795#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:38,549 INFO L290 TraceCheckUtils]: 57: Hoare triple {68795#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {68795#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:38,549 INFO L290 TraceCheckUtils]: 58: Hoare triple {68795#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {68795#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:38,549 INFO L290 TraceCheckUtils]: 59: Hoare triple {68795#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {68795#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:38,550 INFO L290 TraceCheckUtils]: 60: Hoare triple {68795#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {68795#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:38,550 INFO L290 TraceCheckUtils]: 61: Hoare triple {68795#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {68795#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:38,550 INFO L290 TraceCheckUtils]: 62: Hoare triple {68795#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {68795#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:38,551 INFO L290 TraceCheckUtils]: 63: Hoare triple {68795#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {68795#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:38,551 INFO L290 TraceCheckUtils]: 64: Hoare triple {68795#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {68795#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:38,551 INFO L290 TraceCheckUtils]: 65: Hoare triple {68795#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {68795#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:38,552 INFO L290 TraceCheckUtils]: 66: Hoare triple {68795#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {68795#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:38,552 INFO L290 TraceCheckUtils]: 67: Hoare triple {68795#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {68795#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:38,552 INFO L290 TraceCheckUtils]: 68: Hoare triple {68795#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {68795#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:38,553 INFO L290 TraceCheckUtils]: 69: Hoare triple {68795#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {68795#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:37:38,553 INFO L290 TraceCheckUtils]: 70: Hoare triple {68795#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {68796#(= |ssl3_accept_#t~mem63| 8656)} is VALID [2022-04-28 15:37:38,554 INFO L290 TraceCheckUtils]: 71: Hoare triple {68796#(= |ssl3_accept_#t~mem63| 8656)} assume 8529 == #t~mem63;havoc #t~mem63; {68791#false} is VALID [2022-04-28 15:37:38,554 INFO L290 TraceCheckUtils]: 72: Hoare triple {68791#false} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 888 + #t~mem99.offset, 8);call #t~mem101 := read~int(#t~mem100.base, 20 + #t~mem100.offset, 8);~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, 332 + ~s.offset, 8); {68791#false} is VALID [2022-04-28 15:37:38,554 INFO L290 TraceCheckUtils]: 73: Hoare triple {68791#false} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 18446744073709551616;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem103.base, 935 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {68791#false} is VALID [2022-04-28 15:37:38,554 INFO L290 TraceCheckUtils]: 74: Hoare triple {68791#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem106 := read~int(#t~mem105.base, 935 + #t~mem105.offset, 4); {68791#false} is VALID [2022-04-28 15:37:38,554 INFO L290 TraceCheckUtils]: 75: Hoare triple {68791#false} assume 0 != #t~mem106;havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {68791#false} is VALID [2022-04-28 15:37:38,554 INFO L290 TraceCheckUtils]: 76: Hoare triple {68791#false} assume -2147483648 <= #t~nondet115 && #t~nondet115 <= 2147483647;~ret~0 := #t~nondet115;havoc #t~nondet115; {68791#false} is VALID [2022-04-28 15:37:38,554 INFO L290 TraceCheckUtils]: 77: Hoare triple {68791#false} assume !(~ret~0 <= 0); {68791#false} is VALID [2022-04-28 15:37:38,554 INFO L290 TraceCheckUtils]: 78: Hoare triple {68791#false} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {68791#false} is VALID [2022-04-28 15:37:38,554 INFO L290 TraceCheckUtils]: 79: Hoare triple {68791#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {68791#false} is VALID [2022-04-28 15:37:38,555 INFO L290 TraceCheckUtils]: 80: Hoare triple {68791#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {68791#false} is VALID [2022-04-28 15:37:38,555 INFO L290 TraceCheckUtils]: 81: Hoare triple {68791#false} ~skip~0 := 0; {68791#false} is VALID [2022-04-28 15:37:38,555 INFO L290 TraceCheckUtils]: 82: Hoare triple {68791#false} assume !false; {68791#false} is VALID [2022-04-28 15:37:38,555 INFO L290 TraceCheckUtils]: 83: Hoare triple {68791#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {68791#false} is VALID [2022-04-28 15:37:38,555 INFO L290 TraceCheckUtils]: 84: Hoare triple {68791#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {68791#false} is VALID [2022-04-28 15:37:38,555 INFO L290 TraceCheckUtils]: 85: Hoare triple {68791#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {68791#false} is VALID [2022-04-28 15:37:38,555 INFO L290 TraceCheckUtils]: 86: Hoare triple {68791#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {68791#false} is VALID [2022-04-28 15:37:38,555 INFO L290 TraceCheckUtils]: 87: Hoare triple {68791#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {68791#false} is VALID [2022-04-28 15:37:38,555 INFO L290 TraceCheckUtils]: 88: Hoare triple {68791#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {68791#false} is VALID [2022-04-28 15:37:38,555 INFO L290 TraceCheckUtils]: 89: Hoare triple {68791#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {68791#false} is VALID [2022-04-28 15:37:38,555 INFO L290 TraceCheckUtils]: 90: Hoare triple {68791#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {68791#false} is VALID [2022-04-28 15:37:38,555 INFO L290 TraceCheckUtils]: 91: Hoare triple {68791#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {68791#false} is VALID [2022-04-28 15:37:38,555 INFO L290 TraceCheckUtils]: 92: Hoare triple {68791#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {68791#false} is VALID [2022-04-28 15:37:38,555 INFO L290 TraceCheckUtils]: 93: Hoare triple {68791#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {68791#false} is VALID [2022-04-28 15:37:38,556 INFO L290 TraceCheckUtils]: 94: Hoare triple {68791#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {68791#false} is VALID [2022-04-28 15:37:38,556 INFO L290 TraceCheckUtils]: 95: Hoare triple {68791#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {68791#false} is VALID [2022-04-28 15:37:38,556 INFO L290 TraceCheckUtils]: 96: Hoare triple {68791#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {68791#false} is VALID [2022-04-28 15:37:38,556 INFO L290 TraceCheckUtils]: 97: Hoare triple {68791#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {68791#false} is VALID [2022-04-28 15:37:38,556 INFO L290 TraceCheckUtils]: 98: Hoare triple {68791#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {68791#false} is VALID [2022-04-28 15:37:38,556 INFO L290 TraceCheckUtils]: 99: Hoare triple {68791#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {68791#false} is VALID [2022-04-28 15:37:38,556 INFO L290 TraceCheckUtils]: 100: Hoare triple {68791#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {68791#false} is VALID [2022-04-28 15:37:38,556 INFO L290 TraceCheckUtils]: 101: Hoare triple {68791#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {68791#false} is VALID [2022-04-28 15:37:38,556 INFO L290 TraceCheckUtils]: 102: Hoare triple {68791#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {68791#false} is VALID [2022-04-28 15:37:38,556 INFO L290 TraceCheckUtils]: 103: Hoare triple {68791#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {68791#false} is VALID [2022-04-28 15:37:38,556 INFO L290 TraceCheckUtils]: 104: Hoare triple {68791#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {68791#false} is VALID [2022-04-28 15:37:38,556 INFO L290 TraceCheckUtils]: 105: Hoare triple {68791#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {68791#false} is VALID [2022-04-28 15:37:38,556 INFO L290 TraceCheckUtils]: 106: Hoare triple {68791#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {68791#false} is VALID [2022-04-28 15:37:38,556 INFO L290 TraceCheckUtils]: 107: Hoare triple {68791#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {68791#false} is VALID [2022-04-28 15:37:38,556 INFO L290 TraceCheckUtils]: 108: Hoare triple {68791#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {68791#false} is VALID [2022-04-28 15:37:38,557 INFO L290 TraceCheckUtils]: 109: Hoare triple {68791#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {68791#false} is VALID [2022-04-28 15:37:38,557 INFO L290 TraceCheckUtils]: 110: Hoare triple {68791#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {68791#false} is VALID [2022-04-28 15:37:38,557 INFO L290 TraceCheckUtils]: 111: Hoare triple {68791#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {68791#false} is VALID [2022-04-28 15:37:38,557 INFO L290 TraceCheckUtils]: 112: Hoare triple {68791#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {68791#false} is VALID [2022-04-28 15:37:38,557 INFO L290 TraceCheckUtils]: 113: Hoare triple {68791#false} assume 8641 == #t~mem76;havoc #t~mem76; {68791#false} is VALID [2022-04-28 15:37:38,557 INFO L290 TraceCheckUtils]: 114: Hoare triple {68791#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {68791#false} is VALID [2022-04-28 15:37:38,557 INFO L290 TraceCheckUtils]: 115: Hoare triple {68791#false} assume !(4 == ~blastFlag~0); {68791#false} is VALID [2022-04-28 15:37:38,557 INFO L290 TraceCheckUtils]: 116: Hoare triple {68791#false} assume !(7 == ~blastFlag~0); {68791#false} is VALID [2022-04-28 15:37:38,557 INFO L290 TraceCheckUtils]: 117: Hoare triple {68791#false} assume !(10 == ~blastFlag~0); {68791#false} is VALID [2022-04-28 15:37:38,557 INFO L290 TraceCheckUtils]: 118: Hoare triple {68791#false} assume !false; {68791#false} is VALID [2022-04-28 15:37:38,558 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-28 15:37:38,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:37:38,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266281428] [2022-04-28 15:37:38,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266281428] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:37:38,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:37:38,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:37:38,558 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:37:38,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [260909971] [2022-04-28 15:37:38,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [260909971] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:37:38,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:37:38,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:37:38,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678806897] [2022-04-28 15:37:38,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:37:38,559 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 119 [2022-04-28 15:37:38,559 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:37:38,559 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:37:38,633 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:37:38,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:37:38,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:37:38,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:37:38,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:37:38,635 INFO L87 Difference]: Start difference. First operand 478 states and 701 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:37:42,795 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:37:45,598 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:37:48,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:37:48,886 INFO L93 Difference]: Finished difference Result 960 states and 1414 transitions. [2022-04-28 15:37:48,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:37:48,886 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 119 [2022-04-28 15:37:48,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:37:48,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:37:48,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 525 transitions. [2022-04-28 15:37:48,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:37:48,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 525 transitions. [2022-04-28 15:37:48,890 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 525 transitions. [2022-04-28 15:37:49,208 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 525 edges. 525 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:37:49,218 INFO L225 Difference]: With dead ends: 960 [2022-04-28 15:37:49,219 INFO L226 Difference]: Without dead ends: 508 [2022-04-28 15:37:49,219 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-28 15:37:49,222 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 66 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-04-28 15:37:49,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 543 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-04-28 15:37:49,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2022-04-28 15:37:49,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 478. [2022-04-28 15:37:49,253 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:37:49,254 INFO L82 GeneralOperation]: Start isEquivalent. First operand 508 states. Second operand has 478 states, 473 states have (on average 1.4714587737843552) internal successors, (696), 473 states have internal predecessors, (696), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:37:49,254 INFO L74 IsIncluded]: Start isIncluded. First operand 508 states. Second operand has 478 states, 473 states have (on average 1.4714587737843552) internal successors, (696), 473 states have internal predecessors, (696), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:37:49,255 INFO L87 Difference]: Start difference. First operand 508 states. Second operand has 478 states, 473 states have (on average 1.4714587737843552) internal successors, (696), 473 states have internal predecessors, (696), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:37:49,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:37:49,262 INFO L93 Difference]: Finished difference Result 508 states and 742 transitions. [2022-04-28 15:37:49,262 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 742 transitions. [2022-04-28 15:37:49,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:37:49,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:37:49,263 INFO L74 IsIncluded]: Start isIncluded. First operand has 478 states, 473 states have (on average 1.4714587737843552) internal successors, (696), 473 states have internal predecessors, (696), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 508 states. [2022-04-28 15:37:49,264 INFO L87 Difference]: Start difference. First operand has 478 states, 473 states have (on average 1.4714587737843552) internal successors, (696), 473 states have internal predecessors, (696), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 508 states. [2022-04-28 15:37:49,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:37:49,271 INFO L93 Difference]: Finished difference Result 508 states and 742 transitions. [2022-04-28 15:37:49,271 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 742 transitions. [2022-04-28 15:37:49,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:37:49,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:37:49,272 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:37:49,272 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:37:49,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 473 states have (on average 1.4714587737843552) internal successors, (696), 473 states have internal predecessors, (696), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:37:49,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 700 transitions. [2022-04-28 15:37:49,282 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 700 transitions. Word has length 119 [2022-04-28 15:37:49,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:37:49,282 INFO L495 AbstractCegarLoop]: Abstraction has 478 states and 700 transitions. [2022-04-28 15:37:49,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:37:49,282 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 478 states and 700 transitions. [2022-04-28 15:37:49,886 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 700 edges. 700 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:37:49,886 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 700 transitions. [2022-04-28 15:37:49,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-04-28 15:37:49,887 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:37:49,887 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 15:37:49,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-04-28 15:37:49,887 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:37:49,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:37:49,887 INFO L85 PathProgramCache]: Analyzing trace with hash -231019160, now seen corresponding path program 1 times [2022-04-28 15:37:49,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:37:49,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [700146440] [2022-04-28 15:37:49,946 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:37:49,947 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:37:49,947 INFO L85 PathProgramCache]: Analyzing trace with hash -231019160, now seen corresponding path program 2 times [2022-04-28 15:37:49,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:37:49,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732476503] [2022-04-28 15:37:49,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:37:49,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:37:50,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:37:50,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:37:50,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:37:50,088 INFO L290 TraceCheckUtils]: 0: Hoare triple {72701#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {72694#true} is VALID [2022-04-28 15:37:50,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {72694#true} assume true; {72694#true} is VALID [2022-04-28 15:37:50,088 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {72694#true} {72694#true} #703#return; {72694#true} is VALID [2022-04-28 15:37:50,089 INFO L272 TraceCheckUtils]: 0: Hoare triple {72694#true} call ULTIMATE.init(); {72701#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-28 15:37:50,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {72701#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {72694#true} is VALID [2022-04-28 15:37:50,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {72694#true} assume true; {72694#true} is VALID [2022-04-28 15:37:50,089 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {72694#true} {72694#true} #703#return; {72694#true} is VALID [2022-04-28 15:37:50,089 INFO L272 TraceCheckUtils]: 4: Hoare triple {72694#true} call #t~ret161 := main(); {72694#true} is VALID [2022-04-28 15:37:50,089 INFO L290 TraceCheckUtils]: 5: Hoare triple {72694#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {72694#true} is VALID [2022-04-28 15:37:50,089 INFO L290 TraceCheckUtils]: 6: Hoare triple {72694#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {72694#true} is VALID [2022-04-28 15:37:50,090 INFO L272 TraceCheckUtils]: 7: Hoare triple {72694#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {72694#true} is VALID [2022-04-28 15:37:50,090 INFO L290 TraceCheckUtils]: 8: Hoare triple {72694#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {72694#true} is VALID [2022-04-28 15:37:50,090 INFO L290 TraceCheckUtils]: 9: Hoare triple {72694#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {72694#true} is VALID [2022-04-28 15:37:50,090 INFO L290 TraceCheckUtils]: 10: Hoare triple {72694#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {72694#true} is VALID [2022-04-28 15:37:50,090 INFO L290 TraceCheckUtils]: 11: Hoare triple {72694#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {72694#true} is VALID [2022-04-28 15:37:50,090 INFO L290 TraceCheckUtils]: 12: Hoare triple {72694#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {72694#true} is VALID [2022-04-28 15:37:50,090 INFO L290 TraceCheckUtils]: 13: Hoare triple {72694#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {72694#true} is VALID [2022-04-28 15:37:50,090 INFO L290 TraceCheckUtils]: 14: Hoare triple {72694#true} assume !false; {72694#true} is VALID [2022-04-28 15:37:50,090 INFO L290 TraceCheckUtils]: 15: Hoare triple {72694#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {72694#true} is VALID [2022-04-28 15:37:50,090 INFO L290 TraceCheckUtils]: 16: Hoare triple {72694#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {72694#true} is VALID [2022-04-28 15:37:50,090 INFO L290 TraceCheckUtils]: 17: Hoare triple {72694#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {72694#true} is VALID [2022-04-28 15:37:50,090 INFO L290 TraceCheckUtils]: 18: Hoare triple {72694#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {72694#true} is VALID [2022-04-28 15:37:50,090 INFO L290 TraceCheckUtils]: 19: Hoare triple {72694#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {72694#true} is VALID [2022-04-28 15:37:50,090 INFO L290 TraceCheckUtils]: 20: Hoare triple {72694#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {72694#true} is VALID [2022-04-28 15:37:50,090 INFO L290 TraceCheckUtils]: 21: Hoare triple {72694#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {72694#true} is VALID [2022-04-28 15:37:50,091 INFO L290 TraceCheckUtils]: 22: Hoare triple {72694#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {72694#true} is VALID [2022-04-28 15:37:50,091 INFO L290 TraceCheckUtils]: 23: Hoare triple {72694#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {72694#true} is VALID [2022-04-28 15:37:50,091 INFO L290 TraceCheckUtils]: 24: Hoare triple {72694#true} assume 8464 == #t~mem55;havoc #t~mem55; {72694#true} is VALID [2022-04-28 15:37:50,091 INFO L290 TraceCheckUtils]: 25: Hoare triple {72694#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {72694#true} is VALID [2022-04-28 15:37:50,091 INFO L290 TraceCheckUtils]: 26: Hoare triple {72694#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {72694#true} is VALID [2022-04-28 15:37:50,091 INFO L290 TraceCheckUtils]: 27: Hoare triple {72694#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {72694#true} is VALID [2022-04-28 15:37:50,091 INFO L290 TraceCheckUtils]: 28: Hoare triple {72694#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {72694#true} is VALID [2022-04-28 15:37:50,091 INFO L290 TraceCheckUtils]: 29: Hoare triple {72694#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {72694#true} is VALID [2022-04-28 15:37:50,091 INFO L290 TraceCheckUtils]: 30: Hoare triple {72694#true} ~skip~0 := 0; {72694#true} is VALID [2022-04-28 15:37:50,091 INFO L290 TraceCheckUtils]: 31: Hoare triple {72694#true} assume !false; {72694#true} is VALID [2022-04-28 15:37:50,091 INFO L290 TraceCheckUtils]: 32: Hoare triple {72694#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {72694#true} is VALID [2022-04-28 15:37:50,091 INFO L290 TraceCheckUtils]: 33: Hoare triple {72694#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {72694#true} is VALID [2022-04-28 15:37:50,091 INFO L290 TraceCheckUtils]: 34: Hoare triple {72694#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {72694#true} is VALID [2022-04-28 15:37:50,091 INFO L290 TraceCheckUtils]: 35: Hoare triple {72694#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {72694#true} is VALID [2022-04-28 15:37:50,091 INFO L290 TraceCheckUtils]: 36: Hoare triple {72694#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {72694#true} is VALID [2022-04-28 15:37:50,092 INFO L290 TraceCheckUtils]: 37: Hoare triple {72694#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {72694#true} is VALID [2022-04-28 15:37:50,092 INFO L290 TraceCheckUtils]: 38: Hoare triple {72694#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {72694#true} is VALID [2022-04-28 15:37:50,092 INFO L290 TraceCheckUtils]: 39: Hoare triple {72694#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {72694#true} is VALID [2022-04-28 15:37:50,092 INFO L290 TraceCheckUtils]: 40: Hoare triple {72694#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {72694#true} is VALID [2022-04-28 15:37:50,092 INFO L290 TraceCheckUtils]: 41: Hoare triple {72694#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {72694#true} is VALID [2022-04-28 15:37:50,092 INFO L290 TraceCheckUtils]: 42: Hoare triple {72694#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {72694#true} is VALID [2022-04-28 15:37:50,092 INFO L290 TraceCheckUtils]: 43: Hoare triple {72694#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {72694#true} is VALID [2022-04-28 15:37:50,092 INFO L290 TraceCheckUtils]: 44: Hoare triple {72694#true} assume 8496 == #t~mem58;havoc #t~mem58; {72694#true} is VALID [2022-04-28 15:37:50,092 INFO L290 TraceCheckUtils]: 45: Hoare triple {72694#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {72694#true} is VALID [2022-04-28 15:37:50,092 INFO L290 TraceCheckUtils]: 46: Hoare triple {72694#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {72694#true} is VALID [2022-04-28 15:37:50,092 INFO L290 TraceCheckUtils]: 47: Hoare triple {72694#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {72694#true} is VALID [2022-04-28 15:37:50,093 INFO L290 TraceCheckUtils]: 48: Hoare triple {72694#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {72699#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:37:50,093 INFO L290 TraceCheckUtils]: 49: Hoare triple {72699#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {72699#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:37:50,094 INFO L290 TraceCheckUtils]: 50: Hoare triple {72699#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {72699#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:37:50,094 INFO L290 TraceCheckUtils]: 51: Hoare triple {72699#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {72699#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:37:50,094 INFO L290 TraceCheckUtils]: 52: Hoare triple {72699#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} ~skip~0 := 0; {72699#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:37:50,095 INFO L290 TraceCheckUtils]: 53: Hoare triple {72699#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {72699#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:37:50,095 INFO L290 TraceCheckUtils]: 54: Hoare triple {72699#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {72699#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:37:50,095 INFO L290 TraceCheckUtils]: 55: Hoare triple {72699#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {72699#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:37:50,096 INFO L290 TraceCheckUtils]: 56: Hoare triple {72699#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {72699#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:37:50,096 INFO L290 TraceCheckUtils]: 57: Hoare triple {72699#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {72699#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:37:50,096 INFO L290 TraceCheckUtils]: 58: Hoare triple {72699#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {72699#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:37:50,097 INFO L290 TraceCheckUtils]: 59: Hoare triple {72699#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {72699#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:37:50,097 INFO L290 TraceCheckUtils]: 60: Hoare triple {72699#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {72699#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:37:50,097 INFO L290 TraceCheckUtils]: 61: Hoare triple {72699#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {72699#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:37:50,098 INFO L290 TraceCheckUtils]: 62: Hoare triple {72699#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {72699#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:37:50,098 INFO L290 TraceCheckUtils]: 63: Hoare triple {72699#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {72699#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:37:50,098 INFO L290 TraceCheckUtils]: 64: Hoare triple {72699#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {72699#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:37:50,099 INFO L290 TraceCheckUtils]: 65: Hoare triple {72699#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {72699#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:37:50,099 INFO L290 TraceCheckUtils]: 66: Hoare triple {72699#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {72699#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:37:50,099 INFO L290 TraceCheckUtils]: 67: Hoare triple {72699#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {72699#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:37:50,100 INFO L290 TraceCheckUtils]: 68: Hoare triple {72699#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {72699#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:37:50,100 INFO L290 TraceCheckUtils]: 69: Hoare triple {72699#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {72699#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:37:50,101 INFO L290 TraceCheckUtils]: 70: Hoare triple {72699#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {72699#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:37:50,101 INFO L290 TraceCheckUtils]: 71: Hoare triple {72699#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {72699#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:37:50,101 INFO L290 TraceCheckUtils]: 72: Hoare triple {72699#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {72699#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:37:50,101 INFO L290 TraceCheckUtils]: 73: Hoare triple {72699#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {72699#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:37:50,102 INFO L290 TraceCheckUtils]: 74: Hoare triple {72699#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {72699#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:37:50,102 INFO L290 TraceCheckUtils]: 75: Hoare triple {72699#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {72699#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:37:50,103 INFO L290 TraceCheckUtils]: 76: Hoare triple {72699#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {72700#(not (= 8576 |ssl3_accept_#t~mem69|))} is VALID [2022-04-28 15:37:50,104 INFO L290 TraceCheckUtils]: 77: Hoare triple {72700#(not (= 8576 |ssl3_accept_#t~mem69|))} assume 8576 == #t~mem69;havoc #t~mem69; {72695#false} is VALID [2022-04-28 15:37:50,104 INFO L290 TraceCheckUtils]: 78: Hoare triple {72695#false} assume -2147483648 <= #t~nondet134 && #t~nondet134 <= 2147483647;~ret~0 := #t~nondet134;havoc #t~nondet134; {72695#false} is VALID [2022-04-28 15:37:50,104 INFO L290 TraceCheckUtils]: 79: Hoare triple {72695#false} assume !(~ret~0 <= 0); {72695#false} is VALID [2022-04-28 15:37:50,104 INFO L290 TraceCheckUtils]: 80: Hoare triple {72695#false} assume 2 == ~ret~0;call write~int(8466, ~s.base, 72 + ~s.offset, 4); {72695#false} is VALID [2022-04-28 15:37:50,104 INFO L290 TraceCheckUtils]: 81: Hoare triple {72695#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {72695#false} is VALID [2022-04-28 15:37:50,104 INFO L290 TraceCheckUtils]: 82: Hoare triple {72695#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {72695#false} is VALID [2022-04-28 15:37:50,104 INFO L290 TraceCheckUtils]: 83: Hoare triple {72695#false} ~skip~0 := 0; {72695#false} is VALID [2022-04-28 15:37:50,104 INFO L290 TraceCheckUtils]: 84: Hoare triple {72695#false} assume !false; {72695#false} is VALID [2022-04-28 15:37:50,104 INFO L290 TraceCheckUtils]: 85: Hoare triple {72695#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {72695#false} is VALID [2022-04-28 15:37:50,104 INFO L290 TraceCheckUtils]: 86: Hoare triple {72695#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {72695#false} is VALID [2022-04-28 15:37:50,104 INFO L290 TraceCheckUtils]: 87: Hoare triple {72695#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {72695#false} is VALID [2022-04-28 15:37:50,105 INFO L290 TraceCheckUtils]: 88: Hoare triple {72695#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {72695#false} is VALID [2022-04-28 15:37:50,105 INFO L290 TraceCheckUtils]: 89: Hoare triple {72695#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {72695#false} is VALID [2022-04-28 15:37:50,105 INFO L290 TraceCheckUtils]: 90: Hoare triple {72695#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {72695#false} is VALID [2022-04-28 15:37:50,105 INFO L290 TraceCheckUtils]: 91: Hoare triple {72695#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {72695#false} is VALID [2022-04-28 15:37:50,105 INFO L290 TraceCheckUtils]: 92: Hoare triple {72695#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {72695#false} is VALID [2022-04-28 15:37:50,105 INFO L290 TraceCheckUtils]: 93: Hoare triple {72695#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {72695#false} is VALID [2022-04-28 15:37:50,105 INFO L290 TraceCheckUtils]: 94: Hoare triple {72695#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {72695#false} is VALID [2022-04-28 15:37:50,105 INFO L290 TraceCheckUtils]: 95: Hoare triple {72695#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {72695#false} is VALID [2022-04-28 15:37:50,105 INFO L290 TraceCheckUtils]: 96: Hoare triple {72695#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {72695#false} is VALID [2022-04-28 15:37:50,105 INFO L290 TraceCheckUtils]: 97: Hoare triple {72695#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {72695#false} is VALID [2022-04-28 15:37:50,105 INFO L290 TraceCheckUtils]: 98: Hoare triple {72695#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {72695#false} is VALID [2022-04-28 15:37:50,105 INFO L290 TraceCheckUtils]: 99: Hoare triple {72695#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {72695#false} is VALID [2022-04-28 15:37:50,105 INFO L290 TraceCheckUtils]: 100: Hoare triple {72695#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {72695#false} is VALID [2022-04-28 15:37:50,105 INFO L290 TraceCheckUtils]: 101: Hoare triple {72695#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {72695#false} is VALID [2022-04-28 15:37:50,106 INFO L290 TraceCheckUtils]: 102: Hoare triple {72695#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {72695#false} is VALID [2022-04-28 15:37:50,106 INFO L290 TraceCheckUtils]: 103: Hoare triple {72695#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {72695#false} is VALID [2022-04-28 15:37:50,106 INFO L290 TraceCheckUtils]: 104: Hoare triple {72695#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {72695#false} is VALID [2022-04-28 15:37:50,106 INFO L290 TraceCheckUtils]: 105: Hoare triple {72695#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {72695#false} is VALID [2022-04-28 15:37:50,106 INFO L290 TraceCheckUtils]: 106: Hoare triple {72695#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {72695#false} is VALID [2022-04-28 15:37:50,106 INFO L290 TraceCheckUtils]: 107: Hoare triple {72695#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {72695#false} is VALID [2022-04-28 15:37:50,106 INFO L290 TraceCheckUtils]: 108: Hoare triple {72695#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {72695#false} is VALID [2022-04-28 15:37:50,106 INFO L290 TraceCheckUtils]: 109: Hoare triple {72695#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {72695#false} is VALID [2022-04-28 15:37:50,106 INFO L290 TraceCheckUtils]: 110: Hoare triple {72695#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {72695#false} is VALID [2022-04-28 15:37:50,106 INFO L290 TraceCheckUtils]: 111: Hoare triple {72695#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {72695#false} is VALID [2022-04-28 15:37:50,106 INFO L290 TraceCheckUtils]: 112: Hoare triple {72695#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {72695#false} is VALID [2022-04-28 15:37:50,106 INFO L290 TraceCheckUtils]: 113: Hoare triple {72695#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {72695#false} is VALID [2022-04-28 15:37:50,106 INFO L290 TraceCheckUtils]: 114: Hoare triple {72695#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {72695#false} is VALID [2022-04-28 15:37:50,106 INFO L290 TraceCheckUtils]: 115: Hoare triple {72695#false} assume 8641 == #t~mem76;havoc #t~mem76; {72695#false} is VALID [2022-04-28 15:37:50,106 INFO L290 TraceCheckUtils]: 116: Hoare triple {72695#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {72695#false} is VALID [2022-04-28 15:37:50,107 INFO L290 TraceCheckUtils]: 117: Hoare triple {72695#false} assume !(4 == ~blastFlag~0); {72695#false} is VALID [2022-04-28 15:37:50,107 INFO L290 TraceCheckUtils]: 118: Hoare triple {72695#false} assume !(7 == ~blastFlag~0); {72695#false} is VALID [2022-04-28 15:37:50,107 INFO L290 TraceCheckUtils]: 119: Hoare triple {72695#false} assume !(10 == ~blastFlag~0); {72695#false} is VALID [2022-04-28 15:37:50,107 INFO L290 TraceCheckUtils]: 120: Hoare triple {72695#false} assume !false; {72695#false} is VALID [2022-04-28 15:37:50,107 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 15:37:50,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:37:50,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732476503] [2022-04-28 15:37:50,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732476503] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:37:50,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:37:50,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:37:50,108 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:37:50,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [700146440] [2022-04-28 15:37:50,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [700146440] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:37:50,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:37:50,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:37:50,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626661717] [2022-04-28 15:37:50,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:37:50,108 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-28 15:37:50,108 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:37:50,109 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-28 15:37:50,163 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-28 15:37:50,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:37:50,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:37:50,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:37:50,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:37:50,164 INFO L87 Difference]: Start difference. First operand 478 states and 700 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-28 15:37:53,044 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:37:56,645 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:38:03,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:38:03,608 INFO L93 Difference]: Finished difference Result 1046 states and 1547 transitions. [2022-04-28 15:38:03,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:38:03,608 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-28 15:38:03,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:38:03,609 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-28 15:38:03,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 587 transitions. [2022-04-28 15:38:03,611 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-28 15:38:03,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 587 transitions. [2022-04-28 15:38:03,613 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 587 transitions. [2022-04-28 15:38:03,993 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-28 15:38:04,007 INFO L225 Difference]: With dead ends: 1046 [2022-04-28 15:38:04,007 INFO L226 Difference]: Without dead ends: 594 [2022-04-28 15:38:04,008 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-28 15:38:04,008 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 117 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-04-28 15:38:04,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 384 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2022-04-28 15:38:04,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2022-04-28 15:38:04,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 514. [2022-04-28 15:38:04,029 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:38:04,030 INFO L82 GeneralOperation]: Start isEquivalent. First operand 594 states. Second operand has 514 states, 509 states have (on average 1.4715127701375246) internal successors, (749), 509 states have internal predecessors, (749), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:38:04,030 INFO L74 IsIncluded]: Start isIncluded. First operand 594 states. Second operand has 514 states, 509 states have (on average 1.4715127701375246) internal successors, (749), 509 states have internal predecessors, (749), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:38:04,031 INFO L87 Difference]: Start difference. First operand 594 states. Second operand has 514 states, 509 states have (on average 1.4715127701375246) internal successors, (749), 509 states have internal predecessors, (749), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:38:04,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:38:04,041 INFO L93 Difference]: Finished difference Result 594 states and 874 transitions. [2022-04-28 15:38:04,041 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 874 transitions. [2022-04-28 15:38:04,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:38:04,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:38:04,041 INFO L74 IsIncluded]: Start isIncluded. First operand has 514 states, 509 states have (on average 1.4715127701375246) internal successors, (749), 509 states have internal predecessors, (749), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 594 states. [2022-04-28 15:38:04,042 INFO L87 Difference]: Start difference. First operand has 514 states, 509 states have (on average 1.4715127701375246) internal successors, (749), 509 states have internal predecessors, (749), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 594 states. [2022-04-28 15:38:04,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:38:04,052 INFO L93 Difference]: Finished difference Result 594 states and 874 transitions. [2022-04-28 15:38:04,052 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 874 transitions. [2022-04-28 15:38:04,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:38:04,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:38:04,052 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:38:04,052 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:38:04,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 509 states have (on average 1.4715127701375246) internal successors, (749), 509 states have internal predecessors, (749), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:38:04,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 753 transitions. [2022-04-28 15:38:04,063 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 753 transitions. Word has length 121 [2022-04-28 15:38:04,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:38:04,063 INFO L495 AbstractCegarLoop]: Abstraction has 514 states and 753 transitions. [2022-04-28 15:38:04,064 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-28 15:38:04,064 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 514 states and 753 transitions. [2022-04-28 15:38:04,683 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 753 edges. 753 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:38:04,684 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 753 transitions. [2022-04-28 15:38:04,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-04-28 15:38:04,684 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:38:04,685 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 15:38:04,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-04-28 15:38:04,685 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:38:04,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:38:04,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1771029188, now seen corresponding path program 1 times [2022-04-28 15:38:04,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:38:04,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1965690239] [2022-04-28 15:38:04,763 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:38:04,763 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:38:04,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1771029188, now seen corresponding path program 2 times [2022-04-28 15:38:04,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:38:04,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261241507] [2022-04-28 15:38:04,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:38:04,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:38:04,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:38:04,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:38:04,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:38:04,867 INFO L290 TraceCheckUtils]: 0: Hoare triple {77021#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {77014#true} is VALID [2022-04-28 15:38:04,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {77014#true} assume true; {77014#true} is VALID [2022-04-28 15:38:04,867 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {77014#true} {77014#true} #703#return; {77014#true} is VALID [2022-04-28 15:38:04,868 INFO L272 TraceCheckUtils]: 0: Hoare triple {77014#true} call ULTIMATE.init(); {77021#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-28 15:38:04,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {77021#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {77014#true} is VALID [2022-04-28 15:38:04,868 INFO L290 TraceCheckUtils]: 2: Hoare triple {77014#true} assume true; {77014#true} is VALID [2022-04-28 15:38:04,868 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {77014#true} {77014#true} #703#return; {77014#true} is VALID [2022-04-28 15:38:04,868 INFO L272 TraceCheckUtils]: 4: Hoare triple {77014#true} call #t~ret161 := main(); {77014#true} is VALID [2022-04-28 15:38:04,868 INFO L290 TraceCheckUtils]: 5: Hoare triple {77014#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {77014#true} is VALID [2022-04-28 15:38:04,868 INFO L290 TraceCheckUtils]: 6: Hoare triple {77014#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {77014#true} is VALID [2022-04-28 15:38:04,868 INFO L272 TraceCheckUtils]: 7: Hoare triple {77014#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {77014#true} is VALID [2022-04-28 15:38:04,868 INFO L290 TraceCheckUtils]: 8: Hoare triple {77014#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {77014#true} is VALID [2022-04-28 15:38:04,868 INFO L290 TraceCheckUtils]: 9: Hoare triple {77014#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {77014#true} is VALID [2022-04-28 15:38:04,868 INFO L290 TraceCheckUtils]: 10: Hoare triple {77014#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {77014#true} is VALID [2022-04-28 15:38:04,868 INFO L290 TraceCheckUtils]: 11: Hoare triple {77014#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {77014#true} is VALID [2022-04-28 15:38:04,868 INFO L290 TraceCheckUtils]: 12: Hoare triple {77014#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {77014#true} is VALID [2022-04-28 15:38:04,869 INFO L290 TraceCheckUtils]: 13: Hoare triple {77014#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {77014#true} is VALID [2022-04-28 15:38:04,869 INFO L290 TraceCheckUtils]: 14: Hoare triple {77014#true} assume !false; {77014#true} is VALID [2022-04-28 15:38:04,869 INFO L290 TraceCheckUtils]: 15: Hoare triple {77014#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {77014#true} is VALID [2022-04-28 15:38:04,869 INFO L290 TraceCheckUtils]: 16: Hoare triple {77014#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {77014#true} is VALID [2022-04-28 15:38:04,869 INFO L290 TraceCheckUtils]: 17: Hoare triple {77014#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {77014#true} is VALID [2022-04-28 15:38:04,869 INFO L290 TraceCheckUtils]: 18: Hoare triple {77014#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {77014#true} is VALID [2022-04-28 15:38:04,869 INFO L290 TraceCheckUtils]: 19: Hoare triple {77014#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {77014#true} is VALID [2022-04-28 15:38:04,869 INFO L290 TraceCheckUtils]: 20: Hoare triple {77014#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {77014#true} is VALID [2022-04-28 15:38:04,869 INFO L290 TraceCheckUtils]: 21: Hoare triple {77014#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {77014#true} is VALID [2022-04-28 15:38:04,869 INFO L290 TraceCheckUtils]: 22: Hoare triple {77014#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {77014#true} is VALID [2022-04-28 15:38:04,869 INFO L290 TraceCheckUtils]: 23: Hoare triple {77014#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {77014#true} is VALID [2022-04-28 15:38:04,869 INFO L290 TraceCheckUtils]: 24: Hoare triple {77014#true} assume 8464 == #t~mem55;havoc #t~mem55; {77014#true} is VALID [2022-04-28 15:38:04,869 INFO L290 TraceCheckUtils]: 25: Hoare triple {77014#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {77014#true} is VALID [2022-04-28 15:38:04,869 INFO L290 TraceCheckUtils]: 26: Hoare triple {77014#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {77014#true} is VALID [2022-04-28 15:38:04,870 INFO L290 TraceCheckUtils]: 27: Hoare triple {77014#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {77014#true} is VALID [2022-04-28 15:38:04,870 INFO L290 TraceCheckUtils]: 28: Hoare triple {77014#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {77014#true} is VALID [2022-04-28 15:38:04,870 INFO L290 TraceCheckUtils]: 29: Hoare triple {77014#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {77014#true} is VALID [2022-04-28 15:38:04,870 INFO L290 TraceCheckUtils]: 30: Hoare triple {77014#true} ~skip~0 := 0; {77014#true} is VALID [2022-04-28 15:38:04,870 INFO L290 TraceCheckUtils]: 31: Hoare triple {77014#true} assume !false; {77014#true} is VALID [2022-04-28 15:38:04,870 INFO L290 TraceCheckUtils]: 32: Hoare triple {77014#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {77014#true} is VALID [2022-04-28 15:38:04,870 INFO L290 TraceCheckUtils]: 33: Hoare triple {77014#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {77014#true} is VALID [2022-04-28 15:38:04,870 INFO L290 TraceCheckUtils]: 34: Hoare triple {77014#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {77014#true} is VALID [2022-04-28 15:38:04,870 INFO L290 TraceCheckUtils]: 35: Hoare triple {77014#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {77014#true} is VALID [2022-04-28 15:38:04,870 INFO L290 TraceCheckUtils]: 36: Hoare triple {77014#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {77014#true} is VALID [2022-04-28 15:38:04,870 INFO L290 TraceCheckUtils]: 37: Hoare triple {77014#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {77014#true} is VALID [2022-04-28 15:38:04,870 INFO L290 TraceCheckUtils]: 38: Hoare triple {77014#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {77014#true} is VALID [2022-04-28 15:38:04,870 INFO L290 TraceCheckUtils]: 39: Hoare triple {77014#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {77014#true} is VALID [2022-04-28 15:38:04,870 INFO L290 TraceCheckUtils]: 40: Hoare triple {77014#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {77014#true} is VALID [2022-04-28 15:38:04,870 INFO L290 TraceCheckUtils]: 41: Hoare triple {77014#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {77014#true} is VALID [2022-04-28 15:38:04,871 INFO L290 TraceCheckUtils]: 42: Hoare triple {77014#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {77014#true} is VALID [2022-04-28 15:38:04,871 INFO L290 TraceCheckUtils]: 43: Hoare triple {77014#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {77014#true} is VALID [2022-04-28 15:38:04,871 INFO L290 TraceCheckUtils]: 44: Hoare triple {77014#true} assume 8496 == #t~mem58;havoc #t~mem58; {77014#true} is VALID [2022-04-28 15:38:04,871 INFO L290 TraceCheckUtils]: 45: Hoare triple {77014#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {77014#true} is VALID [2022-04-28 15:38:04,871 INFO L290 TraceCheckUtils]: 46: Hoare triple {77014#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {77014#true} is VALID [2022-04-28 15:38:04,871 INFO L290 TraceCheckUtils]: 47: Hoare triple {77014#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {77014#true} is VALID [2022-04-28 15:38:04,871 INFO L290 TraceCheckUtils]: 48: Hoare triple {77014#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {77019#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:38:04,872 INFO L290 TraceCheckUtils]: 49: Hoare triple {77019#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {77019#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:38:04,872 INFO L290 TraceCheckUtils]: 50: Hoare triple {77019#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {77019#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:38:04,878 INFO L290 TraceCheckUtils]: 51: Hoare triple {77019#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {77019#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:38:04,879 INFO L290 TraceCheckUtils]: 52: Hoare triple {77019#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} ~skip~0 := 0; {77019#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:38:04,879 INFO L290 TraceCheckUtils]: 53: Hoare triple {77019#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {77019#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:38:04,879 INFO L290 TraceCheckUtils]: 54: Hoare triple {77019#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {77019#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:38:04,880 INFO L290 TraceCheckUtils]: 55: Hoare triple {77019#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {77019#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:38:04,880 INFO L290 TraceCheckUtils]: 56: Hoare triple {77019#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {77019#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:38:04,880 INFO L290 TraceCheckUtils]: 57: Hoare triple {77019#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {77019#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:38:04,881 INFO L290 TraceCheckUtils]: 58: Hoare triple {77019#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {77019#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:38:04,881 INFO L290 TraceCheckUtils]: 59: Hoare triple {77019#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {77019#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:38:04,881 INFO L290 TraceCheckUtils]: 60: Hoare triple {77019#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {77019#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:38:04,882 INFO L290 TraceCheckUtils]: 61: Hoare triple {77019#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {77019#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:38:04,882 INFO L290 TraceCheckUtils]: 62: Hoare triple {77019#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {77019#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:38:04,882 INFO L290 TraceCheckUtils]: 63: Hoare triple {77019#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {77019#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:38:04,883 INFO L290 TraceCheckUtils]: 64: Hoare triple {77019#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {77019#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:38:04,883 INFO L290 TraceCheckUtils]: 65: Hoare triple {77019#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {77019#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:38:04,883 INFO L290 TraceCheckUtils]: 66: Hoare triple {77019#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {77019#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:38:04,884 INFO L290 TraceCheckUtils]: 67: Hoare triple {77019#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {77019#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:38:04,884 INFO L290 TraceCheckUtils]: 68: Hoare triple {77019#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {77019#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:38:04,884 INFO L290 TraceCheckUtils]: 69: Hoare triple {77019#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {77019#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:38:04,885 INFO L290 TraceCheckUtils]: 70: Hoare triple {77019#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {77019#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:38:04,885 INFO L290 TraceCheckUtils]: 71: Hoare triple {77019#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {77019#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:38:04,885 INFO L290 TraceCheckUtils]: 72: Hoare triple {77019#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {77019#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:38:04,886 INFO L290 TraceCheckUtils]: 73: Hoare triple {77019#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {77019#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:38:04,886 INFO L290 TraceCheckUtils]: 74: Hoare triple {77019#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {77019#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:38:04,886 INFO L290 TraceCheckUtils]: 75: Hoare triple {77019#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {77019#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:38:04,887 INFO L290 TraceCheckUtils]: 76: Hoare triple {77019#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {77019#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:38:04,887 INFO L290 TraceCheckUtils]: 77: Hoare triple {77019#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {77020#(not (= |ssl3_accept_#t~mem70| 8577))} is VALID [2022-04-28 15:38:04,898 INFO L290 TraceCheckUtils]: 78: Hoare triple {77020#(not (= |ssl3_accept_#t~mem70| 8577))} assume 8577 == #t~mem70;havoc #t~mem70; {77015#false} is VALID [2022-04-28 15:38:04,898 INFO L290 TraceCheckUtils]: 79: Hoare triple {77015#false} assume -2147483648 <= #t~nondet134 && #t~nondet134 <= 2147483647;~ret~0 := #t~nondet134;havoc #t~nondet134; {77015#false} is VALID [2022-04-28 15:38:04,898 INFO L290 TraceCheckUtils]: 80: Hoare triple {77015#false} assume !(~ret~0 <= 0); {77015#false} is VALID [2022-04-28 15:38:04,898 INFO L290 TraceCheckUtils]: 81: Hoare triple {77015#false} assume 2 == ~ret~0;call write~int(8466, ~s.base, 72 + ~s.offset, 4); {77015#false} is VALID [2022-04-28 15:38:04,898 INFO L290 TraceCheckUtils]: 82: Hoare triple {77015#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {77015#false} is VALID [2022-04-28 15:38:04,898 INFO L290 TraceCheckUtils]: 83: Hoare triple {77015#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {77015#false} is VALID [2022-04-28 15:38:04,899 INFO L290 TraceCheckUtils]: 84: Hoare triple {77015#false} ~skip~0 := 0; {77015#false} is VALID [2022-04-28 15:38:04,899 INFO L290 TraceCheckUtils]: 85: Hoare triple {77015#false} assume !false; {77015#false} is VALID [2022-04-28 15:38:04,899 INFO L290 TraceCheckUtils]: 86: Hoare triple {77015#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {77015#false} is VALID [2022-04-28 15:38:04,899 INFO L290 TraceCheckUtils]: 87: Hoare triple {77015#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {77015#false} is VALID [2022-04-28 15:38:04,899 INFO L290 TraceCheckUtils]: 88: Hoare triple {77015#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {77015#false} is VALID [2022-04-28 15:38:04,899 INFO L290 TraceCheckUtils]: 89: Hoare triple {77015#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {77015#false} is VALID [2022-04-28 15:38:04,899 INFO L290 TraceCheckUtils]: 90: Hoare triple {77015#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {77015#false} is VALID [2022-04-28 15:38:04,899 INFO L290 TraceCheckUtils]: 91: Hoare triple {77015#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {77015#false} is VALID [2022-04-28 15:38:04,899 INFO L290 TraceCheckUtils]: 92: Hoare triple {77015#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {77015#false} is VALID [2022-04-28 15:38:04,899 INFO L290 TraceCheckUtils]: 93: Hoare triple {77015#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {77015#false} is VALID [2022-04-28 15:38:04,899 INFO L290 TraceCheckUtils]: 94: Hoare triple {77015#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {77015#false} is VALID [2022-04-28 15:38:04,899 INFO L290 TraceCheckUtils]: 95: Hoare triple {77015#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {77015#false} is VALID [2022-04-28 15:38:04,899 INFO L290 TraceCheckUtils]: 96: Hoare triple {77015#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {77015#false} is VALID [2022-04-28 15:38:04,899 INFO L290 TraceCheckUtils]: 97: Hoare triple {77015#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {77015#false} is VALID [2022-04-28 15:38:04,900 INFO L290 TraceCheckUtils]: 98: Hoare triple {77015#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {77015#false} is VALID [2022-04-28 15:38:04,900 INFO L290 TraceCheckUtils]: 99: Hoare triple {77015#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {77015#false} is VALID [2022-04-28 15:38:04,900 INFO L290 TraceCheckUtils]: 100: Hoare triple {77015#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {77015#false} is VALID [2022-04-28 15:38:04,900 INFO L290 TraceCheckUtils]: 101: Hoare triple {77015#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {77015#false} is VALID [2022-04-28 15:38:04,900 INFO L290 TraceCheckUtils]: 102: Hoare triple {77015#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {77015#false} is VALID [2022-04-28 15:38:04,900 INFO L290 TraceCheckUtils]: 103: Hoare triple {77015#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {77015#false} is VALID [2022-04-28 15:38:04,900 INFO L290 TraceCheckUtils]: 104: Hoare triple {77015#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {77015#false} is VALID [2022-04-28 15:38:04,900 INFO L290 TraceCheckUtils]: 105: Hoare triple {77015#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {77015#false} is VALID [2022-04-28 15:38:04,900 INFO L290 TraceCheckUtils]: 106: Hoare triple {77015#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {77015#false} is VALID [2022-04-28 15:38:04,900 INFO L290 TraceCheckUtils]: 107: Hoare triple {77015#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {77015#false} is VALID [2022-04-28 15:38:04,900 INFO L290 TraceCheckUtils]: 108: Hoare triple {77015#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {77015#false} is VALID [2022-04-28 15:38:04,900 INFO L290 TraceCheckUtils]: 109: Hoare triple {77015#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {77015#false} is VALID [2022-04-28 15:38:04,900 INFO L290 TraceCheckUtils]: 110: Hoare triple {77015#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {77015#false} is VALID [2022-04-28 15:38:04,900 INFO L290 TraceCheckUtils]: 111: Hoare triple {77015#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {77015#false} is VALID [2022-04-28 15:38:04,900 INFO L290 TraceCheckUtils]: 112: Hoare triple {77015#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {77015#false} is VALID [2022-04-28 15:38:04,901 INFO L290 TraceCheckUtils]: 113: Hoare triple {77015#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {77015#false} is VALID [2022-04-28 15:38:04,901 INFO L290 TraceCheckUtils]: 114: Hoare triple {77015#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {77015#false} is VALID [2022-04-28 15:38:04,901 INFO L290 TraceCheckUtils]: 115: Hoare triple {77015#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {77015#false} is VALID [2022-04-28 15:38:04,901 INFO L290 TraceCheckUtils]: 116: Hoare triple {77015#false} assume 8641 == #t~mem76;havoc #t~mem76; {77015#false} is VALID [2022-04-28 15:38:04,901 INFO L290 TraceCheckUtils]: 117: Hoare triple {77015#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {77015#false} is VALID [2022-04-28 15:38:04,901 INFO L290 TraceCheckUtils]: 118: Hoare triple {77015#false} assume !(4 == ~blastFlag~0); {77015#false} is VALID [2022-04-28 15:38:04,901 INFO L290 TraceCheckUtils]: 119: Hoare triple {77015#false} assume !(7 == ~blastFlag~0); {77015#false} is VALID [2022-04-28 15:38:04,901 INFO L290 TraceCheckUtils]: 120: Hoare triple {77015#false} assume !(10 == ~blastFlag~0); {77015#false} is VALID [2022-04-28 15:38:04,901 INFO L290 TraceCheckUtils]: 121: Hoare triple {77015#false} assume !false; {77015#false} is VALID [2022-04-28 15:38:04,901 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 15:38:04,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:38:04,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261241507] [2022-04-28 15:38:04,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261241507] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:38:04,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:38:04,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:38:04,902 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:38:04,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1965690239] [2022-04-28 15:38:04,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1965690239] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:38:04,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:38:04,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:38:04,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436227276] [2022-04-28 15:38:04,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:38:04,903 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-28 15:38:04,903 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:38:04,903 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-28 15:38:04,993 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-28 15:38:04,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:38:04,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:38:04,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:38:04,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:38:04,994 INFO L87 Difference]: Start difference. First operand 514 states and 753 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-28 15:38:06,751 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:38:09,509 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:38:14,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:38:14,717 INFO L93 Difference]: Finished difference Result 1076 states and 1586 transitions. [2022-04-28 15:38:14,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:38:14,717 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-28 15:38:14,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:38:14,718 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-28 15:38:14,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 587 transitions. [2022-04-28 15:38:14,720 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-28 15:38:14,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 587 transitions. [2022-04-28 15:38:14,723 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 587 transitions. [2022-04-28 15:38:15,100 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-28 15:38:15,113 INFO L225 Difference]: With dead ends: 1076 [2022-04-28 15:38:15,113 INFO L226 Difference]: Without dead ends: 588 [2022-04-28 15:38:15,114 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-28 15:38:15,115 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 116 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-04-28 15:38:15,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 384 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-04-28 15:38:15,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2022-04-28 15:38:15,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 515. [2022-04-28 15:38:15,137 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:38:15,138 INFO L82 GeneralOperation]: Start isEquivalent. First operand 588 states. Second operand has 515 states, 510 states have (on average 1.4666666666666666) internal successors, (748), 510 states have internal predecessors, (748), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:38:15,138 INFO L74 IsIncluded]: Start isIncluded. First operand 588 states. Second operand has 515 states, 510 states have (on average 1.4666666666666666) internal successors, (748), 510 states have internal predecessors, (748), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:38:15,139 INFO L87 Difference]: Start difference. First operand 588 states. Second operand has 515 states, 510 states have (on average 1.4666666666666666) internal successors, (748), 510 states have internal predecessors, (748), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:38:15,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:38:15,148 INFO L93 Difference]: Finished difference Result 588 states and 860 transitions. [2022-04-28 15:38:15,148 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 860 transitions. [2022-04-28 15:38:15,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:38:15,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:38:15,149 INFO L74 IsIncluded]: Start isIncluded. First operand has 515 states, 510 states have (on average 1.4666666666666666) internal successors, (748), 510 states have internal predecessors, (748), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 588 states. [2022-04-28 15:38:15,150 INFO L87 Difference]: Start difference. First operand has 515 states, 510 states have (on average 1.4666666666666666) internal successors, (748), 510 states have internal predecessors, (748), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 588 states. [2022-04-28 15:38:15,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:38:15,159 INFO L93 Difference]: Finished difference Result 588 states and 860 transitions. [2022-04-28 15:38:15,160 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 860 transitions. [2022-04-28 15:38:15,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:38:15,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:38:15,160 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:38:15,160 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:38:15,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 510 states have (on average 1.4666666666666666) internal successors, (748), 510 states have internal predecessors, (748), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:38:15,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 752 transitions. [2022-04-28 15:38:15,182 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 752 transitions. Word has length 122 [2022-04-28 15:38:15,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:38:15,182 INFO L495 AbstractCegarLoop]: Abstraction has 515 states and 752 transitions. [2022-04-28 15:38:15,182 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-28 15:38:15,182 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 515 states and 752 transitions. [2022-04-28 15:38:15,828 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 752 edges. 752 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:38:15,828 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 752 transitions. [2022-04-28 15:38:15,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-04-28 15:38:15,829 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:38:15,829 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 15:38:15,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-04-28 15:38:15,829 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:38:15,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:38:15,830 INFO L85 PathProgramCache]: Analyzing trace with hash 304591187, now seen corresponding path program 1 times [2022-04-28 15:38:15,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:38:15,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1525649314] [2022-04-28 15:38:15,904 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:38:15,904 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:38:15,904 INFO L85 PathProgramCache]: Analyzing trace with hash 304591187, now seen corresponding path program 2 times [2022-04-28 15:38:15,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:38:15,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143801662] [2022-04-28 15:38:15,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:38:15,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:38:15,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:38:16,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:38:16,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:38:16,029 INFO L290 TraceCheckUtils]: 0: Hoare triple {81391#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {81384#true} is VALID [2022-04-28 15:38:16,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {81384#true} assume true; {81384#true} is VALID [2022-04-28 15:38:16,029 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {81384#true} {81384#true} #703#return; {81384#true} is VALID [2022-04-28 15:38:16,030 INFO L272 TraceCheckUtils]: 0: Hoare triple {81384#true} call ULTIMATE.init(); {81391#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-28 15:38:16,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {81391#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {81384#true} is VALID [2022-04-28 15:38:16,030 INFO L290 TraceCheckUtils]: 2: Hoare triple {81384#true} assume true; {81384#true} is VALID [2022-04-28 15:38:16,030 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {81384#true} {81384#true} #703#return; {81384#true} is VALID [2022-04-28 15:38:16,030 INFO L272 TraceCheckUtils]: 4: Hoare triple {81384#true} call #t~ret161 := main(); {81384#true} is VALID [2022-04-28 15:38:16,030 INFO L290 TraceCheckUtils]: 5: Hoare triple {81384#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {81384#true} is VALID [2022-04-28 15:38:16,030 INFO L290 TraceCheckUtils]: 6: Hoare triple {81384#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {81384#true} is VALID [2022-04-28 15:38:16,030 INFO L272 TraceCheckUtils]: 7: Hoare triple {81384#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {81384#true} is VALID [2022-04-28 15:38:16,030 INFO L290 TraceCheckUtils]: 8: Hoare triple {81384#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {81384#true} is VALID [2022-04-28 15:38:16,030 INFO L290 TraceCheckUtils]: 9: Hoare triple {81384#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {81384#true} is VALID [2022-04-28 15:38:16,030 INFO L290 TraceCheckUtils]: 10: Hoare triple {81384#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {81384#true} is VALID [2022-04-28 15:38:16,030 INFO L290 TraceCheckUtils]: 11: Hoare triple {81384#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {81384#true} is VALID [2022-04-28 15:38:16,030 INFO L290 TraceCheckUtils]: 12: Hoare triple {81384#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {81384#true} is VALID [2022-04-28 15:38:16,031 INFO L290 TraceCheckUtils]: 13: Hoare triple {81384#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {81384#true} is VALID [2022-04-28 15:38:16,031 INFO L290 TraceCheckUtils]: 14: Hoare triple {81384#true} assume !false; {81384#true} is VALID [2022-04-28 15:38:16,031 INFO L290 TraceCheckUtils]: 15: Hoare triple {81384#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {81384#true} is VALID [2022-04-28 15:38:16,031 INFO L290 TraceCheckUtils]: 16: Hoare triple {81384#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {81384#true} is VALID [2022-04-28 15:38:16,031 INFO L290 TraceCheckUtils]: 17: Hoare triple {81384#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {81384#true} is VALID [2022-04-28 15:38:16,031 INFO L290 TraceCheckUtils]: 18: Hoare triple {81384#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {81384#true} is VALID [2022-04-28 15:38:16,031 INFO L290 TraceCheckUtils]: 19: Hoare triple {81384#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {81384#true} is VALID [2022-04-28 15:38:16,031 INFO L290 TraceCheckUtils]: 20: Hoare triple {81384#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {81384#true} is VALID [2022-04-28 15:38:16,031 INFO L290 TraceCheckUtils]: 21: Hoare triple {81384#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {81384#true} is VALID [2022-04-28 15:38:16,031 INFO L290 TraceCheckUtils]: 22: Hoare triple {81384#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {81384#true} is VALID [2022-04-28 15:38:16,031 INFO L290 TraceCheckUtils]: 23: Hoare triple {81384#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {81384#true} is VALID [2022-04-28 15:38:16,031 INFO L290 TraceCheckUtils]: 24: Hoare triple {81384#true} assume 8464 == #t~mem55;havoc #t~mem55; {81384#true} is VALID [2022-04-28 15:38:16,031 INFO L290 TraceCheckUtils]: 25: Hoare triple {81384#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {81384#true} is VALID [2022-04-28 15:38:16,031 INFO L290 TraceCheckUtils]: 26: Hoare triple {81384#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {81384#true} is VALID [2022-04-28 15:38:16,032 INFO L290 TraceCheckUtils]: 27: Hoare triple {81384#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {81384#true} is VALID [2022-04-28 15:38:16,032 INFO L290 TraceCheckUtils]: 28: Hoare triple {81384#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {81384#true} is VALID [2022-04-28 15:38:16,032 INFO L290 TraceCheckUtils]: 29: Hoare triple {81384#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {81384#true} is VALID [2022-04-28 15:38:16,032 INFO L290 TraceCheckUtils]: 30: Hoare triple {81384#true} ~skip~0 := 0; {81384#true} is VALID [2022-04-28 15:38:16,032 INFO L290 TraceCheckUtils]: 31: Hoare triple {81384#true} assume !false; {81384#true} is VALID [2022-04-28 15:38:16,032 INFO L290 TraceCheckUtils]: 32: Hoare triple {81384#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {81384#true} is VALID [2022-04-28 15:38:16,032 INFO L290 TraceCheckUtils]: 33: Hoare triple {81384#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {81384#true} is VALID [2022-04-28 15:38:16,032 INFO L290 TraceCheckUtils]: 34: Hoare triple {81384#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {81384#true} is VALID [2022-04-28 15:38:16,032 INFO L290 TraceCheckUtils]: 35: Hoare triple {81384#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {81384#true} is VALID [2022-04-28 15:38:16,032 INFO L290 TraceCheckUtils]: 36: Hoare triple {81384#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {81384#true} is VALID [2022-04-28 15:38:16,032 INFO L290 TraceCheckUtils]: 37: Hoare triple {81384#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {81384#true} is VALID [2022-04-28 15:38:16,032 INFO L290 TraceCheckUtils]: 38: Hoare triple {81384#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {81384#true} is VALID [2022-04-28 15:38:16,032 INFO L290 TraceCheckUtils]: 39: Hoare triple {81384#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {81384#true} is VALID [2022-04-28 15:38:16,032 INFO L290 TraceCheckUtils]: 40: Hoare triple {81384#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {81384#true} is VALID [2022-04-28 15:38:16,032 INFO L290 TraceCheckUtils]: 41: Hoare triple {81384#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {81384#true} is VALID [2022-04-28 15:38:16,033 INFO L290 TraceCheckUtils]: 42: Hoare triple {81384#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {81384#true} is VALID [2022-04-28 15:38:16,033 INFO L290 TraceCheckUtils]: 43: Hoare triple {81384#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {81384#true} is VALID [2022-04-28 15:38:16,033 INFO L290 TraceCheckUtils]: 44: Hoare triple {81384#true} assume 8496 == #t~mem58;havoc #t~mem58; {81384#true} is VALID [2022-04-28 15:38:16,033 INFO L290 TraceCheckUtils]: 45: Hoare triple {81384#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {81384#true} is VALID [2022-04-28 15:38:16,033 INFO L290 TraceCheckUtils]: 46: Hoare triple {81384#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {81384#true} is VALID [2022-04-28 15:38:16,033 INFO L290 TraceCheckUtils]: 47: Hoare triple {81384#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {81384#true} is VALID [2022-04-28 15:38:16,034 INFO L290 TraceCheckUtils]: 48: Hoare triple {81384#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {81389#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8592))} is VALID [2022-04-28 15:38:16,034 INFO L290 TraceCheckUtils]: 49: Hoare triple {81389#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8592))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {81389#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8592))} is VALID [2022-04-28 15:38:16,035 INFO L290 TraceCheckUtils]: 50: Hoare triple {81389#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8592))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {81389#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8592))} is VALID [2022-04-28 15:38:16,035 INFO L290 TraceCheckUtils]: 51: Hoare triple {81389#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8592))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {81389#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8592))} is VALID [2022-04-28 15:38:16,035 INFO L290 TraceCheckUtils]: 52: Hoare triple {81389#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8592))} ~skip~0 := 0; {81389#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8592))} is VALID [2022-04-28 15:38:16,035 INFO L290 TraceCheckUtils]: 53: Hoare triple {81389#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8592))} assume !false; {81389#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8592))} is VALID [2022-04-28 15:38:16,036 INFO L290 TraceCheckUtils]: 54: Hoare triple {81389#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8592))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {81389#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8592))} is VALID [2022-04-28 15:38:16,036 INFO L290 TraceCheckUtils]: 55: Hoare triple {81389#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8592))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {81389#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8592))} is VALID [2022-04-28 15:38:16,036 INFO L290 TraceCheckUtils]: 56: Hoare triple {81389#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8592))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {81389#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8592))} is VALID [2022-04-28 15:38:16,037 INFO L290 TraceCheckUtils]: 57: Hoare triple {81389#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8592))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {81389#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8592))} is VALID [2022-04-28 15:38:16,037 INFO L290 TraceCheckUtils]: 58: Hoare triple {81389#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8592))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {81389#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8592))} is VALID [2022-04-28 15:38:16,037 INFO L290 TraceCheckUtils]: 59: Hoare triple {81389#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8592))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {81389#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8592))} is VALID [2022-04-28 15:38:16,038 INFO L290 TraceCheckUtils]: 60: Hoare triple {81389#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8592))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {81389#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8592))} is VALID [2022-04-28 15:38:16,038 INFO L290 TraceCheckUtils]: 61: Hoare triple {81389#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8592))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {81389#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8592))} is VALID [2022-04-28 15:38:16,038 INFO L290 TraceCheckUtils]: 62: Hoare triple {81389#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8592))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {81389#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8592))} is VALID [2022-04-28 15:38:16,039 INFO L290 TraceCheckUtils]: 63: Hoare triple {81389#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8592))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {81389#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8592))} is VALID [2022-04-28 15:38:16,039 INFO L290 TraceCheckUtils]: 64: Hoare triple {81389#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8592))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {81389#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8592))} is VALID [2022-04-28 15:38:16,039 INFO L290 TraceCheckUtils]: 65: Hoare triple {81389#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8592))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {81389#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8592))} is VALID [2022-04-28 15:38:16,040 INFO L290 TraceCheckUtils]: 66: Hoare triple {81389#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8592))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {81389#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8592))} is VALID [2022-04-28 15:38:16,040 INFO L290 TraceCheckUtils]: 67: Hoare triple {81389#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8592))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {81389#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8592))} is VALID [2022-04-28 15:38:16,040 INFO L290 TraceCheckUtils]: 68: Hoare triple {81389#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8592))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {81389#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8592))} is VALID [2022-04-28 15:38:16,041 INFO L290 TraceCheckUtils]: 69: Hoare triple {81389#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8592))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {81389#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8592))} is VALID [2022-04-28 15:38:16,041 INFO L290 TraceCheckUtils]: 70: Hoare triple {81389#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8592))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {81389#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8592))} is VALID [2022-04-28 15:38:16,041 INFO L290 TraceCheckUtils]: 71: Hoare triple {81389#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8592))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {81389#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8592))} is VALID [2022-04-28 15:38:16,042 INFO L290 TraceCheckUtils]: 72: Hoare triple {81389#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8592))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {81389#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8592))} is VALID [2022-04-28 15:38:16,042 INFO L290 TraceCheckUtils]: 73: Hoare triple {81389#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8592))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {81389#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8592))} is VALID [2022-04-28 15:38:16,042 INFO L290 TraceCheckUtils]: 74: Hoare triple {81389#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8592))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {81389#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8592))} is VALID [2022-04-28 15:38:16,043 INFO L290 TraceCheckUtils]: 75: Hoare triple {81389#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8592))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {81389#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8592))} is VALID [2022-04-28 15:38:16,043 INFO L290 TraceCheckUtils]: 76: Hoare triple {81389#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8592))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {81389#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8592))} is VALID [2022-04-28 15:38:16,043 INFO L290 TraceCheckUtils]: 77: Hoare triple {81389#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8592))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {81389#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8592))} is VALID [2022-04-28 15:38:16,044 INFO L290 TraceCheckUtils]: 78: Hoare triple {81389#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8592))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {81390#(not (= |ssl3_accept_#t~mem71| 8592))} is VALID [2022-04-28 15:38:16,044 INFO L290 TraceCheckUtils]: 79: Hoare triple {81390#(not (= |ssl3_accept_#t~mem71| 8592))} assume 8592 == #t~mem71;havoc #t~mem71; {81385#false} is VALID [2022-04-28 15:38:16,044 INFO L290 TraceCheckUtils]: 80: Hoare triple {81385#false} assume -2147483648 <= #t~nondet136 && #t~nondet136 <= 2147483647;~ret~0 := #t~nondet136;havoc #t~nondet136; {81385#false} is VALID [2022-04-28 15:38:16,044 INFO L290 TraceCheckUtils]: 81: Hoare triple {81385#false} assume !(~ret~0 <= 0);call write~int(8608, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {81385#false} is VALID [2022-04-28 15:38:16,044 INFO L290 TraceCheckUtils]: 82: Hoare triple {81385#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {81385#false} is VALID [2022-04-28 15:38:16,044 INFO L290 TraceCheckUtils]: 83: Hoare triple {81385#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {81385#false} is VALID [2022-04-28 15:38:16,044 INFO L290 TraceCheckUtils]: 84: Hoare triple {81385#false} ~skip~0 := 0; {81385#false} is VALID [2022-04-28 15:38:16,045 INFO L290 TraceCheckUtils]: 85: Hoare triple {81385#false} assume !false; {81385#false} is VALID [2022-04-28 15:38:16,045 INFO L290 TraceCheckUtils]: 86: Hoare triple {81385#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {81385#false} is VALID [2022-04-28 15:38:16,045 INFO L290 TraceCheckUtils]: 87: Hoare triple {81385#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {81385#false} is VALID [2022-04-28 15:38:16,045 INFO L290 TraceCheckUtils]: 88: Hoare triple {81385#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {81385#false} is VALID [2022-04-28 15:38:16,045 INFO L290 TraceCheckUtils]: 89: Hoare triple {81385#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {81385#false} is VALID [2022-04-28 15:38:16,045 INFO L290 TraceCheckUtils]: 90: Hoare triple {81385#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {81385#false} is VALID [2022-04-28 15:38:16,045 INFO L290 TraceCheckUtils]: 91: Hoare triple {81385#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {81385#false} is VALID [2022-04-28 15:38:16,045 INFO L290 TraceCheckUtils]: 92: Hoare triple {81385#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {81385#false} is VALID [2022-04-28 15:38:16,045 INFO L290 TraceCheckUtils]: 93: Hoare triple {81385#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {81385#false} is VALID [2022-04-28 15:38:16,045 INFO L290 TraceCheckUtils]: 94: Hoare triple {81385#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {81385#false} is VALID [2022-04-28 15:38:16,045 INFO L290 TraceCheckUtils]: 95: Hoare triple {81385#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {81385#false} is VALID [2022-04-28 15:38:16,045 INFO L290 TraceCheckUtils]: 96: Hoare triple {81385#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {81385#false} is VALID [2022-04-28 15:38:16,045 INFO L290 TraceCheckUtils]: 97: Hoare triple {81385#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {81385#false} is VALID [2022-04-28 15:38:16,045 INFO L290 TraceCheckUtils]: 98: Hoare triple {81385#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {81385#false} is VALID [2022-04-28 15:38:16,045 INFO L290 TraceCheckUtils]: 99: Hoare triple {81385#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {81385#false} is VALID [2022-04-28 15:38:16,046 INFO L290 TraceCheckUtils]: 100: Hoare triple {81385#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {81385#false} is VALID [2022-04-28 15:38:16,046 INFO L290 TraceCheckUtils]: 101: Hoare triple {81385#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {81385#false} is VALID [2022-04-28 15:38:16,046 INFO L290 TraceCheckUtils]: 102: Hoare triple {81385#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {81385#false} is VALID [2022-04-28 15:38:16,046 INFO L290 TraceCheckUtils]: 103: Hoare triple {81385#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {81385#false} is VALID [2022-04-28 15:38:16,046 INFO L290 TraceCheckUtils]: 104: Hoare triple {81385#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {81385#false} is VALID [2022-04-28 15:38:16,046 INFO L290 TraceCheckUtils]: 105: Hoare triple {81385#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {81385#false} is VALID [2022-04-28 15:38:16,046 INFO L290 TraceCheckUtils]: 106: Hoare triple {81385#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {81385#false} is VALID [2022-04-28 15:38:16,046 INFO L290 TraceCheckUtils]: 107: Hoare triple {81385#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {81385#false} is VALID [2022-04-28 15:38:16,046 INFO L290 TraceCheckUtils]: 108: Hoare triple {81385#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {81385#false} is VALID [2022-04-28 15:38:16,046 INFO L290 TraceCheckUtils]: 109: Hoare triple {81385#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {81385#false} is VALID [2022-04-28 15:38:16,046 INFO L290 TraceCheckUtils]: 110: Hoare triple {81385#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {81385#false} is VALID [2022-04-28 15:38:16,046 INFO L290 TraceCheckUtils]: 111: Hoare triple {81385#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {81385#false} is VALID [2022-04-28 15:38:16,046 INFO L290 TraceCheckUtils]: 112: Hoare triple {81385#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {81385#false} is VALID [2022-04-28 15:38:16,046 INFO L290 TraceCheckUtils]: 113: Hoare triple {81385#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {81385#false} is VALID [2022-04-28 15:38:16,046 INFO L290 TraceCheckUtils]: 114: Hoare triple {81385#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {81385#false} is VALID [2022-04-28 15:38:16,047 INFO L290 TraceCheckUtils]: 115: Hoare triple {81385#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {81385#false} is VALID [2022-04-28 15:38:16,047 INFO L290 TraceCheckUtils]: 116: Hoare triple {81385#false} assume 8641 == #t~mem76;havoc #t~mem76; {81385#false} is VALID [2022-04-28 15:38:16,047 INFO L290 TraceCheckUtils]: 117: Hoare triple {81385#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {81385#false} is VALID [2022-04-28 15:38:16,047 INFO L290 TraceCheckUtils]: 118: Hoare triple {81385#false} assume !(4 == ~blastFlag~0); {81385#false} is VALID [2022-04-28 15:38:16,047 INFO L290 TraceCheckUtils]: 119: Hoare triple {81385#false} assume !(7 == ~blastFlag~0); {81385#false} is VALID [2022-04-28 15:38:16,047 INFO L290 TraceCheckUtils]: 120: Hoare triple {81385#false} assume !(10 == ~blastFlag~0); {81385#false} is VALID [2022-04-28 15:38:16,047 INFO L290 TraceCheckUtils]: 121: Hoare triple {81385#false} assume !false; {81385#false} is VALID [2022-04-28 15:38:16,047 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 15:38:16,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:38:16,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143801662] [2022-04-28 15:38:16,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143801662] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:38:16,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:38:16,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:38:16,048 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:38:16,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1525649314] [2022-04-28 15:38:16,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1525649314] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:38:16,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:38:16,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:38:16,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176274853] [2022-04-28 15:38:16,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:38:16,049 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-28 15:38:16,049 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:38:16,049 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-28 15:38:16,122 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-28 15:38:16,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:38:16,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:38:16,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:38:16,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:38:16,123 INFO L87 Difference]: Start difference. First operand 515 states and 752 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-28 15:38:17,696 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:38:21,355 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:38:23,383 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:38:24,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:38:24,477 INFO L93 Difference]: Finished difference Result 1116 states and 1640 transitions. [2022-04-28 15:38:24,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:38:24,477 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-28 15:38:24,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:38:24,477 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-28 15:38:24,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 586 transitions. [2022-04-28 15:38:24,480 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-28 15:38:24,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 586 transitions. [2022-04-28 15:38:24,481 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 586 transitions. [2022-04-28 15:38:24,855 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-28 15:38:24,870 INFO L225 Difference]: With dead ends: 1116 [2022-04-28 15:38:24,870 INFO L226 Difference]: Without dead ends: 627 [2022-04-28 15:38:24,871 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-28 15:38:24,871 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 114 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 52 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-04-28 15:38:24,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 384 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 467 Invalid, 2 Unknown, 0 Unchecked, 5.8s Time] [2022-04-28 15:38:24,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2022-04-28 15:38:24,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 551. [2022-04-28 15:38:24,897 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:38:24,898 INFO L82 GeneralOperation]: Start isEquivalent. First operand 627 states. Second operand has 551 states, 546 states have (on average 1.4615384615384615) internal successors, (798), 546 states have internal predecessors, (798), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:38:24,898 INFO L74 IsIncluded]: Start isIncluded. First operand 627 states. Second operand has 551 states, 546 states have (on average 1.4615384615384615) internal successors, (798), 546 states have internal predecessors, (798), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:38:24,898 INFO L87 Difference]: Start difference. First operand 627 states. Second operand has 551 states, 546 states have (on average 1.4615384615384615) internal successors, (798), 546 states have internal predecessors, (798), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:38:24,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:38:24,909 INFO L93 Difference]: Finished difference Result 627 states and 915 transitions. [2022-04-28 15:38:24,909 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 915 transitions. [2022-04-28 15:38:24,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:38:24,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:38:24,910 INFO L74 IsIncluded]: Start isIncluded. First operand has 551 states, 546 states have (on average 1.4615384615384615) internal successors, (798), 546 states have internal predecessors, (798), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 627 states. [2022-04-28 15:38:24,910 INFO L87 Difference]: Start difference. First operand has 551 states, 546 states have (on average 1.4615384615384615) internal successors, (798), 546 states have internal predecessors, (798), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 627 states. [2022-04-28 15:38:24,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:38:24,921 INFO L93 Difference]: Finished difference Result 627 states and 915 transitions. [2022-04-28 15:38:24,921 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 915 transitions. [2022-04-28 15:38:24,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:38:24,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:38:24,922 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:38:24,922 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:38:24,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 546 states have (on average 1.4615384615384615) internal successors, (798), 546 states have internal predecessors, (798), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:38:24,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 802 transitions. [2022-04-28 15:38:24,935 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 802 transitions. Word has length 122 [2022-04-28 15:38:24,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:38:24,935 INFO L495 AbstractCegarLoop]: Abstraction has 551 states and 802 transitions. [2022-04-28 15:38:24,935 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-28 15:38:24,935 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 551 states and 802 transitions. [2022-04-28 15:38:25,617 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 802 edges. 802 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:38:25,617 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 802 transitions. [2022-04-28 15:38:25,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-04-28 15:38:25,618 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:38:25,618 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 15:38:25,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-04-28 15:38:25,618 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:38:25,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:38:25,619 INFO L85 PathProgramCache]: Analyzing trace with hash -833437673, now seen corresponding path program 1 times [2022-04-28 15:38:25,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:38:25,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [616337535] [2022-04-28 15:38:25,689 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:38:25,690 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:38:25,690 INFO L85 PathProgramCache]: Analyzing trace with hash -833437673, now seen corresponding path program 2 times [2022-04-28 15:38:25,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:38:25,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301560859] [2022-04-28 15:38:25,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:38:25,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:38:25,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:38:25,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:38:25,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:38:25,803 INFO L290 TraceCheckUtils]: 0: Hoare triple {85991#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {85984#true} is VALID [2022-04-28 15:38:25,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {85984#true} assume true; {85984#true} is VALID [2022-04-28 15:38:25,803 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {85984#true} {85984#true} #703#return; {85984#true} is VALID [2022-04-28 15:38:25,804 INFO L272 TraceCheckUtils]: 0: Hoare triple {85984#true} call ULTIMATE.init(); {85991#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-28 15:38:25,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {85991#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {85984#true} is VALID [2022-04-28 15:38:25,804 INFO L290 TraceCheckUtils]: 2: Hoare triple {85984#true} assume true; {85984#true} is VALID [2022-04-28 15:38:25,804 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {85984#true} {85984#true} #703#return; {85984#true} is VALID [2022-04-28 15:38:25,804 INFO L272 TraceCheckUtils]: 4: Hoare triple {85984#true} call #t~ret161 := main(); {85984#true} is VALID [2022-04-28 15:38:25,804 INFO L290 TraceCheckUtils]: 5: Hoare triple {85984#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {85984#true} is VALID [2022-04-28 15:38:25,805 INFO L290 TraceCheckUtils]: 6: Hoare triple {85984#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {85984#true} is VALID [2022-04-28 15:38:25,805 INFO L272 TraceCheckUtils]: 7: Hoare triple {85984#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {85984#true} is VALID [2022-04-28 15:38:25,805 INFO L290 TraceCheckUtils]: 8: Hoare triple {85984#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {85984#true} is VALID [2022-04-28 15:38:25,805 INFO L290 TraceCheckUtils]: 9: Hoare triple {85984#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {85984#true} is VALID [2022-04-28 15:38:25,805 INFO L290 TraceCheckUtils]: 10: Hoare triple {85984#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {85984#true} is VALID [2022-04-28 15:38:25,805 INFO L290 TraceCheckUtils]: 11: Hoare triple {85984#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {85984#true} is VALID [2022-04-28 15:38:25,805 INFO L290 TraceCheckUtils]: 12: Hoare triple {85984#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {85984#true} is VALID [2022-04-28 15:38:25,805 INFO L290 TraceCheckUtils]: 13: Hoare triple {85984#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {85984#true} is VALID [2022-04-28 15:38:25,805 INFO L290 TraceCheckUtils]: 14: Hoare triple {85984#true} assume !false; {85984#true} is VALID [2022-04-28 15:38:25,805 INFO L290 TraceCheckUtils]: 15: Hoare triple {85984#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {85984#true} is VALID [2022-04-28 15:38:25,805 INFO L290 TraceCheckUtils]: 16: Hoare triple {85984#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {85984#true} is VALID [2022-04-28 15:38:25,805 INFO L290 TraceCheckUtils]: 17: Hoare triple {85984#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {85984#true} is VALID [2022-04-28 15:38:25,805 INFO L290 TraceCheckUtils]: 18: Hoare triple {85984#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {85984#true} is VALID [2022-04-28 15:38:25,805 INFO L290 TraceCheckUtils]: 19: Hoare triple {85984#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {85984#true} is VALID [2022-04-28 15:38:25,806 INFO L290 TraceCheckUtils]: 20: Hoare triple {85984#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {85984#true} is VALID [2022-04-28 15:38:25,806 INFO L290 TraceCheckUtils]: 21: Hoare triple {85984#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {85984#true} is VALID [2022-04-28 15:38:25,806 INFO L290 TraceCheckUtils]: 22: Hoare triple {85984#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {85984#true} is VALID [2022-04-28 15:38:25,806 INFO L290 TraceCheckUtils]: 23: Hoare triple {85984#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {85984#true} is VALID [2022-04-28 15:38:25,806 INFO L290 TraceCheckUtils]: 24: Hoare triple {85984#true} assume 8464 == #t~mem55;havoc #t~mem55; {85984#true} is VALID [2022-04-28 15:38:25,806 INFO L290 TraceCheckUtils]: 25: Hoare triple {85984#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {85984#true} is VALID [2022-04-28 15:38:25,806 INFO L290 TraceCheckUtils]: 26: Hoare triple {85984#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {85984#true} is VALID [2022-04-28 15:38:25,806 INFO L290 TraceCheckUtils]: 27: Hoare triple {85984#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {85984#true} is VALID [2022-04-28 15:38:25,806 INFO L290 TraceCheckUtils]: 28: Hoare triple {85984#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {85984#true} is VALID [2022-04-28 15:38:25,806 INFO L290 TraceCheckUtils]: 29: Hoare triple {85984#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {85984#true} is VALID [2022-04-28 15:38:25,806 INFO L290 TraceCheckUtils]: 30: Hoare triple {85984#true} ~skip~0 := 0; {85984#true} is VALID [2022-04-28 15:38:25,806 INFO L290 TraceCheckUtils]: 31: Hoare triple {85984#true} assume !false; {85984#true} is VALID [2022-04-28 15:38:25,806 INFO L290 TraceCheckUtils]: 32: Hoare triple {85984#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {85984#true} is VALID [2022-04-28 15:38:25,806 INFO L290 TraceCheckUtils]: 33: Hoare triple {85984#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {85984#true} is VALID [2022-04-28 15:38:25,806 INFO L290 TraceCheckUtils]: 34: Hoare triple {85984#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {85984#true} is VALID [2022-04-28 15:38:25,807 INFO L290 TraceCheckUtils]: 35: Hoare triple {85984#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {85984#true} is VALID [2022-04-28 15:38:25,807 INFO L290 TraceCheckUtils]: 36: Hoare triple {85984#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {85984#true} is VALID [2022-04-28 15:38:25,807 INFO L290 TraceCheckUtils]: 37: Hoare triple {85984#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {85984#true} is VALID [2022-04-28 15:38:25,807 INFO L290 TraceCheckUtils]: 38: Hoare triple {85984#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {85984#true} is VALID [2022-04-28 15:38:25,807 INFO L290 TraceCheckUtils]: 39: Hoare triple {85984#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {85984#true} is VALID [2022-04-28 15:38:25,807 INFO L290 TraceCheckUtils]: 40: Hoare triple {85984#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {85984#true} is VALID [2022-04-28 15:38:25,807 INFO L290 TraceCheckUtils]: 41: Hoare triple {85984#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {85984#true} is VALID [2022-04-28 15:38:25,807 INFO L290 TraceCheckUtils]: 42: Hoare triple {85984#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {85984#true} is VALID [2022-04-28 15:38:25,807 INFO L290 TraceCheckUtils]: 43: Hoare triple {85984#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {85984#true} is VALID [2022-04-28 15:38:25,807 INFO L290 TraceCheckUtils]: 44: Hoare triple {85984#true} assume 8496 == #t~mem58;havoc #t~mem58; {85984#true} is VALID [2022-04-28 15:38:25,807 INFO L290 TraceCheckUtils]: 45: Hoare triple {85984#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {85984#true} is VALID [2022-04-28 15:38:25,807 INFO L290 TraceCheckUtils]: 46: Hoare triple {85984#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {85984#true} is VALID [2022-04-28 15:38:25,807 INFO L290 TraceCheckUtils]: 47: Hoare triple {85984#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {85984#true} is VALID [2022-04-28 15:38:25,808 INFO L290 TraceCheckUtils]: 48: Hoare triple {85984#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {85989#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:38:25,809 INFO L290 TraceCheckUtils]: 49: Hoare triple {85989#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {85989#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:38:25,809 INFO L290 TraceCheckUtils]: 50: Hoare triple {85989#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {85989#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:38:25,809 INFO L290 TraceCheckUtils]: 51: Hoare triple {85989#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {85989#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:38:25,810 INFO L290 TraceCheckUtils]: 52: Hoare triple {85989#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {85989#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:38:25,810 INFO L290 TraceCheckUtils]: 53: Hoare triple {85989#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {85989#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:38:25,810 INFO L290 TraceCheckUtils]: 54: Hoare triple {85989#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {85989#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:38:25,810 INFO L290 TraceCheckUtils]: 55: Hoare triple {85989#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {85989#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:38:25,811 INFO L290 TraceCheckUtils]: 56: Hoare triple {85989#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {85989#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:38:25,811 INFO L290 TraceCheckUtils]: 57: Hoare triple {85989#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {85989#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:38:25,811 INFO L290 TraceCheckUtils]: 58: Hoare triple {85989#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {85989#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:38:25,812 INFO L290 TraceCheckUtils]: 59: Hoare triple {85989#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {85989#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:38:25,812 INFO L290 TraceCheckUtils]: 60: Hoare triple {85989#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {85989#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:38:25,812 INFO L290 TraceCheckUtils]: 61: Hoare triple {85989#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {85989#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:38:25,813 INFO L290 TraceCheckUtils]: 62: Hoare triple {85989#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {85989#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:38:25,813 INFO L290 TraceCheckUtils]: 63: Hoare triple {85989#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {85989#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:38:25,813 INFO L290 TraceCheckUtils]: 64: Hoare triple {85989#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {85989#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:38:25,814 INFO L290 TraceCheckUtils]: 65: Hoare triple {85989#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {85989#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:38:25,814 INFO L290 TraceCheckUtils]: 66: Hoare triple {85989#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {85989#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:38:25,814 INFO L290 TraceCheckUtils]: 67: Hoare triple {85989#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {85989#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:38:25,815 INFO L290 TraceCheckUtils]: 68: Hoare triple {85989#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {85989#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:38:25,815 INFO L290 TraceCheckUtils]: 69: Hoare triple {85989#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {85989#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:38:25,815 INFO L290 TraceCheckUtils]: 70: Hoare triple {85989#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {85989#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:38:25,816 INFO L290 TraceCheckUtils]: 71: Hoare triple {85989#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {85989#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:38:25,816 INFO L290 TraceCheckUtils]: 72: Hoare triple {85989#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {85989#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:38:25,816 INFO L290 TraceCheckUtils]: 73: Hoare triple {85989#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {85989#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:38:25,817 INFO L290 TraceCheckUtils]: 74: Hoare triple {85989#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {85989#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:38:25,817 INFO L290 TraceCheckUtils]: 75: Hoare triple {85989#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {85989#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:38:25,817 INFO L290 TraceCheckUtils]: 76: Hoare triple {85989#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {85989#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:38:25,818 INFO L290 TraceCheckUtils]: 77: Hoare triple {85989#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {85989#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:38:25,818 INFO L290 TraceCheckUtils]: 78: Hoare triple {85989#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {85989#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:38:25,818 INFO L290 TraceCheckUtils]: 79: Hoare triple {85989#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {85990#(= |ssl3_accept_#t~mem72| 8656)} is VALID [2022-04-28 15:38:25,819 INFO L290 TraceCheckUtils]: 80: Hoare triple {85990#(= |ssl3_accept_#t~mem72| 8656)} assume 8593 == #t~mem72;havoc #t~mem72; {85985#false} is VALID [2022-04-28 15:38:25,819 INFO L290 TraceCheckUtils]: 81: Hoare triple {85985#false} assume -2147483648 <= #t~nondet136 && #t~nondet136 <= 2147483647;~ret~0 := #t~nondet136;havoc #t~nondet136; {85985#false} is VALID [2022-04-28 15:38:25,819 INFO L290 TraceCheckUtils]: 82: Hoare triple {85985#false} assume !(~ret~0 <= 0);call write~int(8608, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {85985#false} is VALID [2022-04-28 15:38:25,819 INFO L290 TraceCheckUtils]: 83: Hoare triple {85985#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {85985#false} is VALID [2022-04-28 15:38:25,819 INFO L290 TraceCheckUtils]: 84: Hoare triple {85985#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {85985#false} is VALID [2022-04-28 15:38:25,819 INFO L290 TraceCheckUtils]: 85: Hoare triple {85985#false} ~skip~0 := 0; {85985#false} is VALID [2022-04-28 15:38:25,819 INFO L290 TraceCheckUtils]: 86: Hoare triple {85985#false} assume !false; {85985#false} is VALID [2022-04-28 15:38:25,819 INFO L290 TraceCheckUtils]: 87: Hoare triple {85985#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {85985#false} is VALID [2022-04-28 15:38:25,819 INFO L290 TraceCheckUtils]: 88: Hoare triple {85985#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {85985#false} is VALID [2022-04-28 15:38:25,819 INFO L290 TraceCheckUtils]: 89: Hoare triple {85985#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {85985#false} is VALID [2022-04-28 15:38:25,819 INFO L290 TraceCheckUtils]: 90: Hoare triple {85985#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {85985#false} is VALID [2022-04-28 15:38:25,819 INFO L290 TraceCheckUtils]: 91: Hoare triple {85985#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {85985#false} is VALID [2022-04-28 15:38:25,819 INFO L290 TraceCheckUtils]: 92: Hoare triple {85985#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {85985#false} is VALID [2022-04-28 15:38:25,819 INFO L290 TraceCheckUtils]: 93: Hoare triple {85985#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {85985#false} is VALID [2022-04-28 15:38:25,820 INFO L290 TraceCheckUtils]: 94: Hoare triple {85985#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {85985#false} is VALID [2022-04-28 15:38:25,820 INFO L290 TraceCheckUtils]: 95: Hoare triple {85985#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {85985#false} is VALID [2022-04-28 15:38:25,820 INFO L290 TraceCheckUtils]: 96: Hoare triple {85985#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {85985#false} is VALID [2022-04-28 15:38:25,820 INFO L290 TraceCheckUtils]: 97: Hoare triple {85985#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {85985#false} is VALID [2022-04-28 15:38:25,820 INFO L290 TraceCheckUtils]: 98: Hoare triple {85985#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {85985#false} is VALID [2022-04-28 15:38:25,820 INFO L290 TraceCheckUtils]: 99: Hoare triple {85985#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {85985#false} is VALID [2022-04-28 15:38:25,820 INFO L290 TraceCheckUtils]: 100: Hoare triple {85985#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {85985#false} is VALID [2022-04-28 15:38:25,820 INFO L290 TraceCheckUtils]: 101: Hoare triple {85985#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {85985#false} is VALID [2022-04-28 15:38:25,820 INFO L290 TraceCheckUtils]: 102: Hoare triple {85985#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {85985#false} is VALID [2022-04-28 15:38:25,820 INFO L290 TraceCheckUtils]: 103: Hoare triple {85985#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {85985#false} is VALID [2022-04-28 15:38:25,820 INFO L290 TraceCheckUtils]: 104: Hoare triple {85985#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {85985#false} is VALID [2022-04-28 15:38:25,820 INFO L290 TraceCheckUtils]: 105: Hoare triple {85985#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {85985#false} is VALID [2022-04-28 15:38:25,820 INFO L290 TraceCheckUtils]: 106: Hoare triple {85985#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {85985#false} is VALID [2022-04-28 15:38:25,820 INFO L290 TraceCheckUtils]: 107: Hoare triple {85985#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {85985#false} is VALID [2022-04-28 15:38:25,821 INFO L290 TraceCheckUtils]: 108: Hoare triple {85985#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {85985#false} is VALID [2022-04-28 15:38:25,821 INFO L290 TraceCheckUtils]: 109: Hoare triple {85985#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {85985#false} is VALID [2022-04-28 15:38:25,821 INFO L290 TraceCheckUtils]: 110: Hoare triple {85985#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {85985#false} is VALID [2022-04-28 15:38:25,821 INFO L290 TraceCheckUtils]: 111: Hoare triple {85985#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {85985#false} is VALID [2022-04-28 15:38:25,821 INFO L290 TraceCheckUtils]: 112: Hoare triple {85985#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {85985#false} is VALID [2022-04-28 15:38:25,821 INFO L290 TraceCheckUtils]: 113: Hoare triple {85985#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {85985#false} is VALID [2022-04-28 15:38:25,821 INFO L290 TraceCheckUtils]: 114: Hoare triple {85985#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {85985#false} is VALID [2022-04-28 15:38:25,821 INFO L290 TraceCheckUtils]: 115: Hoare triple {85985#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {85985#false} is VALID [2022-04-28 15:38:25,821 INFO L290 TraceCheckUtils]: 116: Hoare triple {85985#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {85985#false} is VALID [2022-04-28 15:38:25,821 INFO L290 TraceCheckUtils]: 117: Hoare triple {85985#false} assume 8641 == #t~mem76;havoc #t~mem76; {85985#false} is VALID [2022-04-28 15:38:25,821 INFO L290 TraceCheckUtils]: 118: Hoare triple {85985#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {85985#false} is VALID [2022-04-28 15:38:25,821 INFO L290 TraceCheckUtils]: 119: Hoare triple {85985#false} assume !(4 == ~blastFlag~0); {85985#false} is VALID [2022-04-28 15:38:25,821 INFO L290 TraceCheckUtils]: 120: Hoare triple {85985#false} assume !(7 == ~blastFlag~0); {85985#false} is VALID [2022-04-28 15:38:25,821 INFO L290 TraceCheckUtils]: 121: Hoare triple {85985#false} assume !(10 == ~blastFlag~0); {85985#false} is VALID [2022-04-28 15:38:25,821 INFO L290 TraceCheckUtils]: 122: Hoare triple {85985#false} assume !false; {85985#false} is VALID [2022-04-28 15:38:25,822 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 15:38:25,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:38:25,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301560859] [2022-04-28 15:38:25,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301560859] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:38:25,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:38:25,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:38:25,822 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:38:25,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [616337535] [2022-04-28 15:38:25,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [616337535] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:38:25,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:38:25,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:38:25,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147984700] [2022-04-28 15:38:25,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:38:25,823 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 123 [2022-04-28 15:38:25,823 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:38:25,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:38:25,890 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:38:25,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:38:25,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:38:25,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:38:25,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:38:25,891 INFO L87 Difference]: Start difference. First operand 551 states and 802 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:38:28,353 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:38:32,920 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:38:36,280 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-28 15:38:37,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:38:37,361 INFO L93 Difference]: Finished difference Result 1100 states and 1609 transitions. [2022-04-28 15:38:37,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:38:37,362 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 123 [2022-04-28 15:38:37,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:38:37,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:38:37,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 514 transitions. [2022-04-28 15:38:37,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:38:37,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 514 transitions. [2022-04-28 15:38:37,366 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 514 transitions. [2022-04-28 15:38:37,683 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 514 edges. 514 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:38:37,696 INFO L225 Difference]: With dead ends: 1100 [2022-04-28 15:38:37,696 INFO L226 Difference]: Without dead ends: 575 [2022-04-28 15:38:37,697 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-28 15:38:37,697 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 49 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-04-28 15:38:37,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 549 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2022-04-28 15:38:37,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2022-04-28 15:38:37,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 551. [2022-04-28 15:38:37,731 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:38:37,732 INFO L82 GeneralOperation]: Start isEquivalent. First operand 575 states. Second operand has 551 states, 546 states have (on average 1.4597069597069596) internal successors, (797), 546 states have internal predecessors, (797), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:38:37,732 INFO L74 IsIncluded]: Start isIncluded. First operand 575 states. Second operand has 551 states, 546 states have (on average 1.4597069597069596) internal successors, (797), 546 states have internal predecessors, (797), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:38:37,733 INFO L87 Difference]: Start difference. First operand 575 states. Second operand has 551 states, 546 states have (on average 1.4597069597069596) internal successors, (797), 546 states have internal predecessors, (797), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:38:37,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:38:37,742 INFO L93 Difference]: Finished difference Result 575 states and 836 transitions. [2022-04-28 15:38:37,742 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 836 transitions. [2022-04-28 15:38:37,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:38:37,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:38:37,743 INFO L74 IsIncluded]: Start isIncluded. First operand has 551 states, 546 states have (on average 1.4597069597069596) internal successors, (797), 546 states have internal predecessors, (797), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 575 states. [2022-04-28 15:38:37,743 INFO L87 Difference]: Start difference. First operand has 551 states, 546 states have (on average 1.4597069597069596) internal successors, (797), 546 states have internal predecessors, (797), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 575 states. [2022-04-28 15:38:37,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:38:37,753 INFO L93 Difference]: Finished difference Result 575 states and 836 transitions. [2022-04-28 15:38:37,753 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 836 transitions. [2022-04-28 15:38:37,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:38:37,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:38:37,753 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:38:37,753 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:38:37,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 546 states have (on average 1.4597069597069596) internal successors, (797), 546 states have internal predecessors, (797), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:38:37,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 801 transitions. [2022-04-28 15:38:37,765 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 801 transitions. Word has length 123 [2022-04-28 15:38:37,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:38:37,765 INFO L495 AbstractCegarLoop]: Abstraction has 551 states and 801 transitions. [2022-04-28 15:38:37,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:38:37,766 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 551 states and 801 transitions. [2022-04-28 15:38:38,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 801 edges. 801 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:38:38,473 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 801 transitions. [2022-04-28 15:38:38,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-04-28 15:38:38,473 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:38:38,473 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:38:38,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-04-28 15:38:38,474 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:38:38,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:38:38,474 INFO L85 PathProgramCache]: Analyzing trace with hash -336492130, now seen corresponding path program 1 times [2022-04-28 15:38:38,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:38:38,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [85454412] [2022-04-28 15:38:38,538 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:38:38,539 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:38:38,539 INFO L85 PathProgramCache]: Analyzing trace with hash -336492130, now seen corresponding path program 2 times [2022-04-28 15:38:38,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:38:38,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239352283] [2022-04-28 15:38:38,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:38:38,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:38:38,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:38:38,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:38:38,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:38:38,636 INFO L290 TraceCheckUtils]: 0: Hoare triple {90455#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {90448#true} is VALID [2022-04-28 15:38:38,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {90448#true} assume true; {90448#true} is VALID [2022-04-28 15:38:38,637 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {90448#true} {90448#true} #703#return; {90448#true} is VALID [2022-04-28 15:38:38,637 INFO L272 TraceCheckUtils]: 0: Hoare triple {90448#true} call ULTIMATE.init(); {90455#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-28 15:38:38,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {90455#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {90448#true} is VALID [2022-04-28 15:38:38,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {90448#true} assume true; {90448#true} is VALID [2022-04-28 15:38:38,637 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {90448#true} {90448#true} #703#return; {90448#true} is VALID [2022-04-28 15:38:38,637 INFO L272 TraceCheckUtils]: 4: Hoare triple {90448#true} call #t~ret161 := main(); {90448#true} is VALID [2022-04-28 15:38:38,638 INFO L290 TraceCheckUtils]: 5: Hoare triple {90448#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {90448#true} is VALID [2022-04-28 15:38:38,638 INFO L290 TraceCheckUtils]: 6: Hoare triple {90448#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {90448#true} is VALID [2022-04-28 15:38:38,638 INFO L272 TraceCheckUtils]: 7: Hoare triple {90448#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {90448#true} is VALID [2022-04-28 15:38:38,638 INFO L290 TraceCheckUtils]: 8: Hoare triple {90448#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {90448#true} is VALID [2022-04-28 15:38:38,638 INFO L290 TraceCheckUtils]: 9: Hoare triple {90448#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {90448#true} is VALID [2022-04-28 15:38:38,638 INFO L290 TraceCheckUtils]: 10: Hoare triple {90448#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {90448#true} is VALID [2022-04-28 15:38:38,638 INFO L290 TraceCheckUtils]: 11: Hoare triple {90448#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {90448#true} is VALID [2022-04-28 15:38:38,638 INFO L290 TraceCheckUtils]: 12: Hoare triple {90448#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {90448#true} is VALID [2022-04-28 15:38:38,638 INFO L290 TraceCheckUtils]: 13: Hoare triple {90448#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {90448#true} is VALID [2022-04-28 15:38:38,638 INFO L290 TraceCheckUtils]: 14: Hoare triple {90448#true} assume !false; {90448#true} is VALID [2022-04-28 15:38:38,638 INFO L290 TraceCheckUtils]: 15: Hoare triple {90448#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {90448#true} is VALID [2022-04-28 15:38:38,638 INFO L290 TraceCheckUtils]: 16: Hoare triple {90448#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {90448#true} is VALID [2022-04-28 15:38:38,638 INFO L290 TraceCheckUtils]: 17: Hoare triple {90448#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {90448#true} is VALID [2022-04-28 15:38:38,638 INFO L290 TraceCheckUtils]: 18: Hoare triple {90448#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {90448#true} is VALID [2022-04-28 15:38:38,639 INFO L290 TraceCheckUtils]: 19: Hoare triple {90448#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {90448#true} is VALID [2022-04-28 15:38:38,639 INFO L290 TraceCheckUtils]: 20: Hoare triple {90448#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {90448#true} is VALID [2022-04-28 15:38:38,639 INFO L290 TraceCheckUtils]: 21: Hoare triple {90448#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {90448#true} is VALID [2022-04-28 15:38:38,639 INFO L290 TraceCheckUtils]: 22: Hoare triple {90448#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {90448#true} is VALID [2022-04-28 15:38:38,639 INFO L290 TraceCheckUtils]: 23: Hoare triple {90448#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {90448#true} is VALID [2022-04-28 15:38:38,639 INFO L290 TraceCheckUtils]: 24: Hoare triple {90448#true} assume 8464 == #t~mem55;havoc #t~mem55; {90448#true} is VALID [2022-04-28 15:38:38,639 INFO L290 TraceCheckUtils]: 25: Hoare triple {90448#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {90448#true} is VALID [2022-04-28 15:38:38,639 INFO L290 TraceCheckUtils]: 26: Hoare triple {90448#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {90448#true} is VALID [2022-04-28 15:38:38,639 INFO L290 TraceCheckUtils]: 27: Hoare triple {90448#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {90448#true} is VALID [2022-04-28 15:38:38,639 INFO L290 TraceCheckUtils]: 28: Hoare triple {90448#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {90448#true} is VALID [2022-04-28 15:38:38,639 INFO L290 TraceCheckUtils]: 29: Hoare triple {90448#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {90448#true} is VALID [2022-04-28 15:38:38,639 INFO L290 TraceCheckUtils]: 30: Hoare triple {90448#true} ~skip~0 := 0; {90448#true} is VALID [2022-04-28 15:38:38,639 INFO L290 TraceCheckUtils]: 31: Hoare triple {90448#true} assume !false; {90448#true} is VALID [2022-04-28 15:38:38,639 INFO L290 TraceCheckUtils]: 32: Hoare triple {90448#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {90448#true} is VALID [2022-04-28 15:38:38,639 INFO L290 TraceCheckUtils]: 33: Hoare triple {90448#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {90448#true} is VALID [2022-04-28 15:38:38,640 INFO L290 TraceCheckUtils]: 34: Hoare triple {90448#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {90448#true} is VALID [2022-04-28 15:38:38,640 INFO L290 TraceCheckUtils]: 35: Hoare triple {90448#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {90448#true} is VALID [2022-04-28 15:38:38,640 INFO L290 TraceCheckUtils]: 36: Hoare triple {90448#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {90448#true} is VALID [2022-04-28 15:38:38,640 INFO L290 TraceCheckUtils]: 37: Hoare triple {90448#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {90448#true} is VALID [2022-04-28 15:38:38,640 INFO L290 TraceCheckUtils]: 38: Hoare triple {90448#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {90448#true} is VALID [2022-04-28 15:38:38,640 INFO L290 TraceCheckUtils]: 39: Hoare triple {90448#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {90448#true} is VALID [2022-04-28 15:38:38,640 INFO L290 TraceCheckUtils]: 40: Hoare triple {90448#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {90448#true} is VALID [2022-04-28 15:38:38,640 INFO L290 TraceCheckUtils]: 41: Hoare triple {90448#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {90448#true} is VALID [2022-04-28 15:38:38,640 INFO L290 TraceCheckUtils]: 42: Hoare triple {90448#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {90448#true} is VALID [2022-04-28 15:38:38,640 INFO L290 TraceCheckUtils]: 43: Hoare triple {90448#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {90448#true} is VALID [2022-04-28 15:38:38,640 INFO L290 TraceCheckUtils]: 44: Hoare triple {90448#true} assume 8496 == #t~mem58;havoc #t~mem58; {90448#true} is VALID [2022-04-28 15:38:38,640 INFO L290 TraceCheckUtils]: 45: Hoare triple {90448#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {90448#true} is VALID [2022-04-28 15:38:38,640 INFO L290 TraceCheckUtils]: 46: Hoare triple {90448#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {90448#true} is VALID [2022-04-28 15:38:38,640 INFO L290 TraceCheckUtils]: 47: Hoare triple {90448#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {90448#true} is VALID [2022-04-28 15:38:38,641 INFO L290 TraceCheckUtils]: 48: Hoare triple {90448#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {90453#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:38:38,642 INFO L290 TraceCheckUtils]: 49: Hoare triple {90453#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {90453#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:38:38,642 INFO L290 TraceCheckUtils]: 50: Hoare triple {90453#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {90453#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:38:38,642 INFO L290 TraceCheckUtils]: 51: Hoare triple {90453#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {90453#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:38:38,643 INFO L290 TraceCheckUtils]: 52: Hoare triple {90453#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} ~skip~0 := 0; {90453#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:38:38,643 INFO L290 TraceCheckUtils]: 53: Hoare triple {90453#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !false; {90453#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:38:38,643 INFO L290 TraceCheckUtils]: 54: Hoare triple {90453#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {90453#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:38:38,644 INFO L290 TraceCheckUtils]: 55: Hoare triple {90453#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {90453#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:38:38,644 INFO L290 TraceCheckUtils]: 56: Hoare triple {90453#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {90453#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:38:38,644 INFO L290 TraceCheckUtils]: 57: Hoare triple {90453#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {90453#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:38:38,645 INFO L290 TraceCheckUtils]: 58: Hoare triple {90453#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {90453#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:38:38,645 INFO L290 TraceCheckUtils]: 59: Hoare triple {90453#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {90453#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:38:38,645 INFO L290 TraceCheckUtils]: 60: Hoare triple {90453#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {90453#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:38:38,646 INFO L290 TraceCheckUtils]: 61: Hoare triple {90453#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {90453#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:38:38,646 INFO L290 TraceCheckUtils]: 62: Hoare triple {90453#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {90453#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:38:38,646 INFO L290 TraceCheckUtils]: 63: Hoare triple {90453#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {90453#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:38:38,647 INFO L290 TraceCheckUtils]: 64: Hoare triple {90453#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {90453#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:38:38,647 INFO L290 TraceCheckUtils]: 65: Hoare triple {90453#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {90453#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:38:38,647 INFO L290 TraceCheckUtils]: 66: Hoare triple {90453#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {90453#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:38:38,648 INFO L290 TraceCheckUtils]: 67: Hoare triple {90453#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {90453#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:38:38,648 INFO L290 TraceCheckUtils]: 68: Hoare triple {90453#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {90453#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:38:38,648 INFO L290 TraceCheckUtils]: 69: Hoare triple {90453#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {90453#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:38:38,649 INFO L290 TraceCheckUtils]: 70: Hoare triple {90453#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {90453#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:38:38,649 INFO L290 TraceCheckUtils]: 71: Hoare triple {90453#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {90453#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:38:38,649 INFO L290 TraceCheckUtils]: 72: Hoare triple {90453#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {90453#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:38:38,650 INFO L290 TraceCheckUtils]: 73: Hoare triple {90453#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {90453#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:38:38,650 INFO L290 TraceCheckUtils]: 74: Hoare triple {90453#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {90453#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:38:38,650 INFO L290 TraceCheckUtils]: 75: Hoare triple {90453#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {90453#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:38:38,651 INFO L290 TraceCheckUtils]: 76: Hoare triple {90453#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {90453#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:38:38,651 INFO L290 TraceCheckUtils]: 77: Hoare triple {90453#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {90453#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:38:38,651 INFO L290 TraceCheckUtils]: 78: Hoare triple {90453#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {90453#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:38:38,651 INFO L290 TraceCheckUtils]: 79: Hoare triple {90453#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {90453#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:38:38,652 INFO L290 TraceCheckUtils]: 80: Hoare triple {90453#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {90454#(not (= |ssl3_accept_#t~mem73| 8608))} is VALID [2022-04-28 15:38:38,652 INFO L290 TraceCheckUtils]: 81: Hoare triple {90454#(not (= |ssl3_accept_#t~mem73| 8608))} assume 8608 == #t~mem73;havoc #t~mem73; {90449#false} is VALID [2022-04-28 15:38:38,652 INFO L290 TraceCheckUtils]: 82: Hoare triple {90449#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {90449#false} is VALID [2022-04-28 15:38:38,652 INFO L290 TraceCheckUtils]: 83: Hoare triple {90449#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {90449#false} is VALID [2022-04-28 15:38:38,652 INFO L290 TraceCheckUtils]: 84: Hoare triple {90449#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {90449#false} is VALID [2022-04-28 15:38:38,652 INFO L290 TraceCheckUtils]: 85: Hoare triple {90449#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {90449#false} is VALID [2022-04-28 15:38:38,652 INFO L290 TraceCheckUtils]: 86: Hoare triple {90449#false} ~skip~0 := 0; {90449#false} is VALID [2022-04-28 15:38:38,653 INFO L290 TraceCheckUtils]: 87: Hoare triple {90449#false} assume !false; {90449#false} is VALID [2022-04-28 15:38:38,653 INFO L290 TraceCheckUtils]: 88: Hoare triple {90449#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {90449#false} is VALID [2022-04-28 15:38:38,653 INFO L290 TraceCheckUtils]: 89: Hoare triple {90449#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {90449#false} is VALID [2022-04-28 15:38:38,653 INFO L290 TraceCheckUtils]: 90: Hoare triple {90449#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {90449#false} is VALID [2022-04-28 15:38:38,653 INFO L290 TraceCheckUtils]: 91: Hoare triple {90449#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {90449#false} is VALID [2022-04-28 15:38:38,653 INFO L290 TraceCheckUtils]: 92: Hoare triple {90449#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {90449#false} is VALID [2022-04-28 15:38:38,653 INFO L290 TraceCheckUtils]: 93: Hoare triple {90449#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {90449#false} is VALID [2022-04-28 15:38:38,653 INFO L290 TraceCheckUtils]: 94: Hoare triple {90449#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {90449#false} is VALID [2022-04-28 15:38:38,653 INFO L290 TraceCheckUtils]: 95: Hoare triple {90449#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {90449#false} is VALID [2022-04-28 15:38:38,653 INFO L290 TraceCheckUtils]: 96: Hoare triple {90449#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {90449#false} is VALID [2022-04-28 15:38:38,653 INFO L290 TraceCheckUtils]: 97: Hoare triple {90449#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {90449#false} is VALID [2022-04-28 15:38:38,653 INFO L290 TraceCheckUtils]: 98: Hoare triple {90449#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {90449#false} is VALID [2022-04-28 15:38:38,653 INFO L290 TraceCheckUtils]: 99: Hoare triple {90449#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {90449#false} is VALID [2022-04-28 15:38:38,653 INFO L290 TraceCheckUtils]: 100: Hoare triple {90449#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {90449#false} is VALID [2022-04-28 15:38:38,653 INFO L290 TraceCheckUtils]: 101: Hoare triple {90449#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {90449#false} is VALID [2022-04-28 15:38:38,654 INFO L290 TraceCheckUtils]: 102: Hoare triple {90449#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {90449#false} is VALID [2022-04-28 15:38:38,654 INFO L290 TraceCheckUtils]: 103: Hoare triple {90449#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {90449#false} is VALID [2022-04-28 15:38:38,654 INFO L290 TraceCheckUtils]: 104: Hoare triple {90449#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {90449#false} is VALID [2022-04-28 15:38:38,654 INFO L290 TraceCheckUtils]: 105: Hoare triple {90449#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {90449#false} is VALID [2022-04-28 15:38:38,654 INFO L290 TraceCheckUtils]: 106: Hoare triple {90449#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {90449#false} is VALID [2022-04-28 15:38:38,654 INFO L290 TraceCheckUtils]: 107: Hoare triple {90449#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {90449#false} is VALID [2022-04-28 15:38:38,654 INFO L290 TraceCheckUtils]: 108: Hoare triple {90449#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {90449#false} is VALID [2022-04-28 15:38:38,654 INFO L290 TraceCheckUtils]: 109: Hoare triple {90449#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {90449#false} is VALID [2022-04-28 15:38:38,654 INFO L290 TraceCheckUtils]: 110: Hoare triple {90449#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {90449#false} is VALID [2022-04-28 15:38:38,654 INFO L290 TraceCheckUtils]: 111: Hoare triple {90449#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {90449#false} is VALID [2022-04-28 15:38:38,654 INFO L290 TraceCheckUtils]: 112: Hoare triple {90449#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {90449#false} is VALID [2022-04-28 15:38:38,654 INFO L290 TraceCheckUtils]: 113: Hoare triple {90449#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {90449#false} is VALID [2022-04-28 15:38:38,654 INFO L290 TraceCheckUtils]: 114: Hoare triple {90449#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {90449#false} is VALID [2022-04-28 15:38:38,654 INFO L290 TraceCheckUtils]: 115: Hoare triple {90449#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {90449#false} is VALID [2022-04-28 15:38:38,654 INFO L290 TraceCheckUtils]: 116: Hoare triple {90449#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {90449#false} is VALID [2022-04-28 15:38:38,654 INFO L290 TraceCheckUtils]: 117: Hoare triple {90449#false} assume 8640 == #t~mem75;havoc #t~mem75; {90449#false} is VALID [2022-04-28 15:38:38,655 INFO L290 TraceCheckUtils]: 118: Hoare triple {90449#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {90449#false} is VALID [2022-04-28 15:38:38,655 INFO L290 TraceCheckUtils]: 119: Hoare triple {90449#false} assume !(4 == ~blastFlag~0); {90449#false} is VALID [2022-04-28 15:38:38,655 INFO L290 TraceCheckUtils]: 120: Hoare triple {90449#false} assume !(7 == ~blastFlag~0); {90449#false} is VALID [2022-04-28 15:38:38,655 INFO L290 TraceCheckUtils]: 121: Hoare triple {90449#false} assume !(10 == ~blastFlag~0); {90449#false} is VALID [2022-04-28 15:38:38,655 INFO L290 TraceCheckUtils]: 122: Hoare triple {90449#false} assume !false; {90449#false} is VALID [2022-04-28 15:38:38,655 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-28 15:38:38,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:38:38,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239352283] [2022-04-28 15:38:38,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239352283] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:38:38,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:38:38,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:38:38,656 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:38:38,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [85454412] [2022-04-28 15:38:38,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [85454412] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:38:38,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:38:38,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:38:38,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315749862] [2022-04-28 15:38:38,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:38:38,656 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 123 [2022-04-28 15:38:38,656 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:38:38,657 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:38:38,733 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:38:38,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:38:38,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:38:38,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:38:38,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:38:38,734 INFO L87 Difference]: Start difference. First operand 551 states and 801 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:38:44,416 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:38:48,479 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:38:50,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:38:50,755 INFO L93 Difference]: Finished difference Result 1187 states and 1735 transitions. [2022-04-28 15:38:50,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:38:50,756 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 123 [2022-04-28 15:38:50,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:38:50,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:38:50,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 586 transitions. [2022-04-28 15:38:50,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:38:50,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 586 transitions. [2022-04-28 15:38:50,760 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 586 transitions. [2022-04-28 15:38:51,158 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-28 15:38:51,174 INFO L225 Difference]: With dead ends: 1187 [2022-04-28 15:38:51,175 INFO L226 Difference]: Without dead ends: 662 [2022-04-28 15:38:51,176 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-28 15:38:51,176 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 112 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-04-28 15:38:51,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 386 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2022-04-28 15:38:51,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2022-04-28 15:38:51,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 590. [2022-04-28 15:38:51,219 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:38:51,220 INFO L82 GeneralOperation]: Start isEquivalent. First operand 662 states. Second operand has 590 states, 585 states have (on average 1.4564102564102563) internal successors, (852), 585 states have internal predecessors, (852), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:38:51,220 INFO L74 IsIncluded]: Start isIncluded. First operand 662 states. Second operand has 590 states, 585 states have (on average 1.4564102564102563) internal successors, (852), 585 states have internal predecessors, (852), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:38:51,220 INFO L87 Difference]: Start difference. First operand 662 states. Second operand has 590 states, 585 states have (on average 1.4564102564102563) internal successors, (852), 585 states have internal predecessors, (852), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:38:51,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:38:51,232 INFO L93 Difference]: Finished difference Result 662 states and 961 transitions. [2022-04-28 15:38:51,232 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 961 transitions. [2022-04-28 15:38:51,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:38:51,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:38:51,248 INFO L74 IsIncluded]: Start isIncluded. First operand has 590 states, 585 states have (on average 1.4564102564102563) internal successors, (852), 585 states have internal predecessors, (852), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 662 states. [2022-04-28 15:38:51,248 INFO L87 Difference]: Start difference. First operand has 590 states, 585 states have (on average 1.4564102564102563) internal successors, (852), 585 states have internal predecessors, (852), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 662 states. [2022-04-28 15:38:51,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:38:51,260 INFO L93 Difference]: Finished difference Result 662 states and 961 transitions. [2022-04-28 15:38:51,260 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 961 transitions. [2022-04-28 15:38:51,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:38:51,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:38:51,261 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:38:51,261 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:38:51,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 585 states have (on average 1.4564102564102563) internal successors, (852), 585 states have internal predecessors, (852), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:38:51,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 856 transitions. [2022-04-28 15:38:51,287 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 856 transitions. Word has length 123 [2022-04-28 15:38:51,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:38:51,287 INFO L495 AbstractCegarLoop]: Abstraction has 590 states and 856 transitions. [2022-04-28 15:38:51,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:38:51,287 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 590 states and 856 transitions. [2022-04-28 15:38:51,997 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 856 edges. 856 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:38:51,998 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 856 transitions. [2022-04-28 15:38:51,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-04-28 15:38:51,998 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:38:51,998 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:38:51,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-04-28 15:38:51,999 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:38:51,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:38:51,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1416201914, now seen corresponding path program 1 times [2022-04-28 15:38:51,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:38:51,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [945050462] [2022-04-28 15:38:52,062 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:38:52,062 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:38:52,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1416201914, now seen corresponding path program 2 times [2022-04-28 15:38:52,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:38:52,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515224678] [2022-04-28 15:38:52,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:38:52,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:38:52,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:38:52,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:38:52,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:38:52,176 INFO L290 TraceCheckUtils]: 0: Hoare triple {95345#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {95338#true} is VALID [2022-04-28 15:38:52,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {95338#true} assume true; {95338#true} is VALID [2022-04-28 15:38:52,176 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {95338#true} {95338#true} #703#return; {95338#true} is VALID [2022-04-28 15:38:52,176 INFO L272 TraceCheckUtils]: 0: Hoare triple {95338#true} call ULTIMATE.init(); {95345#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-28 15:38:52,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {95345#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {95338#true} is VALID [2022-04-28 15:38:52,177 INFO L290 TraceCheckUtils]: 2: Hoare triple {95338#true} assume true; {95338#true} is VALID [2022-04-28 15:38:52,177 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {95338#true} {95338#true} #703#return; {95338#true} is VALID [2022-04-28 15:38:52,177 INFO L272 TraceCheckUtils]: 4: Hoare triple {95338#true} call #t~ret161 := main(); {95338#true} is VALID [2022-04-28 15:38:52,177 INFO L290 TraceCheckUtils]: 5: Hoare triple {95338#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {95338#true} is VALID [2022-04-28 15:38:52,177 INFO L290 TraceCheckUtils]: 6: Hoare triple {95338#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {95338#true} is VALID [2022-04-28 15:38:52,177 INFO L272 TraceCheckUtils]: 7: Hoare triple {95338#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {95338#true} is VALID [2022-04-28 15:38:52,177 INFO L290 TraceCheckUtils]: 8: Hoare triple {95338#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {95338#true} is VALID [2022-04-28 15:38:52,177 INFO L290 TraceCheckUtils]: 9: Hoare triple {95338#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {95338#true} is VALID [2022-04-28 15:38:52,177 INFO L290 TraceCheckUtils]: 10: Hoare triple {95338#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {95338#true} is VALID [2022-04-28 15:38:52,177 INFO L290 TraceCheckUtils]: 11: Hoare triple {95338#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {95338#true} is VALID [2022-04-28 15:38:52,177 INFO L290 TraceCheckUtils]: 12: Hoare triple {95338#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {95338#true} is VALID [2022-04-28 15:38:52,177 INFO L290 TraceCheckUtils]: 13: Hoare triple {95338#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {95338#true} is VALID [2022-04-28 15:38:52,177 INFO L290 TraceCheckUtils]: 14: Hoare triple {95338#true} assume !false; {95338#true} is VALID [2022-04-28 15:38:52,178 INFO L290 TraceCheckUtils]: 15: Hoare triple {95338#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {95338#true} is VALID [2022-04-28 15:38:52,178 INFO L290 TraceCheckUtils]: 16: Hoare triple {95338#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {95338#true} is VALID [2022-04-28 15:38:52,178 INFO L290 TraceCheckUtils]: 17: Hoare triple {95338#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {95338#true} is VALID [2022-04-28 15:38:52,178 INFO L290 TraceCheckUtils]: 18: Hoare triple {95338#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {95338#true} is VALID [2022-04-28 15:38:52,178 INFO L290 TraceCheckUtils]: 19: Hoare triple {95338#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {95338#true} is VALID [2022-04-28 15:38:52,178 INFO L290 TraceCheckUtils]: 20: Hoare triple {95338#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {95338#true} is VALID [2022-04-28 15:38:52,178 INFO L290 TraceCheckUtils]: 21: Hoare triple {95338#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {95338#true} is VALID [2022-04-28 15:38:52,178 INFO L290 TraceCheckUtils]: 22: Hoare triple {95338#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {95338#true} is VALID [2022-04-28 15:38:52,178 INFO L290 TraceCheckUtils]: 23: Hoare triple {95338#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {95338#true} is VALID [2022-04-28 15:38:52,178 INFO L290 TraceCheckUtils]: 24: Hoare triple {95338#true} assume 8464 == #t~mem55;havoc #t~mem55; {95338#true} is VALID [2022-04-28 15:38:52,178 INFO L290 TraceCheckUtils]: 25: Hoare triple {95338#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {95338#true} is VALID [2022-04-28 15:38:52,178 INFO L290 TraceCheckUtils]: 26: Hoare triple {95338#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {95338#true} is VALID [2022-04-28 15:38:52,178 INFO L290 TraceCheckUtils]: 27: Hoare triple {95338#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {95338#true} is VALID [2022-04-28 15:38:52,178 INFO L290 TraceCheckUtils]: 28: Hoare triple {95338#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {95338#true} is VALID [2022-04-28 15:38:52,178 INFO L290 TraceCheckUtils]: 29: Hoare triple {95338#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {95338#true} is VALID [2022-04-28 15:38:52,178 INFO L290 TraceCheckUtils]: 30: Hoare triple {95338#true} ~skip~0 := 0; {95338#true} is VALID [2022-04-28 15:38:52,179 INFO L290 TraceCheckUtils]: 31: Hoare triple {95338#true} assume !false; {95338#true} is VALID [2022-04-28 15:38:52,179 INFO L290 TraceCheckUtils]: 32: Hoare triple {95338#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {95338#true} is VALID [2022-04-28 15:38:52,179 INFO L290 TraceCheckUtils]: 33: Hoare triple {95338#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {95338#true} is VALID [2022-04-28 15:38:52,179 INFO L290 TraceCheckUtils]: 34: Hoare triple {95338#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {95338#true} is VALID [2022-04-28 15:38:52,179 INFO L290 TraceCheckUtils]: 35: Hoare triple {95338#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {95338#true} is VALID [2022-04-28 15:38:52,179 INFO L290 TraceCheckUtils]: 36: Hoare triple {95338#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {95338#true} is VALID [2022-04-28 15:38:52,179 INFO L290 TraceCheckUtils]: 37: Hoare triple {95338#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {95338#true} is VALID [2022-04-28 15:38:52,179 INFO L290 TraceCheckUtils]: 38: Hoare triple {95338#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {95338#true} is VALID [2022-04-28 15:38:52,179 INFO L290 TraceCheckUtils]: 39: Hoare triple {95338#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {95338#true} is VALID [2022-04-28 15:38:52,179 INFO L290 TraceCheckUtils]: 40: Hoare triple {95338#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {95338#true} is VALID [2022-04-28 15:38:52,179 INFO L290 TraceCheckUtils]: 41: Hoare triple {95338#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {95338#true} is VALID [2022-04-28 15:38:52,179 INFO L290 TraceCheckUtils]: 42: Hoare triple {95338#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {95338#true} is VALID [2022-04-28 15:38:52,179 INFO L290 TraceCheckUtils]: 43: Hoare triple {95338#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {95338#true} is VALID [2022-04-28 15:38:52,179 INFO L290 TraceCheckUtils]: 44: Hoare triple {95338#true} assume 8496 == #t~mem58;havoc #t~mem58; {95338#true} is VALID [2022-04-28 15:38:52,179 INFO L290 TraceCheckUtils]: 45: Hoare triple {95338#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {95338#true} is VALID [2022-04-28 15:38:52,180 INFO L290 TraceCheckUtils]: 46: Hoare triple {95338#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {95338#true} is VALID [2022-04-28 15:38:52,180 INFO L290 TraceCheckUtils]: 47: Hoare triple {95338#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {95338#true} is VALID [2022-04-28 15:38:52,180 INFO L290 TraceCheckUtils]: 48: Hoare triple {95338#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {95343#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:38:52,181 INFO L290 TraceCheckUtils]: 49: Hoare triple {95343#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {95343#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:38:52,181 INFO L290 TraceCheckUtils]: 50: Hoare triple {95343#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {95343#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:38:52,182 INFO L290 TraceCheckUtils]: 51: Hoare triple {95343#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {95343#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:38:52,182 INFO L290 TraceCheckUtils]: 52: Hoare triple {95343#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} ~skip~0 := 0; {95343#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:38:52,182 INFO L290 TraceCheckUtils]: 53: Hoare triple {95343#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !false; {95343#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:38:52,182 INFO L290 TraceCheckUtils]: 54: Hoare triple {95343#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {95343#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:38:52,183 INFO L290 TraceCheckUtils]: 55: Hoare triple {95343#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {95343#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:38:52,183 INFO L290 TraceCheckUtils]: 56: Hoare triple {95343#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {95343#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:38:52,183 INFO L290 TraceCheckUtils]: 57: Hoare triple {95343#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {95343#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:38:52,184 INFO L290 TraceCheckUtils]: 58: Hoare triple {95343#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {95343#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:38:52,184 INFO L290 TraceCheckUtils]: 59: Hoare triple {95343#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {95343#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:38:52,184 INFO L290 TraceCheckUtils]: 60: Hoare triple {95343#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {95343#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:38:52,185 INFO L290 TraceCheckUtils]: 61: Hoare triple {95343#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {95343#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:38:52,185 INFO L290 TraceCheckUtils]: 62: Hoare triple {95343#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {95343#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:38:52,185 INFO L290 TraceCheckUtils]: 63: Hoare triple {95343#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {95343#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:38:52,186 INFO L290 TraceCheckUtils]: 64: Hoare triple {95343#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {95343#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:38:52,186 INFO L290 TraceCheckUtils]: 65: Hoare triple {95343#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {95343#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:38:52,186 INFO L290 TraceCheckUtils]: 66: Hoare triple {95343#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {95343#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:38:52,187 INFO L290 TraceCheckUtils]: 67: Hoare triple {95343#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {95343#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:38:52,187 INFO L290 TraceCheckUtils]: 68: Hoare triple {95343#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {95343#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:38:52,187 INFO L290 TraceCheckUtils]: 69: Hoare triple {95343#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {95343#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:38:52,188 INFO L290 TraceCheckUtils]: 70: Hoare triple {95343#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {95343#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:38:52,188 INFO L290 TraceCheckUtils]: 71: Hoare triple {95343#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {95343#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:38:52,188 INFO L290 TraceCheckUtils]: 72: Hoare triple {95343#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {95343#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:38:52,188 INFO L290 TraceCheckUtils]: 73: Hoare triple {95343#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {95343#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:38:52,189 INFO L290 TraceCheckUtils]: 74: Hoare triple {95343#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {95343#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:38:52,189 INFO L290 TraceCheckUtils]: 75: Hoare triple {95343#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {95343#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:38:52,189 INFO L290 TraceCheckUtils]: 76: Hoare triple {95343#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {95343#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:38:52,190 INFO L290 TraceCheckUtils]: 77: Hoare triple {95343#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {95343#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:38:52,190 INFO L290 TraceCheckUtils]: 78: Hoare triple {95343#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {95343#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:38:52,190 INFO L290 TraceCheckUtils]: 79: Hoare triple {95343#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {95343#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:38:52,191 INFO L290 TraceCheckUtils]: 80: Hoare triple {95343#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {95343#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:38:52,191 INFO L290 TraceCheckUtils]: 81: Hoare triple {95343#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {95344#(not (= |ssl3_accept_#t~mem74| 8609))} is VALID [2022-04-28 15:38:52,191 INFO L290 TraceCheckUtils]: 82: Hoare triple {95344#(not (= |ssl3_accept_#t~mem74| 8609))} assume 8609 == #t~mem74;havoc #t~mem74; {95339#false} is VALID [2022-04-28 15:38:52,191 INFO L290 TraceCheckUtils]: 83: Hoare triple {95339#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {95339#false} is VALID [2022-04-28 15:38:52,191 INFO L290 TraceCheckUtils]: 84: Hoare triple {95339#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {95339#false} is VALID [2022-04-28 15:38:52,191 INFO L290 TraceCheckUtils]: 85: Hoare triple {95339#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {95339#false} is VALID [2022-04-28 15:38:52,192 INFO L290 TraceCheckUtils]: 86: Hoare triple {95339#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {95339#false} is VALID [2022-04-28 15:38:52,192 INFO L290 TraceCheckUtils]: 87: Hoare triple {95339#false} ~skip~0 := 0; {95339#false} is VALID [2022-04-28 15:38:52,192 INFO L290 TraceCheckUtils]: 88: Hoare triple {95339#false} assume !false; {95339#false} is VALID [2022-04-28 15:38:52,192 INFO L290 TraceCheckUtils]: 89: Hoare triple {95339#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {95339#false} is VALID [2022-04-28 15:38:52,192 INFO L290 TraceCheckUtils]: 90: Hoare triple {95339#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {95339#false} is VALID [2022-04-28 15:38:52,192 INFO L290 TraceCheckUtils]: 91: Hoare triple {95339#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {95339#false} is VALID [2022-04-28 15:38:52,192 INFO L290 TraceCheckUtils]: 92: Hoare triple {95339#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {95339#false} is VALID [2022-04-28 15:38:52,192 INFO L290 TraceCheckUtils]: 93: Hoare triple {95339#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {95339#false} is VALID [2022-04-28 15:38:52,192 INFO L290 TraceCheckUtils]: 94: Hoare triple {95339#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {95339#false} is VALID [2022-04-28 15:38:52,192 INFO L290 TraceCheckUtils]: 95: Hoare triple {95339#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {95339#false} is VALID [2022-04-28 15:38:52,192 INFO L290 TraceCheckUtils]: 96: Hoare triple {95339#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {95339#false} is VALID [2022-04-28 15:38:52,192 INFO L290 TraceCheckUtils]: 97: Hoare triple {95339#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {95339#false} is VALID [2022-04-28 15:38:52,192 INFO L290 TraceCheckUtils]: 98: Hoare triple {95339#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {95339#false} is VALID [2022-04-28 15:38:52,192 INFO L290 TraceCheckUtils]: 99: Hoare triple {95339#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {95339#false} is VALID [2022-04-28 15:38:52,192 INFO L290 TraceCheckUtils]: 100: Hoare triple {95339#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {95339#false} is VALID [2022-04-28 15:38:52,193 INFO L290 TraceCheckUtils]: 101: Hoare triple {95339#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {95339#false} is VALID [2022-04-28 15:38:52,193 INFO L290 TraceCheckUtils]: 102: Hoare triple {95339#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {95339#false} is VALID [2022-04-28 15:38:52,193 INFO L290 TraceCheckUtils]: 103: Hoare triple {95339#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {95339#false} is VALID [2022-04-28 15:38:52,193 INFO L290 TraceCheckUtils]: 104: Hoare triple {95339#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {95339#false} is VALID [2022-04-28 15:38:52,193 INFO L290 TraceCheckUtils]: 105: Hoare triple {95339#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {95339#false} is VALID [2022-04-28 15:38:52,193 INFO L290 TraceCheckUtils]: 106: Hoare triple {95339#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {95339#false} is VALID [2022-04-28 15:38:52,193 INFO L290 TraceCheckUtils]: 107: Hoare triple {95339#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {95339#false} is VALID [2022-04-28 15:38:52,193 INFO L290 TraceCheckUtils]: 108: Hoare triple {95339#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {95339#false} is VALID [2022-04-28 15:38:52,193 INFO L290 TraceCheckUtils]: 109: Hoare triple {95339#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {95339#false} is VALID [2022-04-28 15:38:52,193 INFO L290 TraceCheckUtils]: 110: Hoare triple {95339#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {95339#false} is VALID [2022-04-28 15:38:52,193 INFO L290 TraceCheckUtils]: 111: Hoare triple {95339#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {95339#false} is VALID [2022-04-28 15:38:52,193 INFO L290 TraceCheckUtils]: 112: Hoare triple {95339#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {95339#false} is VALID [2022-04-28 15:38:52,193 INFO L290 TraceCheckUtils]: 113: Hoare triple {95339#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {95339#false} is VALID [2022-04-28 15:38:52,193 INFO L290 TraceCheckUtils]: 114: Hoare triple {95339#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {95339#false} is VALID [2022-04-28 15:38:52,193 INFO L290 TraceCheckUtils]: 115: Hoare triple {95339#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {95339#false} is VALID [2022-04-28 15:38:52,194 INFO L290 TraceCheckUtils]: 116: Hoare triple {95339#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {95339#false} is VALID [2022-04-28 15:38:52,194 INFO L290 TraceCheckUtils]: 117: Hoare triple {95339#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {95339#false} is VALID [2022-04-28 15:38:52,194 INFO L290 TraceCheckUtils]: 118: Hoare triple {95339#false} assume 8640 == #t~mem75;havoc #t~mem75; {95339#false} is VALID [2022-04-28 15:38:52,194 INFO L290 TraceCheckUtils]: 119: Hoare triple {95339#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {95339#false} is VALID [2022-04-28 15:38:52,194 INFO L290 TraceCheckUtils]: 120: Hoare triple {95339#false} assume !(4 == ~blastFlag~0); {95339#false} is VALID [2022-04-28 15:38:52,194 INFO L290 TraceCheckUtils]: 121: Hoare triple {95339#false} assume !(7 == ~blastFlag~0); {95339#false} is VALID [2022-04-28 15:38:52,194 INFO L290 TraceCheckUtils]: 122: Hoare triple {95339#false} assume !(10 == ~blastFlag~0); {95339#false} is VALID [2022-04-28 15:38:52,194 INFO L290 TraceCheckUtils]: 123: Hoare triple {95339#false} assume !false; {95339#false} is VALID [2022-04-28 15:38:52,194 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-28 15:38:52,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:38:52,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515224678] [2022-04-28 15:38:52,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515224678] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:38:52,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:38:52,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:38:52,195 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:38:52,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [945050462] [2022-04-28 15:38:52,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [945050462] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:38:52,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:38:52,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:38:52,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236494705] [2022-04-28 15:38:52,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:38:52,195 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 124 [2022-04-28 15:38:52,196 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:38:52,196 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-28 15:38:52,268 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-28 15:38:52,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:38:52,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:38:52,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:38:52,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:38:52,268 INFO L87 Difference]: Start difference. First operand 590 states and 856 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-28 15:38:54,583 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-28 15:38:56,664 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:39:00,248 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:39:01,922 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:39:02,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:39:02,995 INFO L93 Difference]: Finished difference Result 1224 states and 1784 transitions. [2022-04-28 15:39:02,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:39:02,995 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 124 [2022-04-28 15:39:02,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:39:02,996 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-28 15:39:02,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 586 transitions. [2022-04-28 15:39:02,998 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-28 15:39:03,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 586 transitions. [2022-04-28 15:39:03,000 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 586 transitions. [2022-04-28 15:39:03,247 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-28 15:39:03,263 INFO L225 Difference]: With dead ends: 1224 [2022-04-28 15:39:03,263 INFO L226 Difference]: Without dead ends: 660 [2022-04-28 15:39:03,264 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-28 15:39:03,264 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 111 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:39:03,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 392 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2022-04-28 15:39:03,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2022-04-28 15:39:03,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 591. [2022-04-28 15:39:03,299 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:39:03,300 INFO L82 GeneralOperation]: Start isEquivalent. First operand 660 states. Second operand has 591 states, 586 states have (on average 1.4522184300341296) internal successors, (851), 586 states have internal predecessors, (851), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:39:03,300 INFO L74 IsIncluded]: Start isIncluded. First operand 660 states. Second operand has 591 states, 586 states have (on average 1.4522184300341296) internal successors, (851), 586 states have internal predecessors, (851), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:39:03,301 INFO L87 Difference]: Start difference. First operand 660 states. Second operand has 591 states, 586 states have (on average 1.4522184300341296) internal successors, (851), 586 states have internal predecessors, (851), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:39:03,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:39:03,313 INFO L93 Difference]: Finished difference Result 660 states and 955 transitions. [2022-04-28 15:39:03,313 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 955 transitions. [2022-04-28 15:39:03,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:39:03,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:39:03,314 INFO L74 IsIncluded]: Start isIncluded. First operand has 591 states, 586 states have (on average 1.4522184300341296) internal successors, (851), 586 states have internal predecessors, (851), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 660 states. [2022-04-28 15:39:03,314 INFO L87 Difference]: Start difference. First operand has 591 states, 586 states have (on average 1.4522184300341296) internal successors, (851), 586 states have internal predecessors, (851), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 660 states. [2022-04-28 15:39:03,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:39:03,341 INFO L93 Difference]: Finished difference Result 660 states and 955 transitions. [2022-04-28 15:39:03,341 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 955 transitions. [2022-04-28 15:39:03,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:39:03,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:39:03,342 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:39:03,342 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:39:03,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 586 states have (on average 1.4522184300341296) internal successors, (851), 586 states have internal predecessors, (851), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:39:03,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 855 transitions. [2022-04-28 15:39:03,357 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 855 transitions. Word has length 124 [2022-04-28 15:39:03,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:39:03,357 INFO L495 AbstractCegarLoop]: Abstraction has 591 states and 855 transitions. [2022-04-28 15:39:03,357 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-28 15:39:03,357 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 591 states and 855 transitions. [2022-04-28 15:39:04,033 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 855 edges. 855 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:39:04,033 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 855 transitions. [2022-04-28 15:39:04,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-28 15:39:04,034 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:39:04,034 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, 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-28 15:39:04,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-04-28 15:39:04,034 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:39:04,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:39:04,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1548123447, now seen corresponding path program 1 times [2022-04-28 15:39:04,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:39:04,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [438891124] [2022-04-28 15:39:04,110 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:39:04,110 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:39:04,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1548123447, now seen corresponding path program 2 times [2022-04-28 15:39:04,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:39:04,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790742426] [2022-04-28 15:39:04,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:39:04,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:39:04,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:39:04,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:39:04,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:39:04,214 INFO L290 TraceCheckUtils]: 0: Hoare triple {100307#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {100300#true} is VALID [2022-04-28 15:39:04,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {100300#true} assume true; {100300#true} is VALID [2022-04-28 15:39:04,214 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {100300#true} {100300#true} #703#return; {100300#true} is VALID [2022-04-28 15:39:04,215 INFO L272 TraceCheckUtils]: 0: Hoare triple {100300#true} call ULTIMATE.init(); {100307#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-28 15:39:04,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {100307#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {100300#true} is VALID [2022-04-28 15:39:04,215 INFO L290 TraceCheckUtils]: 2: Hoare triple {100300#true} assume true; {100300#true} is VALID [2022-04-28 15:39:04,215 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {100300#true} {100300#true} #703#return; {100300#true} is VALID [2022-04-28 15:39:04,215 INFO L272 TraceCheckUtils]: 4: Hoare triple {100300#true} call #t~ret161 := main(); {100300#true} is VALID [2022-04-28 15:39:04,215 INFO L290 TraceCheckUtils]: 5: Hoare triple {100300#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {100300#true} is VALID [2022-04-28 15:39:04,215 INFO L290 TraceCheckUtils]: 6: Hoare triple {100300#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {100300#true} is VALID [2022-04-28 15:39:04,215 INFO L272 TraceCheckUtils]: 7: Hoare triple {100300#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {100300#true} is VALID [2022-04-28 15:39:04,215 INFO L290 TraceCheckUtils]: 8: Hoare triple {100300#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {100300#true} is VALID [2022-04-28 15:39:04,215 INFO L290 TraceCheckUtils]: 9: Hoare triple {100300#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {100300#true} is VALID [2022-04-28 15:39:04,215 INFO L290 TraceCheckUtils]: 10: Hoare triple {100300#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {100300#true} is VALID [2022-04-28 15:39:04,216 INFO L290 TraceCheckUtils]: 11: Hoare triple {100300#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {100300#true} is VALID [2022-04-28 15:39:04,216 INFO L290 TraceCheckUtils]: 12: Hoare triple {100300#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {100300#true} is VALID [2022-04-28 15:39:04,216 INFO L290 TraceCheckUtils]: 13: Hoare triple {100300#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {100300#true} is VALID [2022-04-28 15:39:04,216 INFO L290 TraceCheckUtils]: 14: Hoare triple {100300#true} assume !false; {100300#true} is VALID [2022-04-28 15:39:04,216 INFO L290 TraceCheckUtils]: 15: Hoare triple {100300#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {100300#true} is VALID [2022-04-28 15:39:04,216 INFO L290 TraceCheckUtils]: 16: Hoare triple {100300#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {100300#true} is VALID [2022-04-28 15:39:04,216 INFO L290 TraceCheckUtils]: 17: Hoare triple {100300#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {100300#true} is VALID [2022-04-28 15:39:04,216 INFO L290 TraceCheckUtils]: 18: Hoare triple {100300#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {100300#true} is VALID [2022-04-28 15:39:04,216 INFO L290 TraceCheckUtils]: 19: Hoare triple {100300#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {100300#true} is VALID [2022-04-28 15:39:04,216 INFO L290 TraceCheckUtils]: 20: Hoare triple {100300#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {100300#true} is VALID [2022-04-28 15:39:04,216 INFO L290 TraceCheckUtils]: 21: Hoare triple {100300#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {100300#true} is VALID [2022-04-28 15:39:04,216 INFO L290 TraceCheckUtils]: 22: Hoare triple {100300#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {100300#true} is VALID [2022-04-28 15:39:04,216 INFO L290 TraceCheckUtils]: 23: Hoare triple {100300#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {100300#true} is VALID [2022-04-28 15:39:04,216 INFO L290 TraceCheckUtils]: 24: Hoare triple {100300#true} assume 8464 == #t~mem55;havoc #t~mem55; {100300#true} is VALID [2022-04-28 15:39:04,216 INFO L290 TraceCheckUtils]: 25: Hoare triple {100300#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {100300#true} is VALID [2022-04-28 15:39:04,216 INFO L290 TraceCheckUtils]: 26: Hoare triple {100300#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {100300#true} is VALID [2022-04-28 15:39:04,217 INFO L290 TraceCheckUtils]: 27: Hoare triple {100300#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {100300#true} is VALID [2022-04-28 15:39:04,217 INFO L290 TraceCheckUtils]: 28: Hoare triple {100300#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {100300#true} is VALID [2022-04-28 15:39:04,217 INFO L290 TraceCheckUtils]: 29: Hoare triple {100300#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {100300#true} is VALID [2022-04-28 15:39:04,217 INFO L290 TraceCheckUtils]: 30: Hoare triple {100300#true} ~skip~0 := 0; {100300#true} is VALID [2022-04-28 15:39:04,217 INFO L290 TraceCheckUtils]: 31: Hoare triple {100300#true} assume !false; {100300#true} is VALID [2022-04-28 15:39:04,217 INFO L290 TraceCheckUtils]: 32: Hoare triple {100300#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {100300#true} is VALID [2022-04-28 15:39:04,217 INFO L290 TraceCheckUtils]: 33: Hoare triple {100300#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {100300#true} is VALID [2022-04-28 15:39:04,217 INFO L290 TraceCheckUtils]: 34: Hoare triple {100300#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {100300#true} is VALID [2022-04-28 15:39:04,217 INFO L290 TraceCheckUtils]: 35: Hoare triple {100300#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {100300#true} is VALID [2022-04-28 15:39:04,217 INFO L290 TraceCheckUtils]: 36: Hoare triple {100300#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {100300#true} is VALID [2022-04-28 15:39:04,217 INFO L290 TraceCheckUtils]: 37: Hoare triple {100300#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {100300#true} is VALID [2022-04-28 15:39:04,217 INFO L290 TraceCheckUtils]: 38: Hoare triple {100300#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {100300#true} is VALID [2022-04-28 15:39:04,217 INFO L290 TraceCheckUtils]: 39: Hoare triple {100300#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {100300#true} is VALID [2022-04-28 15:39:04,217 INFO L290 TraceCheckUtils]: 40: Hoare triple {100300#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {100300#true} is VALID [2022-04-28 15:39:04,217 INFO L290 TraceCheckUtils]: 41: Hoare triple {100300#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {100300#true} is VALID [2022-04-28 15:39:04,218 INFO L290 TraceCheckUtils]: 42: Hoare triple {100300#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {100300#true} is VALID [2022-04-28 15:39:04,218 INFO L290 TraceCheckUtils]: 43: Hoare triple {100300#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {100300#true} is VALID [2022-04-28 15:39:04,218 INFO L290 TraceCheckUtils]: 44: Hoare triple {100300#true} assume 8496 == #t~mem58;havoc #t~mem58; {100300#true} is VALID [2022-04-28 15:39:04,218 INFO L290 TraceCheckUtils]: 45: Hoare triple {100300#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {100300#true} is VALID [2022-04-28 15:39:04,218 INFO L290 TraceCheckUtils]: 46: Hoare triple {100300#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {100300#true} is VALID [2022-04-28 15:39:04,218 INFO L290 TraceCheckUtils]: 47: Hoare triple {100300#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {100300#true} is VALID [2022-04-28 15:39:04,218 INFO L290 TraceCheckUtils]: 48: Hoare triple {100300#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {100300#true} is VALID [2022-04-28 15:39:04,218 INFO L290 TraceCheckUtils]: 49: Hoare triple {100300#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {100300#true} is VALID [2022-04-28 15:39:04,218 INFO L290 TraceCheckUtils]: 50: Hoare triple {100300#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {100300#true} is VALID [2022-04-28 15:39:04,218 INFO L290 TraceCheckUtils]: 51: Hoare triple {100300#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {100300#true} is VALID [2022-04-28 15:39:04,218 INFO L290 TraceCheckUtils]: 52: Hoare triple {100300#true} ~skip~0 := 0; {100300#true} is VALID [2022-04-28 15:39:04,218 INFO L290 TraceCheckUtils]: 53: Hoare triple {100300#true} assume !false; {100300#true} is VALID [2022-04-28 15:39:04,218 INFO L290 TraceCheckUtils]: 54: Hoare triple {100300#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {100300#true} is VALID [2022-04-28 15:39:04,218 INFO L290 TraceCheckUtils]: 55: Hoare triple {100300#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {100300#true} is VALID [2022-04-28 15:39:04,219 INFO L290 TraceCheckUtils]: 56: Hoare triple {100300#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {100300#true} is VALID [2022-04-28 15:39:04,219 INFO L290 TraceCheckUtils]: 57: Hoare triple {100300#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {100300#true} is VALID [2022-04-28 15:39:04,219 INFO L290 TraceCheckUtils]: 58: Hoare triple {100300#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {100300#true} is VALID [2022-04-28 15:39:04,219 INFO L290 TraceCheckUtils]: 59: Hoare triple {100300#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {100300#true} is VALID [2022-04-28 15:39:04,219 INFO L290 TraceCheckUtils]: 60: Hoare triple {100300#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {100300#true} is VALID [2022-04-28 15:39:04,219 INFO L290 TraceCheckUtils]: 61: Hoare triple {100300#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {100300#true} is VALID [2022-04-28 15:39:04,219 INFO L290 TraceCheckUtils]: 62: Hoare triple {100300#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {100300#true} is VALID [2022-04-28 15:39:04,219 INFO L290 TraceCheckUtils]: 63: Hoare triple {100300#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {100300#true} is VALID [2022-04-28 15:39:04,219 INFO L290 TraceCheckUtils]: 64: Hoare triple {100300#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {100300#true} is VALID [2022-04-28 15:39:04,219 INFO L290 TraceCheckUtils]: 65: Hoare triple {100300#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {100300#true} is VALID [2022-04-28 15:39:04,219 INFO L290 TraceCheckUtils]: 66: Hoare triple {100300#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {100300#true} is VALID [2022-04-28 15:39:04,219 INFO L290 TraceCheckUtils]: 67: Hoare triple {100300#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {100300#true} is VALID [2022-04-28 15:39:04,219 INFO L290 TraceCheckUtils]: 68: Hoare triple {100300#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {100300#true} is VALID [2022-04-28 15:39:04,219 INFO L290 TraceCheckUtils]: 69: Hoare triple {100300#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {100300#true} is VALID [2022-04-28 15:39:04,219 INFO L290 TraceCheckUtils]: 70: Hoare triple {100300#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {100300#true} is VALID [2022-04-28 15:39:04,220 INFO L290 TraceCheckUtils]: 71: Hoare triple {100300#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {100300#true} is VALID [2022-04-28 15:39:04,220 INFO L290 TraceCheckUtils]: 72: Hoare triple {100300#true} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {100300#true} is VALID [2022-04-28 15:39:04,220 INFO L290 TraceCheckUtils]: 73: Hoare triple {100300#true} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {100300#true} is VALID [2022-04-28 15:39:04,220 INFO L290 TraceCheckUtils]: 74: Hoare triple {100300#true} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {100300#true} is VALID [2022-04-28 15:39:04,220 INFO L290 TraceCheckUtils]: 75: Hoare triple {100300#true} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {100300#true} is VALID [2022-04-28 15:39:04,220 INFO L290 TraceCheckUtils]: 76: Hoare triple {100300#true} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {100300#true} is VALID [2022-04-28 15:39:04,220 INFO L290 TraceCheckUtils]: 77: Hoare triple {100300#true} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {100300#true} is VALID [2022-04-28 15:39:04,220 INFO L290 TraceCheckUtils]: 78: Hoare triple {100300#true} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {100300#true} is VALID [2022-04-28 15:39:04,220 INFO L290 TraceCheckUtils]: 79: Hoare triple {100300#true} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {100300#true} is VALID [2022-04-28 15:39:04,220 INFO L290 TraceCheckUtils]: 80: Hoare triple {100300#true} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {100300#true} is VALID [2022-04-28 15:39:04,220 INFO L290 TraceCheckUtils]: 81: Hoare triple {100300#true} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {100300#true} is VALID [2022-04-28 15:39:04,220 INFO L290 TraceCheckUtils]: 82: Hoare triple {100300#true} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {100300#true} is VALID [2022-04-28 15:39:04,220 INFO L290 TraceCheckUtils]: 83: Hoare triple {100300#true} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {100300#true} is VALID [2022-04-28 15:39:04,220 INFO L290 TraceCheckUtils]: 84: Hoare triple {100300#true} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {100300#true} is VALID [2022-04-28 15:39:04,220 INFO L290 TraceCheckUtils]: 85: Hoare triple {100300#true} assume 8656 == #t~mem77;havoc #t~mem77; {100300#true} is VALID [2022-04-28 15:39:04,221 INFO L290 TraceCheckUtils]: 86: Hoare triple {100300#true} call #t~mem140.base, #t~mem140.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem141.base, #t~mem141.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem142.base, #t~mem142.offset := read~$Pointer$(#t~mem141.base, 888 + #t~mem141.offset, 8);call write~$Pointer$(#t~mem142.base, #t~mem142.offset, #t~mem140.base, 192 + #t~mem140.offset, 8);havoc #t~mem140.base, #t~mem140.offset;havoc #t~mem141.base, #t~mem141.offset;havoc #t~mem142.base, #t~mem142.offset; {100300#true} is VALID [2022-04-28 15:39:04,221 INFO L290 TraceCheckUtils]: 87: Hoare triple {100300#true} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {100300#true} is VALID [2022-04-28 15:39:04,221 INFO L290 TraceCheckUtils]: 88: Hoare triple {100300#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {100300#true} is VALID [2022-04-28 15:39:04,222 INFO L290 TraceCheckUtils]: 89: Hoare triple {100300#true} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:39:04,222 INFO L290 TraceCheckUtils]: 90: Hoare triple {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(0 == ~tmp___10~0); {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:39:04,222 INFO L290 TraceCheckUtils]: 91: Hoare triple {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:39:04,223 INFO L290 TraceCheckUtils]: 92: Hoare triple {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:39:04,223 INFO L290 TraceCheckUtils]: 93: Hoare triple {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} ~skip~0 := 0; {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:39:04,223 INFO L290 TraceCheckUtils]: 94: Hoare triple {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !false; {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:39:04,224 INFO L290 TraceCheckUtils]: 95: Hoare triple {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:39:04,224 INFO L290 TraceCheckUtils]: 96: Hoare triple {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:39:04,224 INFO L290 TraceCheckUtils]: 97: Hoare triple {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:39:04,225 INFO L290 TraceCheckUtils]: 98: Hoare triple {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:39:04,225 INFO L290 TraceCheckUtils]: 99: Hoare triple {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:39:04,225 INFO L290 TraceCheckUtils]: 100: Hoare triple {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:39:04,226 INFO L290 TraceCheckUtils]: 101: Hoare triple {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:39:04,226 INFO L290 TraceCheckUtils]: 102: Hoare triple {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:39:04,226 INFO L290 TraceCheckUtils]: 103: Hoare triple {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:39:04,227 INFO L290 TraceCheckUtils]: 104: Hoare triple {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:39:04,227 INFO L290 TraceCheckUtils]: 105: Hoare triple {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:39:04,227 INFO L290 TraceCheckUtils]: 106: Hoare triple {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:39:04,228 INFO L290 TraceCheckUtils]: 107: Hoare triple {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:39:04,228 INFO L290 TraceCheckUtils]: 108: Hoare triple {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:39:04,228 INFO L290 TraceCheckUtils]: 109: Hoare triple {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:39:04,229 INFO L290 TraceCheckUtils]: 110: Hoare triple {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:39:04,229 INFO L290 TraceCheckUtils]: 111: Hoare triple {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:39:04,229 INFO L290 TraceCheckUtils]: 112: Hoare triple {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:39:04,230 INFO L290 TraceCheckUtils]: 113: Hoare triple {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:39:04,230 INFO L290 TraceCheckUtils]: 114: Hoare triple {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:39:04,230 INFO L290 TraceCheckUtils]: 115: Hoare triple {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:39:04,231 INFO L290 TraceCheckUtils]: 116: Hoare triple {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:39:04,231 INFO L290 TraceCheckUtils]: 117: Hoare triple {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:39:04,231 INFO L290 TraceCheckUtils]: 118: Hoare triple {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:39:04,232 INFO L290 TraceCheckUtils]: 119: Hoare triple {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:39:04,232 INFO L290 TraceCheckUtils]: 120: Hoare triple {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:39:04,232 INFO L290 TraceCheckUtils]: 121: Hoare triple {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:39:04,233 INFO L290 TraceCheckUtils]: 122: Hoare triple {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:39:04,233 INFO L290 TraceCheckUtils]: 123: Hoare triple {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:39:04,233 INFO L290 TraceCheckUtils]: 124: Hoare triple {100305#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {100306#(not (= |ssl3_accept_#t~mem76| 8641))} is VALID [2022-04-28 15:39:04,234 INFO L290 TraceCheckUtils]: 125: Hoare triple {100306#(not (= |ssl3_accept_#t~mem76| 8641))} assume 8641 == #t~mem76;havoc #t~mem76; {100301#false} is VALID [2022-04-28 15:39:04,234 INFO L290 TraceCheckUtils]: 126: Hoare triple {100301#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {100301#false} is VALID [2022-04-28 15:39:04,234 INFO L290 TraceCheckUtils]: 127: Hoare triple {100301#false} assume !(4 == ~blastFlag~0); {100301#false} is VALID [2022-04-28 15:39:04,234 INFO L290 TraceCheckUtils]: 128: Hoare triple {100301#false} assume !(7 == ~blastFlag~0); {100301#false} is VALID [2022-04-28 15:39:04,234 INFO L290 TraceCheckUtils]: 129: Hoare triple {100301#false} assume !(10 == ~blastFlag~0); {100301#false} is VALID [2022-04-28 15:39:04,234 INFO L290 TraceCheckUtils]: 130: Hoare triple {100301#false} assume !false; {100301#false} is VALID [2022-04-28 15:39:04,234 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-28 15:39:04,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:39:04,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790742426] [2022-04-28 15:39:04,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790742426] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:39:04,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:39:04,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:39:04,235 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:39:04,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [438891124] [2022-04-28 15:39:04,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [438891124] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:39:04,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:39:04,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:39:04,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940153052] [2022-04-28 15:39:04,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:39:04,236 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (3), 2 states have 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-28 15:39:04,236 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:39:04,236 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:39:04,312 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:39:04,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:39:04,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:39:04,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:39:04,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:39:04,313 INFO L87 Difference]: Start difference. First operand 591 states and 855 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:39:07,641 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:39:09,670 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:39:11,693 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:39:12,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:39:12,878 INFO L93 Difference]: Finished difference Result 1225 states and 1780 transitions. [2022-04-28 15:39:12,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:39:12,878 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (3), 2 states have 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-28 15:39:12,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:39:12,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:39:12,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 585 transitions. [2022-04-28 15:39:12,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:39:12,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 585 transitions. [2022-04-28 15:39:12,882 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 585 transitions. [2022-04-28 15:39:13,267 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-28 15:39:13,284 INFO L225 Difference]: With dead ends: 1225 [2022-04-28 15:39:13,285 INFO L226 Difference]: Without dead ends: 660 [2022-04-28 15:39:13,285 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-28 15:39:13,286 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 107 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 55 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-04-28 15:39:13,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 392 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 469 Invalid, 3 Unknown, 0 Unchecked, 6.9s Time] [2022-04-28 15:39:13,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2022-04-28 15:39:13,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 589. [2022-04-28 15:39:13,318 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:39:13,319 INFO L82 GeneralOperation]: Start isEquivalent. First operand 660 states. Second operand has 589 states, 584 states have (on average 1.4554794520547945) internal successors, (850), 584 states have internal predecessors, (850), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:39:13,319 INFO L74 IsIncluded]: Start isIncluded. First operand 660 states. Second operand has 589 states, 584 states have (on average 1.4554794520547945) internal successors, (850), 584 states have internal predecessors, (850), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:39:13,319 INFO L87 Difference]: Start difference. First operand 660 states. Second operand has 589 states, 584 states have (on average 1.4554794520547945) internal successors, (850), 584 states have internal predecessors, (850), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:39:13,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:39:13,331 INFO L93 Difference]: Finished difference Result 660 states and 954 transitions. [2022-04-28 15:39:13,331 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 954 transitions. [2022-04-28 15:39:13,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:39:13,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:39:13,332 INFO L74 IsIncluded]: Start isIncluded. First operand has 589 states, 584 states have (on average 1.4554794520547945) internal successors, (850), 584 states have internal predecessors, (850), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 660 states. [2022-04-28 15:39:13,332 INFO L87 Difference]: Start difference. First operand has 589 states, 584 states have (on average 1.4554794520547945) internal successors, (850), 584 states have internal predecessors, (850), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 660 states. [2022-04-28 15:39:13,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:39:13,344 INFO L93 Difference]: Finished difference Result 660 states and 954 transitions. [2022-04-28 15:39:13,344 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 954 transitions. [2022-04-28 15:39:13,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:39:13,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:39:13,344 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:39:13,344 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:39:13,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 584 states have (on average 1.4554794520547945) internal successors, (850), 584 states have internal predecessors, (850), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:39:13,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 854 transitions. [2022-04-28 15:39:13,358 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 854 transitions. Word has length 131 [2022-04-28 15:39:13,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:39:13,358 INFO L495 AbstractCegarLoop]: Abstraction has 589 states and 854 transitions. [2022-04-28 15:39:13,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:39:13,358 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 589 states and 854 transitions. [2022-04-28 15:39:14,072 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 854 edges. 854 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:39:14,072 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 854 transitions. [2022-04-28 15:39:14,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-28 15:39:14,072 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:39:14,073 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, 1] [2022-04-28 15:39:14,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-04-28 15:39:14,073 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:39:14,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:39:14,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1840054613, now seen corresponding path program 1 times [2022-04-28 15:39:14,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:39:14,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1234199515] [2022-04-28 15:39:14,137 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:39:14,137 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:39:14,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1840054613, now seen corresponding path program 2 times [2022-04-28 15:39:14,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:39:14,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555697955] [2022-04-28 15:39:14,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:39:14,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:39:14,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:39:14,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:39:14,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:39:14,260 INFO L290 TraceCheckUtils]: 0: Hoare triple {105267#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {105260#true} is VALID [2022-04-28 15:39:14,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {105260#true} assume true; {105260#true} is VALID [2022-04-28 15:39:14,261 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {105260#true} {105260#true} #703#return; {105260#true} is VALID [2022-04-28 15:39:14,261 INFO L272 TraceCheckUtils]: 0: Hoare triple {105260#true} call ULTIMATE.init(); {105267#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-28 15:39:14,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {105267#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {105260#true} is VALID [2022-04-28 15:39:14,261 INFO L290 TraceCheckUtils]: 2: Hoare triple {105260#true} assume true; {105260#true} is VALID [2022-04-28 15:39:14,261 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {105260#true} {105260#true} #703#return; {105260#true} is VALID [2022-04-28 15:39:14,262 INFO L272 TraceCheckUtils]: 4: Hoare triple {105260#true} call #t~ret161 := main(); {105260#true} is VALID [2022-04-28 15:39:14,262 INFO L290 TraceCheckUtils]: 5: Hoare triple {105260#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {105260#true} is VALID [2022-04-28 15:39:14,262 INFO L290 TraceCheckUtils]: 6: Hoare triple {105260#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {105260#true} is VALID [2022-04-28 15:39:14,262 INFO L272 TraceCheckUtils]: 7: Hoare triple {105260#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {105260#true} is VALID [2022-04-28 15:39:14,262 INFO L290 TraceCheckUtils]: 8: Hoare triple {105260#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {105260#true} is VALID [2022-04-28 15:39:14,262 INFO L290 TraceCheckUtils]: 9: Hoare triple {105260#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {105260#true} is VALID [2022-04-28 15:39:14,262 INFO L290 TraceCheckUtils]: 10: Hoare triple {105260#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {105260#true} is VALID [2022-04-28 15:39:14,262 INFO L290 TraceCheckUtils]: 11: Hoare triple {105260#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {105260#true} is VALID [2022-04-28 15:39:14,262 INFO L290 TraceCheckUtils]: 12: Hoare triple {105260#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {105260#true} is VALID [2022-04-28 15:39:14,262 INFO L290 TraceCheckUtils]: 13: Hoare triple {105260#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {105260#true} is VALID [2022-04-28 15:39:14,262 INFO L290 TraceCheckUtils]: 14: Hoare triple {105260#true} assume !false; {105260#true} is VALID [2022-04-28 15:39:14,262 INFO L290 TraceCheckUtils]: 15: Hoare triple {105260#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {105260#true} is VALID [2022-04-28 15:39:14,262 INFO L290 TraceCheckUtils]: 16: Hoare triple {105260#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {105260#true} is VALID [2022-04-28 15:39:14,262 INFO L290 TraceCheckUtils]: 17: Hoare triple {105260#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {105260#true} is VALID [2022-04-28 15:39:14,262 INFO L290 TraceCheckUtils]: 18: Hoare triple {105260#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {105260#true} is VALID [2022-04-28 15:39:14,263 INFO L290 TraceCheckUtils]: 19: Hoare triple {105260#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {105260#true} is VALID [2022-04-28 15:39:14,263 INFO L290 TraceCheckUtils]: 20: Hoare triple {105260#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {105260#true} is VALID [2022-04-28 15:39:14,263 INFO L290 TraceCheckUtils]: 21: Hoare triple {105260#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {105260#true} is VALID [2022-04-28 15:39:14,263 INFO L290 TraceCheckUtils]: 22: Hoare triple {105260#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {105260#true} is VALID [2022-04-28 15:39:14,263 INFO L290 TraceCheckUtils]: 23: Hoare triple {105260#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {105260#true} is VALID [2022-04-28 15:39:14,263 INFO L290 TraceCheckUtils]: 24: Hoare triple {105260#true} assume 8464 == #t~mem55;havoc #t~mem55; {105260#true} is VALID [2022-04-28 15:39:14,263 INFO L290 TraceCheckUtils]: 25: Hoare triple {105260#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {105260#true} is VALID [2022-04-28 15:39:14,263 INFO L290 TraceCheckUtils]: 26: Hoare triple {105260#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {105260#true} is VALID [2022-04-28 15:39:14,263 INFO L290 TraceCheckUtils]: 27: Hoare triple {105260#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {105260#true} is VALID [2022-04-28 15:39:14,263 INFO L290 TraceCheckUtils]: 28: Hoare triple {105260#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {105260#true} is VALID [2022-04-28 15:39:14,263 INFO L290 TraceCheckUtils]: 29: Hoare triple {105260#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {105260#true} is VALID [2022-04-28 15:39:14,263 INFO L290 TraceCheckUtils]: 30: Hoare triple {105260#true} ~skip~0 := 0; {105260#true} is VALID [2022-04-28 15:39:14,263 INFO L290 TraceCheckUtils]: 31: Hoare triple {105260#true} assume !false; {105260#true} is VALID [2022-04-28 15:39:14,263 INFO L290 TraceCheckUtils]: 32: Hoare triple {105260#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {105260#true} is VALID [2022-04-28 15:39:14,263 INFO L290 TraceCheckUtils]: 33: Hoare triple {105260#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {105260#true} is VALID [2022-04-28 15:39:14,264 INFO L290 TraceCheckUtils]: 34: Hoare triple {105260#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {105260#true} is VALID [2022-04-28 15:39:14,264 INFO L290 TraceCheckUtils]: 35: Hoare triple {105260#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {105260#true} is VALID [2022-04-28 15:39:14,264 INFO L290 TraceCheckUtils]: 36: Hoare triple {105260#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {105260#true} is VALID [2022-04-28 15:39:14,264 INFO L290 TraceCheckUtils]: 37: Hoare triple {105260#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {105260#true} is VALID [2022-04-28 15:39:14,264 INFO L290 TraceCheckUtils]: 38: Hoare triple {105260#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {105260#true} is VALID [2022-04-28 15:39:14,264 INFO L290 TraceCheckUtils]: 39: Hoare triple {105260#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {105260#true} is VALID [2022-04-28 15:39:14,264 INFO L290 TraceCheckUtils]: 40: Hoare triple {105260#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {105260#true} is VALID [2022-04-28 15:39:14,264 INFO L290 TraceCheckUtils]: 41: Hoare triple {105260#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {105260#true} is VALID [2022-04-28 15:39:14,264 INFO L290 TraceCheckUtils]: 42: Hoare triple {105260#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {105260#true} is VALID [2022-04-28 15:39:14,264 INFO L290 TraceCheckUtils]: 43: Hoare triple {105260#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {105260#true} is VALID [2022-04-28 15:39:14,264 INFO L290 TraceCheckUtils]: 44: Hoare triple {105260#true} assume 8496 == #t~mem58;havoc #t~mem58; {105260#true} is VALID [2022-04-28 15:39:14,264 INFO L290 TraceCheckUtils]: 45: Hoare triple {105260#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {105260#true} is VALID [2022-04-28 15:39:14,264 INFO L290 TraceCheckUtils]: 46: Hoare triple {105260#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {105260#true} is VALID [2022-04-28 15:39:14,264 INFO L290 TraceCheckUtils]: 47: Hoare triple {105260#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {105260#true} is VALID [2022-04-28 15:39:14,265 INFO L290 TraceCheckUtils]: 48: Hoare triple {105260#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:39:14,266 INFO L290 TraceCheckUtils]: 49: Hoare triple {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:39:14,266 INFO L290 TraceCheckUtils]: 50: Hoare triple {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:39:14,266 INFO L290 TraceCheckUtils]: 51: Hoare triple {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:39:14,267 INFO L290 TraceCheckUtils]: 52: Hoare triple {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} ~skip~0 := 0; {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:39:14,267 INFO L290 TraceCheckUtils]: 53: Hoare triple {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !false; {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:39:14,267 INFO L290 TraceCheckUtils]: 54: Hoare triple {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:39:14,267 INFO L290 TraceCheckUtils]: 55: Hoare triple {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:39:14,268 INFO L290 TraceCheckUtils]: 56: Hoare triple {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:39:14,268 INFO L290 TraceCheckUtils]: 57: Hoare triple {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:39:14,268 INFO L290 TraceCheckUtils]: 58: Hoare triple {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:39:14,269 INFO L290 TraceCheckUtils]: 59: Hoare triple {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:39:14,269 INFO L290 TraceCheckUtils]: 60: Hoare triple {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:39:14,269 INFO L290 TraceCheckUtils]: 61: Hoare triple {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:39:14,270 INFO L290 TraceCheckUtils]: 62: Hoare triple {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:39:14,270 INFO L290 TraceCheckUtils]: 63: Hoare triple {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:39:14,270 INFO L290 TraceCheckUtils]: 64: Hoare triple {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:39:14,271 INFO L290 TraceCheckUtils]: 65: Hoare triple {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:39:14,271 INFO L290 TraceCheckUtils]: 66: Hoare triple {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:39:14,271 INFO L290 TraceCheckUtils]: 67: Hoare triple {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:39:14,272 INFO L290 TraceCheckUtils]: 68: Hoare triple {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:39:14,272 INFO L290 TraceCheckUtils]: 69: Hoare triple {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:39:14,272 INFO L290 TraceCheckUtils]: 70: Hoare triple {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:39:14,273 INFO L290 TraceCheckUtils]: 71: Hoare triple {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:39:14,273 INFO L290 TraceCheckUtils]: 72: Hoare triple {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:39:14,273 INFO L290 TraceCheckUtils]: 73: Hoare triple {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:39:14,274 INFO L290 TraceCheckUtils]: 74: Hoare triple {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:39:14,274 INFO L290 TraceCheckUtils]: 75: Hoare triple {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:39:14,274 INFO L290 TraceCheckUtils]: 76: Hoare triple {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:39:14,275 INFO L290 TraceCheckUtils]: 77: Hoare triple {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:39:14,275 INFO L290 TraceCheckUtils]: 78: Hoare triple {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:39:14,275 INFO L290 TraceCheckUtils]: 79: Hoare triple {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:39:14,276 INFO L290 TraceCheckUtils]: 80: Hoare triple {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:39:14,276 INFO L290 TraceCheckUtils]: 81: Hoare triple {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:39:14,276 INFO L290 TraceCheckUtils]: 82: Hoare triple {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:39:14,277 INFO L290 TraceCheckUtils]: 83: Hoare triple {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:39:14,277 INFO L290 TraceCheckUtils]: 84: Hoare triple {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:39:14,277 INFO L290 TraceCheckUtils]: 85: Hoare triple {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:39:14,278 INFO L290 TraceCheckUtils]: 86: Hoare triple {105265#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {105266#(not (= |ssl3_accept_#t~mem79| 8672))} is VALID [2022-04-28 15:39:14,278 INFO L290 TraceCheckUtils]: 87: Hoare triple {105266#(not (= |ssl3_accept_#t~mem79| 8672))} assume 8672 == #t~mem79;havoc #t~mem79; {105261#false} is VALID [2022-04-28 15:39:14,278 INFO L290 TraceCheckUtils]: 88: Hoare triple {105261#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {105261#false} is VALID [2022-04-28 15:39:14,278 INFO L290 TraceCheckUtils]: 89: Hoare triple {105261#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {105261#false} is VALID [2022-04-28 15:39:14,278 INFO L290 TraceCheckUtils]: 90: Hoare triple {105261#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 72 + ~s.offset, 4);call #t~mem145 := read~int(~s.base, 128 + ~s.offset, 4); {105261#false} is VALID [2022-04-28 15:39:14,278 INFO L290 TraceCheckUtils]: 91: Hoare triple {105261#false} assume 0 != #t~mem145;havoc #t~mem145;call #t~mem146.base, #t~mem146.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8640, #t~mem146.base, 904 + #t~mem146.offset, 4);havoc #t~mem146.base, #t~mem146.offset; {105261#false} is VALID [2022-04-28 15:39:14,278 INFO L290 TraceCheckUtils]: 92: Hoare triple {105261#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {105261#false} is VALID [2022-04-28 15:39:14,278 INFO L290 TraceCheckUtils]: 93: Hoare triple {105261#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {105261#false} is VALID [2022-04-28 15:39:14,278 INFO L290 TraceCheckUtils]: 94: Hoare triple {105261#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {105261#false} is VALID [2022-04-28 15:39:14,278 INFO L290 TraceCheckUtils]: 95: Hoare triple {105261#false} ~skip~0 := 0; {105261#false} is VALID [2022-04-28 15:39:14,279 INFO L290 TraceCheckUtils]: 96: Hoare triple {105261#false} assume !false; {105261#false} is VALID [2022-04-28 15:39:14,279 INFO L290 TraceCheckUtils]: 97: Hoare triple {105261#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {105261#false} is VALID [2022-04-28 15:39:14,279 INFO L290 TraceCheckUtils]: 98: Hoare triple {105261#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {105261#false} is VALID [2022-04-28 15:39:14,279 INFO L290 TraceCheckUtils]: 99: Hoare triple {105261#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {105261#false} is VALID [2022-04-28 15:39:14,279 INFO L290 TraceCheckUtils]: 100: Hoare triple {105261#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {105261#false} is VALID [2022-04-28 15:39:14,279 INFO L290 TraceCheckUtils]: 101: Hoare triple {105261#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {105261#false} is VALID [2022-04-28 15:39:14,279 INFO L290 TraceCheckUtils]: 102: Hoare triple {105261#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {105261#false} is VALID [2022-04-28 15:39:14,279 INFO L290 TraceCheckUtils]: 103: Hoare triple {105261#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {105261#false} is VALID [2022-04-28 15:39:14,279 INFO L290 TraceCheckUtils]: 104: Hoare triple {105261#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {105261#false} is VALID [2022-04-28 15:39:14,279 INFO L290 TraceCheckUtils]: 105: Hoare triple {105261#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {105261#false} is VALID [2022-04-28 15:39:14,279 INFO L290 TraceCheckUtils]: 106: Hoare triple {105261#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {105261#false} is VALID [2022-04-28 15:39:14,279 INFO L290 TraceCheckUtils]: 107: Hoare triple {105261#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {105261#false} is VALID [2022-04-28 15:39:14,279 INFO L290 TraceCheckUtils]: 108: Hoare triple {105261#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {105261#false} is VALID [2022-04-28 15:39:14,279 INFO L290 TraceCheckUtils]: 109: Hoare triple {105261#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {105261#false} is VALID [2022-04-28 15:39:14,279 INFO L290 TraceCheckUtils]: 110: Hoare triple {105261#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {105261#false} is VALID [2022-04-28 15:39:14,280 INFO L290 TraceCheckUtils]: 111: Hoare triple {105261#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {105261#false} is VALID [2022-04-28 15:39:14,280 INFO L290 TraceCheckUtils]: 112: Hoare triple {105261#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {105261#false} is VALID [2022-04-28 15:39:14,280 INFO L290 TraceCheckUtils]: 113: Hoare triple {105261#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {105261#false} is VALID [2022-04-28 15:39:14,280 INFO L290 TraceCheckUtils]: 114: Hoare triple {105261#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {105261#false} is VALID [2022-04-28 15:39:14,280 INFO L290 TraceCheckUtils]: 115: Hoare triple {105261#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {105261#false} is VALID [2022-04-28 15:39:14,280 INFO L290 TraceCheckUtils]: 116: Hoare triple {105261#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {105261#false} is VALID [2022-04-28 15:39:14,280 INFO L290 TraceCheckUtils]: 117: Hoare triple {105261#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {105261#false} is VALID [2022-04-28 15:39:14,280 INFO L290 TraceCheckUtils]: 118: Hoare triple {105261#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {105261#false} is VALID [2022-04-28 15:39:14,280 INFO L290 TraceCheckUtils]: 119: Hoare triple {105261#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {105261#false} is VALID [2022-04-28 15:39:14,280 INFO L290 TraceCheckUtils]: 120: Hoare triple {105261#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {105261#false} is VALID [2022-04-28 15:39:14,280 INFO L290 TraceCheckUtils]: 121: Hoare triple {105261#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {105261#false} is VALID [2022-04-28 15:39:14,280 INFO L290 TraceCheckUtils]: 122: Hoare triple {105261#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {105261#false} is VALID [2022-04-28 15:39:14,280 INFO L290 TraceCheckUtils]: 123: Hoare triple {105261#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {105261#false} is VALID [2022-04-28 15:39:14,280 INFO L290 TraceCheckUtils]: 124: Hoare triple {105261#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {105261#false} is VALID [2022-04-28 15:39:14,280 INFO L290 TraceCheckUtils]: 125: Hoare triple {105261#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {105261#false} is VALID [2022-04-28 15:39:14,281 INFO L290 TraceCheckUtils]: 126: Hoare triple {105261#false} assume 8640 == #t~mem75;havoc #t~mem75; {105261#false} is VALID [2022-04-28 15:39:14,281 INFO L290 TraceCheckUtils]: 127: Hoare triple {105261#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {105261#false} is VALID [2022-04-28 15:39:14,281 INFO L290 TraceCheckUtils]: 128: Hoare triple {105261#false} assume !(4 == ~blastFlag~0); {105261#false} is VALID [2022-04-28 15:39:14,281 INFO L290 TraceCheckUtils]: 129: Hoare triple {105261#false} assume !(7 == ~blastFlag~0); {105261#false} is VALID [2022-04-28 15:39:14,281 INFO L290 TraceCheckUtils]: 130: Hoare triple {105261#false} assume !(10 == ~blastFlag~0); {105261#false} is VALID [2022-04-28 15:39:14,281 INFO L290 TraceCheckUtils]: 131: Hoare triple {105261#false} assume !false; {105261#false} is VALID [2022-04-28 15:39:14,281 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-28 15:39:14,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:39:14,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555697955] [2022-04-28 15:39:14,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555697955] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:39:14,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:39:14,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:39:14,282 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:39:14,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1234199515] [2022-04-28 15:39:14,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1234199515] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:39:14,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:39:14,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:39:14,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546703211] [2022-04-28 15:39:14,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:39:14,282 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 132 [2022-04-28 15:39:14,282 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:39:14,283 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:39:14,365 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:39:14,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:39:14,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:39:14,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:39:14,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:39:14,365 INFO L87 Difference]: Start difference. First operand 589 states and 854 transitions. Second operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:39:19,221 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:39:22,485 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:39:23,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:39:23,716 INFO L93 Difference]: Finished difference Result 1259 states and 1830 transitions. [2022-04-28 15:39:23,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:39:23,716 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 132 [2022-04-28 15:39:23,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:39:23,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:39:23,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 584 transitions. [2022-04-28 15:39:23,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:39:23,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 584 transitions. [2022-04-28 15:39:23,720 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 584 transitions. [2022-04-28 15:39:24,088 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-28 15:39:24,107 INFO L225 Difference]: With dead ends: 1259 [2022-04-28 15:39:24,107 INFO L226 Difference]: Without dead ends: 696 [2022-04-28 15:39:24,108 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-28 15:39:24,123 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 103 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:39:24,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 437 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 494 Invalid, 1 Unknown, 0 Unchecked, 5.3s Time] [2022-04-28 15:39:24,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2022-04-28 15:39:24,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 632. [2022-04-28 15:39:24,178 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:39:24,189 INFO L82 GeneralOperation]: Start isEquivalent. First operand 696 states. Second operand has 632 states, 627 states have (on average 1.452950558213716) internal successors, (911), 627 states have internal predecessors, (911), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:39:24,189 INFO L74 IsIncluded]: Start isIncluded. First operand 696 states. Second operand has 632 states, 627 states have (on average 1.452950558213716) internal successors, (911), 627 states have internal predecessors, (911), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:39:24,190 INFO L87 Difference]: Start difference. First operand 696 states. Second operand has 632 states, 627 states have (on average 1.452950558213716) internal successors, (911), 627 states have internal predecessors, (911), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:39:24,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:39:24,202 INFO L93 Difference]: Finished difference Result 696 states and 1005 transitions. [2022-04-28 15:39:24,203 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1005 transitions. [2022-04-28 15:39:24,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:39:24,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:39:24,204 INFO L74 IsIncluded]: Start isIncluded. First operand has 632 states, 627 states have (on average 1.452950558213716) internal successors, (911), 627 states have internal predecessors, (911), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 696 states. [2022-04-28 15:39:24,204 INFO L87 Difference]: Start difference. First operand has 632 states, 627 states have (on average 1.452950558213716) internal successors, (911), 627 states have internal predecessors, (911), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 696 states. [2022-04-28 15:39:24,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:39:24,217 INFO L93 Difference]: Finished difference Result 696 states and 1005 transitions. [2022-04-28 15:39:24,217 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1005 transitions. [2022-04-28 15:39:24,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:39:24,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:39:24,217 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:39:24,218 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:39:24,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 627 states have (on average 1.452950558213716) internal successors, (911), 627 states have internal predecessors, (911), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:39:24,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 915 transitions. [2022-04-28 15:39:24,234 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 915 transitions. Word has length 132 [2022-04-28 15:39:24,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:39:24,234 INFO L495 AbstractCegarLoop]: Abstraction has 632 states and 915 transitions. [2022-04-28 15:39:24,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:39:24,234 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 632 states and 915 transitions. [2022-04-28 15:39:25,099 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 915 edges. 915 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:39:25,099 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 915 transitions. [2022-04-28 15:39:25,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-04-28 15:39:25,099 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:39:25,100 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, 1, 1] [2022-04-28 15:39:25,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-04-28 15:39:25,100 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:39:25,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:39:25,100 INFO L85 PathProgramCache]: Analyzing trace with hash -748569873, now seen corresponding path program 1 times [2022-04-28 15:39:25,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:39:25,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1315420343] [2022-04-28 15:39:25,194 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:39:25,194 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:39:25,195 INFO L85 PathProgramCache]: Analyzing trace with hash -748569873, now seen corresponding path program 2 times [2022-04-28 15:39:25,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:39:25,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409715631] [2022-04-28 15:39:25,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:39:25,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:39:25,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:39:25,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:39:25,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:39:25,301 INFO L290 TraceCheckUtils]: 0: Hoare triple {110453#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {110446#true} is VALID [2022-04-28 15:39:25,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {110446#true} assume true; {110446#true} is VALID [2022-04-28 15:39:25,301 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {110446#true} {110446#true} #703#return; {110446#true} is VALID [2022-04-28 15:39:25,302 INFO L272 TraceCheckUtils]: 0: Hoare triple {110446#true} call ULTIMATE.init(); {110453#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-28 15:39:25,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {110453#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {110446#true} is VALID [2022-04-28 15:39:25,303 INFO L290 TraceCheckUtils]: 2: Hoare triple {110446#true} assume true; {110446#true} is VALID [2022-04-28 15:39:25,303 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {110446#true} {110446#true} #703#return; {110446#true} is VALID [2022-04-28 15:39:25,303 INFO L272 TraceCheckUtils]: 4: Hoare triple {110446#true} call #t~ret161 := main(); {110446#true} is VALID [2022-04-28 15:39:25,303 INFO L290 TraceCheckUtils]: 5: Hoare triple {110446#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {110446#true} is VALID [2022-04-28 15:39:25,303 INFO L290 TraceCheckUtils]: 6: Hoare triple {110446#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {110446#true} is VALID [2022-04-28 15:39:25,303 INFO L272 TraceCheckUtils]: 7: Hoare triple {110446#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {110446#true} is VALID [2022-04-28 15:39:25,303 INFO L290 TraceCheckUtils]: 8: Hoare triple {110446#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {110446#true} is VALID [2022-04-28 15:39:25,303 INFO L290 TraceCheckUtils]: 9: Hoare triple {110446#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {110446#true} is VALID [2022-04-28 15:39:25,303 INFO L290 TraceCheckUtils]: 10: Hoare triple {110446#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {110446#true} is VALID [2022-04-28 15:39:25,303 INFO L290 TraceCheckUtils]: 11: Hoare triple {110446#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {110446#true} is VALID [2022-04-28 15:39:25,303 INFO L290 TraceCheckUtils]: 12: Hoare triple {110446#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {110446#true} is VALID [2022-04-28 15:39:25,303 INFO L290 TraceCheckUtils]: 13: Hoare triple {110446#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {110446#true} is VALID [2022-04-28 15:39:25,303 INFO L290 TraceCheckUtils]: 14: Hoare triple {110446#true} assume !false; {110446#true} is VALID [2022-04-28 15:39:25,304 INFO L290 TraceCheckUtils]: 15: Hoare triple {110446#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {110446#true} is VALID [2022-04-28 15:39:25,304 INFO L290 TraceCheckUtils]: 16: Hoare triple {110446#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {110446#true} is VALID [2022-04-28 15:39:25,304 INFO L290 TraceCheckUtils]: 17: Hoare triple {110446#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {110446#true} is VALID [2022-04-28 15:39:25,304 INFO L290 TraceCheckUtils]: 18: Hoare triple {110446#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {110446#true} is VALID [2022-04-28 15:39:25,304 INFO L290 TraceCheckUtils]: 19: Hoare triple {110446#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {110446#true} is VALID [2022-04-28 15:39:25,304 INFO L290 TraceCheckUtils]: 20: Hoare triple {110446#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {110446#true} is VALID [2022-04-28 15:39:25,304 INFO L290 TraceCheckUtils]: 21: Hoare triple {110446#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {110446#true} is VALID [2022-04-28 15:39:25,304 INFO L290 TraceCheckUtils]: 22: Hoare triple {110446#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {110446#true} is VALID [2022-04-28 15:39:25,304 INFO L290 TraceCheckUtils]: 23: Hoare triple {110446#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {110446#true} is VALID [2022-04-28 15:39:25,304 INFO L290 TraceCheckUtils]: 24: Hoare triple {110446#true} assume 8464 == #t~mem55;havoc #t~mem55; {110446#true} is VALID [2022-04-28 15:39:25,304 INFO L290 TraceCheckUtils]: 25: Hoare triple {110446#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {110446#true} is VALID [2022-04-28 15:39:25,304 INFO L290 TraceCheckUtils]: 26: Hoare triple {110446#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {110446#true} is VALID [2022-04-28 15:39:25,304 INFO L290 TraceCheckUtils]: 27: Hoare triple {110446#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {110446#true} is VALID [2022-04-28 15:39:25,304 INFO L290 TraceCheckUtils]: 28: Hoare triple {110446#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {110446#true} is VALID [2022-04-28 15:39:25,304 INFO L290 TraceCheckUtils]: 29: Hoare triple {110446#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {110446#true} is VALID [2022-04-28 15:39:25,305 INFO L290 TraceCheckUtils]: 30: Hoare triple {110446#true} ~skip~0 := 0; {110446#true} is VALID [2022-04-28 15:39:25,305 INFO L290 TraceCheckUtils]: 31: Hoare triple {110446#true} assume !false; {110446#true} is VALID [2022-04-28 15:39:25,305 INFO L290 TraceCheckUtils]: 32: Hoare triple {110446#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {110446#true} is VALID [2022-04-28 15:39:25,305 INFO L290 TraceCheckUtils]: 33: Hoare triple {110446#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {110446#true} is VALID [2022-04-28 15:39:25,305 INFO L290 TraceCheckUtils]: 34: Hoare triple {110446#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {110446#true} is VALID [2022-04-28 15:39:25,305 INFO L290 TraceCheckUtils]: 35: Hoare triple {110446#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {110446#true} is VALID [2022-04-28 15:39:25,305 INFO L290 TraceCheckUtils]: 36: Hoare triple {110446#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {110446#true} is VALID [2022-04-28 15:39:25,305 INFO L290 TraceCheckUtils]: 37: Hoare triple {110446#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {110446#true} is VALID [2022-04-28 15:39:25,305 INFO L290 TraceCheckUtils]: 38: Hoare triple {110446#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {110446#true} is VALID [2022-04-28 15:39:25,305 INFO L290 TraceCheckUtils]: 39: Hoare triple {110446#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {110446#true} is VALID [2022-04-28 15:39:25,305 INFO L290 TraceCheckUtils]: 40: Hoare triple {110446#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {110446#true} is VALID [2022-04-28 15:39:25,305 INFO L290 TraceCheckUtils]: 41: Hoare triple {110446#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {110446#true} is VALID [2022-04-28 15:39:25,305 INFO L290 TraceCheckUtils]: 42: Hoare triple {110446#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {110446#true} is VALID [2022-04-28 15:39:25,305 INFO L290 TraceCheckUtils]: 43: Hoare triple {110446#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {110446#true} is VALID [2022-04-28 15:39:25,305 INFO L290 TraceCheckUtils]: 44: Hoare triple {110446#true} assume 8496 == #t~mem58;havoc #t~mem58; {110446#true} is VALID [2022-04-28 15:39:25,306 INFO L290 TraceCheckUtils]: 45: Hoare triple {110446#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {110446#true} is VALID [2022-04-28 15:39:25,306 INFO L290 TraceCheckUtils]: 46: Hoare triple {110446#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {110446#true} is VALID [2022-04-28 15:39:25,306 INFO L290 TraceCheckUtils]: 47: Hoare triple {110446#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {110446#true} is VALID [2022-04-28 15:39:25,306 INFO L290 TraceCheckUtils]: 48: Hoare triple {110446#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:39:25,307 INFO L290 TraceCheckUtils]: 49: Hoare triple {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:39:25,323 INFO L290 TraceCheckUtils]: 50: Hoare triple {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:39:25,324 INFO L290 TraceCheckUtils]: 51: Hoare triple {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:39:25,324 INFO L290 TraceCheckUtils]: 52: Hoare triple {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:39:25,324 INFO L290 TraceCheckUtils]: 53: Hoare triple {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:39:25,325 INFO L290 TraceCheckUtils]: 54: Hoare triple {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:39:25,325 INFO L290 TraceCheckUtils]: 55: Hoare triple {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:39:25,325 INFO L290 TraceCheckUtils]: 56: Hoare triple {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:39:25,326 INFO L290 TraceCheckUtils]: 57: Hoare triple {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:39:25,326 INFO L290 TraceCheckUtils]: 58: Hoare triple {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:39:25,326 INFO L290 TraceCheckUtils]: 59: Hoare triple {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:39:25,327 INFO L290 TraceCheckUtils]: 60: Hoare triple {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:39:25,327 INFO L290 TraceCheckUtils]: 61: Hoare triple {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:39:25,327 INFO L290 TraceCheckUtils]: 62: Hoare triple {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:39:25,327 INFO L290 TraceCheckUtils]: 63: Hoare triple {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:39:25,328 INFO L290 TraceCheckUtils]: 64: Hoare triple {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:39:25,328 INFO L290 TraceCheckUtils]: 65: Hoare triple {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:39:25,328 INFO L290 TraceCheckUtils]: 66: Hoare triple {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:39:25,329 INFO L290 TraceCheckUtils]: 67: Hoare triple {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:39:25,329 INFO L290 TraceCheckUtils]: 68: Hoare triple {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:39:25,329 INFO L290 TraceCheckUtils]: 69: Hoare triple {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:39:25,330 INFO L290 TraceCheckUtils]: 70: Hoare triple {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:39:25,330 INFO L290 TraceCheckUtils]: 71: Hoare triple {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:39:25,330 INFO L290 TraceCheckUtils]: 72: Hoare triple {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:39:25,331 INFO L290 TraceCheckUtils]: 73: Hoare triple {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:39:25,331 INFO L290 TraceCheckUtils]: 74: Hoare triple {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:39:25,331 INFO L290 TraceCheckUtils]: 75: Hoare triple {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:39:25,332 INFO L290 TraceCheckUtils]: 76: Hoare triple {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:39:25,332 INFO L290 TraceCheckUtils]: 77: Hoare triple {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:39:25,332 INFO L290 TraceCheckUtils]: 78: Hoare triple {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:39:25,333 INFO L290 TraceCheckUtils]: 79: Hoare triple {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:39:25,333 INFO L290 TraceCheckUtils]: 80: Hoare triple {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:39:25,333 INFO L290 TraceCheckUtils]: 81: Hoare triple {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:39:25,334 INFO L290 TraceCheckUtils]: 82: Hoare triple {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:39:25,334 INFO L290 TraceCheckUtils]: 83: Hoare triple {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:39:25,334 INFO L290 TraceCheckUtils]: 84: Hoare triple {110451#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {110452#(= |ssl3_accept_#t~mem77| 8656)} is VALID [2022-04-28 15:39:25,335 INFO L290 TraceCheckUtils]: 85: Hoare triple {110452#(= |ssl3_accept_#t~mem77| 8656)} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {110447#false} is VALID [2022-04-28 15:39:25,335 INFO L290 TraceCheckUtils]: 86: Hoare triple {110447#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {110447#false} is VALID [2022-04-28 15:39:25,335 INFO L290 TraceCheckUtils]: 87: Hoare triple {110447#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 72 + ~s.offset, 4); {110447#false} is VALID [2022-04-28 15:39:25,335 INFO L290 TraceCheckUtils]: 88: Hoare triple {110447#false} assume 8673 == #t~mem80;havoc #t~mem80; {110447#false} is VALID [2022-04-28 15:39:25,335 INFO L290 TraceCheckUtils]: 89: Hoare triple {110447#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {110447#false} is VALID [2022-04-28 15:39:25,335 INFO L290 TraceCheckUtils]: 90: Hoare triple {110447#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {110447#false} is VALID [2022-04-28 15:39:25,335 INFO L290 TraceCheckUtils]: 91: Hoare triple {110447#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 72 + ~s.offset, 4);call #t~mem145 := read~int(~s.base, 128 + ~s.offset, 4); {110447#false} is VALID [2022-04-28 15:39:25,335 INFO L290 TraceCheckUtils]: 92: Hoare triple {110447#false} assume 0 != #t~mem145;havoc #t~mem145;call #t~mem146.base, #t~mem146.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8640, #t~mem146.base, 904 + #t~mem146.offset, 4);havoc #t~mem146.base, #t~mem146.offset; {110447#false} is VALID [2022-04-28 15:39:25,335 INFO L290 TraceCheckUtils]: 93: Hoare triple {110447#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {110447#false} is VALID [2022-04-28 15:39:25,335 INFO L290 TraceCheckUtils]: 94: Hoare triple {110447#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {110447#false} is VALID [2022-04-28 15:39:25,335 INFO L290 TraceCheckUtils]: 95: Hoare triple {110447#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {110447#false} is VALID [2022-04-28 15:39:25,335 INFO L290 TraceCheckUtils]: 96: Hoare triple {110447#false} ~skip~0 := 0; {110447#false} is VALID [2022-04-28 15:39:25,335 INFO L290 TraceCheckUtils]: 97: Hoare triple {110447#false} assume !false; {110447#false} is VALID [2022-04-28 15:39:25,335 INFO L290 TraceCheckUtils]: 98: Hoare triple {110447#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {110447#false} is VALID [2022-04-28 15:39:25,336 INFO L290 TraceCheckUtils]: 99: Hoare triple {110447#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {110447#false} is VALID [2022-04-28 15:39:25,336 INFO L290 TraceCheckUtils]: 100: Hoare triple {110447#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {110447#false} is VALID [2022-04-28 15:39:25,336 INFO L290 TraceCheckUtils]: 101: Hoare triple {110447#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {110447#false} is VALID [2022-04-28 15:39:25,336 INFO L290 TraceCheckUtils]: 102: Hoare triple {110447#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {110447#false} is VALID [2022-04-28 15:39:25,336 INFO L290 TraceCheckUtils]: 103: Hoare triple {110447#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {110447#false} is VALID [2022-04-28 15:39:25,336 INFO L290 TraceCheckUtils]: 104: Hoare triple {110447#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {110447#false} is VALID [2022-04-28 15:39:25,336 INFO L290 TraceCheckUtils]: 105: Hoare triple {110447#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {110447#false} is VALID [2022-04-28 15:39:25,336 INFO L290 TraceCheckUtils]: 106: Hoare triple {110447#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {110447#false} is VALID [2022-04-28 15:39:25,336 INFO L290 TraceCheckUtils]: 107: Hoare triple {110447#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {110447#false} is VALID [2022-04-28 15:39:25,336 INFO L290 TraceCheckUtils]: 108: Hoare triple {110447#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {110447#false} is VALID [2022-04-28 15:39:25,336 INFO L290 TraceCheckUtils]: 109: Hoare triple {110447#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {110447#false} is VALID [2022-04-28 15:39:25,336 INFO L290 TraceCheckUtils]: 110: Hoare triple {110447#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {110447#false} is VALID [2022-04-28 15:39:25,336 INFO L290 TraceCheckUtils]: 111: Hoare triple {110447#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {110447#false} is VALID [2022-04-28 15:39:25,336 INFO L290 TraceCheckUtils]: 112: Hoare triple {110447#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {110447#false} is VALID [2022-04-28 15:39:25,336 INFO L290 TraceCheckUtils]: 113: Hoare triple {110447#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {110447#false} is VALID [2022-04-28 15:39:25,336 INFO L290 TraceCheckUtils]: 114: Hoare triple {110447#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {110447#false} is VALID [2022-04-28 15:39:25,337 INFO L290 TraceCheckUtils]: 115: Hoare triple {110447#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {110447#false} is VALID [2022-04-28 15:39:25,337 INFO L290 TraceCheckUtils]: 116: Hoare triple {110447#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {110447#false} is VALID [2022-04-28 15:39:25,337 INFO L290 TraceCheckUtils]: 117: Hoare triple {110447#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {110447#false} is VALID [2022-04-28 15:39:25,337 INFO L290 TraceCheckUtils]: 118: Hoare triple {110447#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {110447#false} is VALID [2022-04-28 15:39:25,337 INFO L290 TraceCheckUtils]: 119: Hoare triple {110447#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {110447#false} is VALID [2022-04-28 15:39:25,337 INFO L290 TraceCheckUtils]: 120: Hoare triple {110447#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {110447#false} is VALID [2022-04-28 15:39:25,337 INFO L290 TraceCheckUtils]: 121: Hoare triple {110447#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {110447#false} is VALID [2022-04-28 15:39:25,337 INFO L290 TraceCheckUtils]: 122: Hoare triple {110447#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {110447#false} is VALID [2022-04-28 15:39:25,337 INFO L290 TraceCheckUtils]: 123: Hoare triple {110447#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {110447#false} is VALID [2022-04-28 15:39:25,337 INFO L290 TraceCheckUtils]: 124: Hoare triple {110447#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {110447#false} is VALID [2022-04-28 15:39:25,337 INFO L290 TraceCheckUtils]: 125: Hoare triple {110447#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {110447#false} is VALID [2022-04-28 15:39:25,337 INFO L290 TraceCheckUtils]: 126: Hoare triple {110447#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {110447#false} is VALID [2022-04-28 15:39:25,337 INFO L290 TraceCheckUtils]: 127: Hoare triple {110447#false} assume 8640 == #t~mem75;havoc #t~mem75; {110447#false} is VALID [2022-04-28 15:39:25,337 INFO L290 TraceCheckUtils]: 128: Hoare triple {110447#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {110447#false} is VALID [2022-04-28 15:39:25,337 INFO L290 TraceCheckUtils]: 129: Hoare triple {110447#false} assume !(4 == ~blastFlag~0); {110447#false} is VALID [2022-04-28 15:39:25,338 INFO L290 TraceCheckUtils]: 130: Hoare triple {110447#false} assume !(7 == ~blastFlag~0); {110447#false} is VALID [2022-04-28 15:39:25,338 INFO L290 TraceCheckUtils]: 131: Hoare triple {110447#false} assume !(10 == ~blastFlag~0); {110447#false} is VALID [2022-04-28 15:39:25,338 INFO L290 TraceCheckUtils]: 132: Hoare triple {110447#false} assume !false; {110447#false} is VALID [2022-04-28 15:39:25,338 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-28 15:39:25,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:39:25,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409715631] [2022-04-28 15:39:25,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409715631] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:39:25,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:39:25,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:39:25,339 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:39:25,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1315420343] [2022-04-28 15:39:25,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1315420343] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:39:25,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:39:25,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:39:25,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892432642] [2022-04-28 15:39:25,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:39:25,340 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 1 states have call successors, (3), 2 states have 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-28 15:39:25,340 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:39:25,340 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:39:25,420 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:39:25,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:39:25,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:39:25,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:39:25,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:39:25,420 INFO L87 Difference]: Start difference. First operand 632 states and 915 transitions. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:39:28,227 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:39:30,976 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:39:32,873 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:39:36,357 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:39:37,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:39:37,400 INFO L93 Difference]: Finished difference Result 1255 states and 1822 transitions. [2022-04-28 15:39:37,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:39:37,400 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 1 states have call successors, (3), 2 states have 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-28 15:39:37,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:39:37,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:39:37,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 494 transitions. [2022-04-28 15:39:37,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:39:37,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 494 transitions. [2022-04-28 15:39:37,404 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 494 transitions. [2022-04-28 15:39:37,629 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 494 edges. 494 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:39:37,645 INFO L225 Difference]: With dead ends: 1255 [2022-04-28 15:39:37,645 INFO L226 Difference]: Without dead ends: 649 [2022-04-28 15:39:37,645 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-28 15:39:37,646 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 26 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-04-28 15:39:37,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 557 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2022-04-28 15:39:37,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2022-04-28 15:39:37,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 637. [2022-04-28 15:39:37,682 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:39:37,683 INFO L82 GeneralOperation]: Start isEquivalent. First operand 649 states. Second operand has 637 states, 632 states have (on average 1.4493670886075949) internal successors, (916), 632 states have internal predecessors, (916), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:39:37,683 INFO L74 IsIncluded]: Start isIncluded. First operand 649 states. Second operand has 637 states, 632 states have (on average 1.4493670886075949) internal successors, (916), 632 states have internal predecessors, (916), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:39:37,684 INFO L87 Difference]: Start difference. First operand 649 states. Second operand has 637 states, 632 states have (on average 1.4493670886075949) internal successors, (916), 632 states have internal predecessors, (916), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:39:37,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:39:37,695 INFO L93 Difference]: Finished difference Result 649 states and 936 transitions. [2022-04-28 15:39:37,695 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 936 transitions. [2022-04-28 15:39:37,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:39:37,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:39:37,696 INFO L74 IsIncluded]: Start isIncluded. First operand has 637 states, 632 states have (on average 1.4493670886075949) internal successors, (916), 632 states have internal predecessors, (916), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 649 states. [2022-04-28 15:39:37,696 INFO L87 Difference]: Start difference. First operand has 637 states, 632 states have (on average 1.4493670886075949) internal successors, (916), 632 states have internal predecessors, (916), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 649 states. [2022-04-28 15:39:37,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:39:37,708 INFO L93 Difference]: Finished difference Result 649 states and 936 transitions. [2022-04-28 15:39:37,708 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 936 transitions. [2022-04-28 15:39:37,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:39:37,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:39:37,708 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:39:37,708 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:39:37,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 632 states have (on average 1.4493670886075949) internal successors, (916), 632 states have internal predecessors, (916), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:39:37,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 920 transitions. [2022-04-28 15:39:37,724 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 920 transitions. Word has length 133 [2022-04-28 15:39:37,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:39:37,725 INFO L495 AbstractCegarLoop]: Abstraction has 637 states and 920 transitions. [2022-04-28 15:39:37,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:39:37,725 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 637 states and 920 transitions. [2022-04-28 15:39:38,547 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 920 edges. 920 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:39:38,547 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 920 transitions. [2022-04-28 15:39:38,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-04-28 15:39:38,548 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:39:38,548 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:39:38,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-04-28 15:39:38,548 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:39:38,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:39:38,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1628807593, now seen corresponding path program 1 times [2022-04-28 15:39:38,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:39:38,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1796327111] [2022-04-28 15:39:38,659 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:39:38,659 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:39:38,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1628807593, now seen corresponding path program 2 times [2022-04-28 15:39:38,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:39:38,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509263428] [2022-04-28 15:39:38,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:39:38,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:39:38,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:39:38,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:39:38,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:39:38,785 INFO L290 TraceCheckUtils]: 0: Hoare triple {115546#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {115540#true} is VALID [2022-04-28 15:39:38,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {115540#true} assume true; {115540#true} is VALID [2022-04-28 15:39:38,785 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {115540#true} {115540#true} #703#return; {115540#true} is VALID [2022-04-28 15:39:38,786 INFO L272 TraceCheckUtils]: 0: Hoare triple {115540#true} call ULTIMATE.init(); {115546#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-28 15:39:38,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {115546#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {115540#true} is VALID [2022-04-28 15:39:38,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {115540#true} assume true; {115540#true} is VALID [2022-04-28 15:39:38,786 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {115540#true} {115540#true} #703#return; {115540#true} is VALID [2022-04-28 15:39:38,786 INFO L272 TraceCheckUtils]: 4: Hoare triple {115540#true} call #t~ret161 := main(); {115540#true} is VALID [2022-04-28 15:39:38,786 INFO L290 TraceCheckUtils]: 5: Hoare triple {115540#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {115540#true} is VALID [2022-04-28 15:39:38,786 INFO L290 TraceCheckUtils]: 6: Hoare triple {115540#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {115540#true} is VALID [2022-04-28 15:39:38,786 INFO L272 TraceCheckUtils]: 7: Hoare triple {115540#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {115540#true} is VALID [2022-04-28 15:39:38,786 INFO L290 TraceCheckUtils]: 8: Hoare triple {115540#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {115540#true} is VALID [2022-04-28 15:39:38,786 INFO L290 TraceCheckUtils]: 9: Hoare triple {115540#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {115540#true} is VALID [2022-04-28 15:39:38,786 INFO L290 TraceCheckUtils]: 10: Hoare triple {115540#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {115540#true} is VALID [2022-04-28 15:39:38,787 INFO L290 TraceCheckUtils]: 11: Hoare triple {115540#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {115540#true} is VALID [2022-04-28 15:39:38,787 INFO L290 TraceCheckUtils]: 12: Hoare triple {115540#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {115540#true} is VALID [2022-04-28 15:39:38,787 INFO L290 TraceCheckUtils]: 13: Hoare triple {115540#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {115540#true} is VALID [2022-04-28 15:39:38,787 INFO L290 TraceCheckUtils]: 14: Hoare triple {115540#true} assume !false; {115540#true} is VALID [2022-04-28 15:39:38,787 INFO L290 TraceCheckUtils]: 15: Hoare triple {115540#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,787 INFO L290 TraceCheckUtils]: 16: Hoare triple {115540#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,787 INFO L290 TraceCheckUtils]: 17: Hoare triple {115540#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,787 INFO L290 TraceCheckUtils]: 18: Hoare triple {115540#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,787 INFO L290 TraceCheckUtils]: 19: Hoare triple {115540#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,787 INFO L290 TraceCheckUtils]: 20: Hoare triple {115540#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,787 INFO L290 TraceCheckUtils]: 21: Hoare triple {115540#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,787 INFO L290 TraceCheckUtils]: 22: Hoare triple {115540#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,787 INFO L290 TraceCheckUtils]: 23: Hoare triple {115540#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,787 INFO L290 TraceCheckUtils]: 24: Hoare triple {115540#true} assume 8464 == #t~mem55;havoc #t~mem55; {115540#true} is VALID [2022-04-28 15:39:38,787 INFO L290 TraceCheckUtils]: 25: Hoare triple {115540#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {115540#true} is VALID [2022-04-28 15:39:38,788 INFO L290 TraceCheckUtils]: 26: Hoare triple {115540#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {115540#true} is VALID [2022-04-28 15:39:38,788 INFO L290 TraceCheckUtils]: 27: Hoare triple {115540#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,788 INFO L290 TraceCheckUtils]: 28: Hoare triple {115540#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,788 INFO L290 TraceCheckUtils]: 29: Hoare triple {115540#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {115540#true} is VALID [2022-04-28 15:39:38,788 INFO L290 TraceCheckUtils]: 30: Hoare triple {115540#true} ~skip~0 := 0; {115540#true} is VALID [2022-04-28 15:39:38,788 INFO L290 TraceCheckUtils]: 31: Hoare triple {115540#true} assume !false; {115540#true} is VALID [2022-04-28 15:39:38,788 INFO L290 TraceCheckUtils]: 32: Hoare triple {115540#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,788 INFO L290 TraceCheckUtils]: 33: Hoare triple {115540#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,788 INFO L290 TraceCheckUtils]: 34: Hoare triple {115540#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,788 INFO L290 TraceCheckUtils]: 35: Hoare triple {115540#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,788 INFO L290 TraceCheckUtils]: 36: Hoare triple {115540#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,788 INFO L290 TraceCheckUtils]: 37: Hoare triple {115540#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,788 INFO L290 TraceCheckUtils]: 38: Hoare triple {115540#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,788 INFO L290 TraceCheckUtils]: 39: Hoare triple {115540#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,788 INFO L290 TraceCheckUtils]: 40: Hoare triple {115540#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,788 INFO L290 TraceCheckUtils]: 41: Hoare triple {115540#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,789 INFO L290 TraceCheckUtils]: 42: Hoare triple {115540#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,789 INFO L290 TraceCheckUtils]: 43: Hoare triple {115540#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,789 INFO L290 TraceCheckUtils]: 44: Hoare triple {115540#true} assume 8496 == #t~mem58;havoc #t~mem58; {115540#true} is VALID [2022-04-28 15:39:38,789 INFO L290 TraceCheckUtils]: 45: Hoare triple {115540#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {115540#true} is VALID [2022-04-28 15:39:38,789 INFO L290 TraceCheckUtils]: 46: Hoare triple {115540#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {115540#true} is VALID [2022-04-28 15:39:38,789 INFO L290 TraceCheckUtils]: 47: Hoare triple {115540#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,789 INFO L290 TraceCheckUtils]: 48: Hoare triple {115540#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,789 INFO L290 TraceCheckUtils]: 49: Hoare triple {115540#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,789 INFO L290 TraceCheckUtils]: 50: Hoare triple {115540#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,789 INFO L290 TraceCheckUtils]: 51: Hoare triple {115540#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {115540#true} is VALID [2022-04-28 15:39:38,789 INFO L290 TraceCheckUtils]: 52: Hoare triple {115540#true} ~skip~0 := 0; {115540#true} is VALID [2022-04-28 15:39:38,789 INFO L290 TraceCheckUtils]: 53: Hoare triple {115540#true} assume !false; {115540#true} is VALID [2022-04-28 15:39:38,789 INFO L290 TraceCheckUtils]: 54: Hoare triple {115540#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,789 INFO L290 TraceCheckUtils]: 55: Hoare triple {115540#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,789 INFO L290 TraceCheckUtils]: 56: Hoare triple {115540#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,790 INFO L290 TraceCheckUtils]: 57: Hoare triple {115540#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,790 INFO L290 TraceCheckUtils]: 58: Hoare triple {115540#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,790 INFO L290 TraceCheckUtils]: 59: Hoare triple {115540#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,790 INFO L290 TraceCheckUtils]: 60: Hoare triple {115540#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,790 INFO L290 TraceCheckUtils]: 61: Hoare triple {115540#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,790 INFO L290 TraceCheckUtils]: 62: Hoare triple {115540#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,790 INFO L290 TraceCheckUtils]: 63: Hoare triple {115540#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,790 INFO L290 TraceCheckUtils]: 64: Hoare triple {115540#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,790 INFO L290 TraceCheckUtils]: 65: Hoare triple {115540#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,790 INFO L290 TraceCheckUtils]: 66: Hoare triple {115540#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,790 INFO L290 TraceCheckUtils]: 67: Hoare triple {115540#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,790 INFO L290 TraceCheckUtils]: 68: Hoare triple {115540#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,790 INFO L290 TraceCheckUtils]: 69: Hoare triple {115540#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,790 INFO L290 TraceCheckUtils]: 70: Hoare triple {115540#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,790 INFO L290 TraceCheckUtils]: 71: Hoare triple {115540#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,790 INFO L290 TraceCheckUtils]: 72: Hoare triple {115540#true} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,791 INFO L290 TraceCheckUtils]: 73: Hoare triple {115540#true} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,791 INFO L290 TraceCheckUtils]: 74: Hoare triple {115540#true} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,791 INFO L290 TraceCheckUtils]: 75: Hoare triple {115540#true} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,791 INFO L290 TraceCheckUtils]: 76: Hoare triple {115540#true} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,791 INFO L290 TraceCheckUtils]: 77: Hoare triple {115540#true} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,791 INFO L290 TraceCheckUtils]: 78: Hoare triple {115540#true} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,791 INFO L290 TraceCheckUtils]: 79: Hoare triple {115540#true} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,791 INFO L290 TraceCheckUtils]: 80: Hoare triple {115540#true} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,791 INFO L290 TraceCheckUtils]: 81: Hoare triple {115540#true} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,791 INFO L290 TraceCheckUtils]: 82: Hoare triple {115540#true} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,791 INFO L290 TraceCheckUtils]: 83: Hoare triple {115540#true} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,791 INFO L290 TraceCheckUtils]: 84: Hoare triple {115540#true} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,791 INFO L290 TraceCheckUtils]: 85: Hoare triple {115540#true} assume 8656 == #t~mem77;havoc #t~mem77; {115540#true} is VALID [2022-04-28 15:39:38,791 INFO L290 TraceCheckUtils]: 86: Hoare triple {115540#true} call #t~mem140.base, #t~mem140.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem141.base, #t~mem141.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem142.base, #t~mem142.offset := read~$Pointer$(#t~mem141.base, 888 + #t~mem141.offset, 8);call write~$Pointer$(#t~mem142.base, #t~mem142.offset, #t~mem140.base, 192 + #t~mem140.offset, 8);havoc #t~mem140.base, #t~mem140.offset;havoc #t~mem141.base, #t~mem141.offset;havoc #t~mem142.base, #t~mem142.offset; {115540#true} is VALID [2022-04-28 15:39:38,791 INFO L290 TraceCheckUtils]: 87: Hoare triple {115540#true} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {115540#true} is VALID [2022-04-28 15:39:38,792 INFO L290 TraceCheckUtils]: 88: Hoare triple {115540#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {115540#true} is VALID [2022-04-28 15:39:38,792 INFO L290 TraceCheckUtils]: 89: Hoare triple {115540#true} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,792 INFO L290 TraceCheckUtils]: 90: Hoare triple {115540#true} assume !(0 == ~tmp___10~0); {115540#true} is VALID [2022-04-28 15:39:38,792 INFO L290 TraceCheckUtils]: 91: Hoare triple {115540#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,792 INFO L290 TraceCheckUtils]: 92: Hoare triple {115540#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {115540#true} is VALID [2022-04-28 15:39:38,792 INFO L290 TraceCheckUtils]: 93: Hoare triple {115540#true} ~skip~0 := 0; {115540#true} is VALID [2022-04-28 15:39:38,792 INFO L290 TraceCheckUtils]: 94: Hoare triple {115540#true} assume !false; {115540#true} is VALID [2022-04-28 15:39:38,792 INFO L290 TraceCheckUtils]: 95: Hoare triple {115540#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,792 INFO L290 TraceCheckUtils]: 96: Hoare triple {115540#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,792 INFO L290 TraceCheckUtils]: 97: Hoare triple {115540#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,792 INFO L290 TraceCheckUtils]: 98: Hoare triple {115540#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,792 INFO L290 TraceCheckUtils]: 99: Hoare triple {115540#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,792 INFO L290 TraceCheckUtils]: 100: Hoare triple {115540#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,792 INFO L290 TraceCheckUtils]: 101: Hoare triple {115540#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,792 INFO L290 TraceCheckUtils]: 102: Hoare triple {115540#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,793 INFO L290 TraceCheckUtils]: 103: Hoare triple {115540#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,793 INFO L290 TraceCheckUtils]: 104: Hoare triple {115540#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,793 INFO L290 TraceCheckUtils]: 105: Hoare triple {115540#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,793 INFO L290 TraceCheckUtils]: 106: Hoare triple {115540#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,793 INFO L290 TraceCheckUtils]: 107: Hoare triple {115540#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,793 INFO L290 TraceCheckUtils]: 108: Hoare triple {115540#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,793 INFO L290 TraceCheckUtils]: 109: Hoare triple {115540#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,793 INFO L290 TraceCheckUtils]: 110: Hoare triple {115540#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,793 INFO L290 TraceCheckUtils]: 111: Hoare triple {115540#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,793 INFO L290 TraceCheckUtils]: 112: Hoare triple {115540#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,793 INFO L290 TraceCheckUtils]: 113: Hoare triple {115540#true} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,793 INFO L290 TraceCheckUtils]: 114: Hoare triple {115540#true} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,793 INFO L290 TraceCheckUtils]: 115: Hoare triple {115540#true} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,793 INFO L290 TraceCheckUtils]: 116: Hoare triple {115540#true} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,793 INFO L290 TraceCheckUtils]: 117: Hoare triple {115540#true} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,793 INFO L290 TraceCheckUtils]: 118: Hoare triple {115540#true} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,794 INFO L290 TraceCheckUtils]: 119: Hoare triple {115540#true} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,794 INFO L290 TraceCheckUtils]: 120: Hoare triple {115540#true} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,794 INFO L290 TraceCheckUtils]: 121: Hoare triple {115540#true} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,794 INFO L290 TraceCheckUtils]: 122: Hoare triple {115540#true} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,794 INFO L290 TraceCheckUtils]: 123: Hoare triple {115540#true} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,794 INFO L290 TraceCheckUtils]: 124: Hoare triple {115540#true} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,794 INFO L290 TraceCheckUtils]: 125: Hoare triple {115540#true} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,794 INFO L290 TraceCheckUtils]: 126: Hoare triple {115540#true} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,794 INFO L290 TraceCheckUtils]: 127: Hoare triple {115540#true} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {115540#true} is VALID [2022-04-28 15:39:38,794 INFO L290 TraceCheckUtils]: 128: Hoare triple {115540#true} assume 8672 == #t~mem79;havoc #t~mem79; {115540#true} is VALID [2022-04-28 15:39:38,794 INFO L290 TraceCheckUtils]: 129: Hoare triple {115540#true} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {115540#true} is VALID [2022-04-28 15:39:38,795 INFO L290 TraceCheckUtils]: 130: Hoare triple {115540#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {115545#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:39:38,795 INFO L290 TraceCheckUtils]: 131: Hoare triple {115545#(= ssl3_accept_~blastFlag~0 4)} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 72 + ~s.offset, 4);call #t~mem145 := read~int(~s.base, 128 + ~s.offset, 4); {115545#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:39:38,796 INFO L290 TraceCheckUtils]: 132: Hoare triple {115545#(= ssl3_accept_~blastFlag~0 4)} assume 0 != #t~mem145;havoc #t~mem145;call #t~mem146.base, #t~mem146.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8640, #t~mem146.base, 904 + #t~mem146.offset, 4);havoc #t~mem146.base, #t~mem146.offset; {115545#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:39:38,796 INFO L290 TraceCheckUtils]: 133: Hoare triple {115545#(= ssl3_accept_~blastFlag~0 4)} call write~int(0, ~s.base, 88 + ~s.offset, 4); {115545#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:39:38,796 INFO L290 TraceCheckUtils]: 134: Hoare triple {115545#(= ssl3_accept_~blastFlag~0 4)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {115545#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:39:38,797 INFO L290 TraceCheckUtils]: 135: Hoare triple {115545#(= ssl3_accept_~blastFlag~0 4)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {115545#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:39:38,797 INFO L290 TraceCheckUtils]: 136: Hoare triple {115545#(= ssl3_accept_~blastFlag~0 4)} ~skip~0 := 0; {115545#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:39:38,797 INFO L290 TraceCheckUtils]: 137: Hoare triple {115545#(= ssl3_accept_~blastFlag~0 4)} assume !false; {115545#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:39:38,797 INFO L290 TraceCheckUtils]: 138: Hoare triple {115545#(= ssl3_accept_~blastFlag~0 4)} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {115545#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:39:38,798 INFO L290 TraceCheckUtils]: 139: Hoare triple {115545#(= ssl3_accept_~blastFlag~0 4)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {115545#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:39:38,798 INFO L290 TraceCheckUtils]: 140: Hoare triple {115545#(= ssl3_accept_~blastFlag~0 4)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {115545#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:39:38,798 INFO L290 TraceCheckUtils]: 141: Hoare triple {115545#(= ssl3_accept_~blastFlag~0 4)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {115545#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:39:38,799 INFO L290 TraceCheckUtils]: 142: Hoare triple {115545#(= ssl3_accept_~blastFlag~0 4)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {115545#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:39:38,799 INFO L290 TraceCheckUtils]: 143: Hoare triple {115545#(= ssl3_accept_~blastFlag~0 4)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {115545#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:39:38,799 INFO L290 TraceCheckUtils]: 144: Hoare triple {115545#(= ssl3_accept_~blastFlag~0 4)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {115545#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:39:38,800 INFO L290 TraceCheckUtils]: 145: Hoare triple {115545#(= ssl3_accept_~blastFlag~0 4)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {115545#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:39:38,800 INFO L290 TraceCheckUtils]: 146: Hoare triple {115545#(= ssl3_accept_~blastFlag~0 4)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {115545#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:39:38,800 INFO L290 TraceCheckUtils]: 147: Hoare triple {115545#(= ssl3_accept_~blastFlag~0 4)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {115545#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:39:38,800 INFO L290 TraceCheckUtils]: 148: Hoare triple {115545#(= ssl3_accept_~blastFlag~0 4)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {115545#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:39:38,801 INFO L290 TraceCheckUtils]: 149: Hoare triple {115545#(= ssl3_accept_~blastFlag~0 4)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {115545#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:39:38,801 INFO L290 TraceCheckUtils]: 150: Hoare triple {115545#(= ssl3_accept_~blastFlag~0 4)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {115545#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:39:38,801 INFO L290 TraceCheckUtils]: 151: Hoare triple {115545#(= ssl3_accept_~blastFlag~0 4)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {115545#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:39:38,802 INFO L290 TraceCheckUtils]: 152: Hoare triple {115545#(= ssl3_accept_~blastFlag~0 4)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {115545#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:39:38,802 INFO L290 TraceCheckUtils]: 153: Hoare triple {115545#(= ssl3_accept_~blastFlag~0 4)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {115545#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:39:38,802 INFO L290 TraceCheckUtils]: 154: Hoare triple {115545#(= ssl3_accept_~blastFlag~0 4)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {115545#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:39:38,803 INFO L290 TraceCheckUtils]: 155: Hoare triple {115545#(= ssl3_accept_~blastFlag~0 4)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {115545#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:39:38,803 INFO L290 TraceCheckUtils]: 156: Hoare triple {115545#(= ssl3_accept_~blastFlag~0 4)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {115545#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:39:38,803 INFO L290 TraceCheckUtils]: 157: Hoare triple {115545#(= ssl3_accept_~blastFlag~0 4)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {115545#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:39:38,803 INFO L290 TraceCheckUtils]: 158: Hoare triple {115545#(= ssl3_accept_~blastFlag~0 4)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {115545#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:39:38,804 INFO L290 TraceCheckUtils]: 159: Hoare triple {115545#(= ssl3_accept_~blastFlag~0 4)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {115545#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:39:38,804 INFO L290 TraceCheckUtils]: 160: Hoare triple {115545#(= ssl3_accept_~blastFlag~0 4)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {115545#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:39:38,804 INFO L290 TraceCheckUtils]: 161: Hoare triple {115545#(= ssl3_accept_~blastFlag~0 4)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {115545#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:39:38,805 INFO L290 TraceCheckUtils]: 162: Hoare triple {115545#(= ssl3_accept_~blastFlag~0 4)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {115545#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:39:38,805 INFO L290 TraceCheckUtils]: 163: Hoare triple {115545#(= ssl3_accept_~blastFlag~0 4)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {115545#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:39:38,805 INFO L290 TraceCheckUtils]: 164: Hoare triple {115545#(= ssl3_accept_~blastFlag~0 4)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {115545#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:39:38,806 INFO L290 TraceCheckUtils]: 165: Hoare triple {115545#(= ssl3_accept_~blastFlag~0 4)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {115545#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:39:38,806 INFO L290 TraceCheckUtils]: 166: Hoare triple {115545#(= ssl3_accept_~blastFlag~0 4)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {115545#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:39:38,806 INFO L290 TraceCheckUtils]: 167: Hoare triple {115545#(= ssl3_accept_~blastFlag~0 4)} assume 8640 == #t~mem75;havoc #t~mem75; {115545#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:39:38,806 INFO L290 TraceCheckUtils]: 168: Hoare triple {115545#(= ssl3_accept_~blastFlag~0 4)} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {115545#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:39:38,807 INFO L290 TraceCheckUtils]: 169: Hoare triple {115545#(= ssl3_accept_~blastFlag~0 4)} assume !(4 == ~blastFlag~0); {115541#false} is VALID [2022-04-28 15:39:38,807 INFO L290 TraceCheckUtils]: 170: Hoare triple {115541#false} assume !(7 == ~blastFlag~0); {115541#false} is VALID [2022-04-28 15:39:38,807 INFO L290 TraceCheckUtils]: 171: Hoare triple {115541#false} assume !(10 == ~blastFlag~0); {115541#false} is VALID [2022-04-28 15:39:38,807 INFO L290 TraceCheckUtils]: 172: Hoare triple {115541#false} assume !false; {115541#false} is VALID [2022-04-28 15:39:38,807 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-04-28 15:39:38,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:39:38,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509263428] [2022-04-28 15:39:38,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509263428] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:39:38,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:39:38,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:39:38,808 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:39:38,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1796327111] [2022-04-28 15:39:38,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1796327111] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:39:38,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:39:38,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:39:38,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137237237] [2022-04-28 15:39:38,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:39:38,808 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 3 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 173 [2022-04-28 15:39:38,809 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:39:38,809 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 27.0) internal successors, (108), 3 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-28 15:39:38,883 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-28 15:39:38,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:39:38,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:39:38,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:39:38,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:39:38,883 INFO L87 Difference]: Start difference. First operand 637 states and 920 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 3 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-28 15:39:41,971 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:39:43,975 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:39:46,004 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:39:47,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:39:47,215 INFO L93 Difference]: Finished difference Result 1851 states and 2690 transitions. [2022-04-28 15:39:47,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:39:47,215 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 3 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 173 [2022-04-28 15:39:47,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:39:47,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 3 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-28 15:39:47,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 616 transitions. [2022-04-28 15:39:47,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 3 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-28 15:39:47,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 616 transitions. [2022-04-28 15:39:47,219 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 616 transitions. [2022-04-28 15:39:47,585 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 616 edges. 616 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:39:47,649 INFO L225 Difference]: With dead ends: 1851 [2022-04-28 15:39:47,649 INFO L226 Difference]: Without dead ends: 1240 [2022-04-28 15:39:47,650 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-28 15:39:47,650 INFO L413 NwaCegarLoop]: 382 mSDtfsCounter, 143 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 12 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:39:47,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 576 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 431 Invalid, 2 Unknown, 0 Unchecked, 5.4s Time] [2022-04-28 15:39:47,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1240 states. [2022-04-28 15:39:47,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1240 to 1240. [2022-04-28 15:39:47,737 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:39:47,739 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1240 states. Second operand has 1240 states, 1235 states have (on average 1.4453441295546559) internal successors, (1785), 1235 states have internal predecessors, (1785), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:39:47,739 INFO L74 IsIncluded]: Start isIncluded. First operand 1240 states. Second operand has 1240 states, 1235 states have (on average 1.4453441295546559) internal successors, (1785), 1235 states have internal predecessors, (1785), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:39:47,740 INFO L87 Difference]: Start difference. First operand 1240 states. Second operand has 1240 states, 1235 states have (on average 1.4453441295546559) internal successors, (1785), 1235 states have internal predecessors, (1785), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:39:47,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:39:47,777 INFO L93 Difference]: Finished difference Result 1240 states and 1789 transitions. [2022-04-28 15:39:47,777 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states and 1789 transitions. [2022-04-28 15:39:47,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:39:47,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:39:47,779 INFO L74 IsIncluded]: Start isIncluded. First operand has 1240 states, 1235 states have (on average 1.4453441295546559) internal successors, (1785), 1235 states have internal predecessors, (1785), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1240 states. [2022-04-28 15:39:47,780 INFO L87 Difference]: Start difference. First operand has 1240 states, 1235 states have (on average 1.4453441295546559) internal successors, (1785), 1235 states have internal predecessors, (1785), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1240 states. [2022-04-28 15:39:47,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:39:47,817 INFO L93 Difference]: Finished difference Result 1240 states and 1789 transitions. [2022-04-28 15:39:47,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states and 1789 transitions. [2022-04-28 15:39:47,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:39:47,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:39:47,818 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:39:47,818 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:39:47,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1240 states, 1235 states have (on average 1.4453441295546559) internal successors, (1785), 1235 states have internal predecessors, (1785), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:39:47,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 1240 states and 1789 transitions. [2022-04-28 15:39:47,895 INFO L78 Accepts]: Start accepts. Automaton has 1240 states and 1789 transitions. Word has length 173 [2022-04-28 15:39:47,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:39:47,895 INFO L495 AbstractCegarLoop]: Abstraction has 1240 states and 1789 transitions. [2022-04-28 15:39:47,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 3 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-28 15:39:47,896 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1240 states and 1789 transitions. [2022-04-28 15:39:49,604 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1789 edges. 1789 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:39:49,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states and 1789 transitions. [2022-04-28 15:39:49,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-04-28 15:39:49,606 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:39:49,606 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:39:49,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-04-28 15:39:49,606 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:39:49,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:39:49,606 INFO L85 PathProgramCache]: Analyzing trace with hash -790443429, now seen corresponding path program 1 times [2022-04-28 15:39:49,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:39:49,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1767736316] [2022-04-28 15:39:49,718 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:39:49,718 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:39:49,718 INFO L85 PathProgramCache]: Analyzing trace with hash -790443429, now seen corresponding path program 2 times [2022-04-28 15:39:49,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:39:49,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245997824] [2022-04-28 15:39:49,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:39:49,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:39:49,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:39:49,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:39:49,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:39:49,819 INFO L290 TraceCheckUtils]: 0: Hoare triple {124217#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {124211#true} is VALID [2022-04-28 15:39:49,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {124211#true} assume true; {124211#true} is VALID [2022-04-28 15:39:49,819 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {124211#true} {124211#true} #703#return; {124211#true} is VALID [2022-04-28 15:39:49,820 INFO L272 TraceCheckUtils]: 0: Hoare triple {124211#true} call ULTIMATE.init(); {124217#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-28 15:39:49,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {124217#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {124211#true} is VALID [2022-04-28 15:39:49,820 INFO L290 TraceCheckUtils]: 2: Hoare triple {124211#true} assume true; {124211#true} is VALID [2022-04-28 15:39:49,820 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {124211#true} {124211#true} #703#return; {124211#true} is VALID [2022-04-28 15:39:49,820 INFO L272 TraceCheckUtils]: 4: Hoare triple {124211#true} call #t~ret161 := main(); {124211#true} is VALID [2022-04-28 15:39:49,820 INFO L290 TraceCheckUtils]: 5: Hoare triple {124211#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {124211#true} is VALID [2022-04-28 15:39:49,820 INFO L290 TraceCheckUtils]: 6: Hoare triple {124211#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {124211#true} is VALID [2022-04-28 15:39:49,820 INFO L272 TraceCheckUtils]: 7: Hoare triple {124211#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {124211#true} is VALID [2022-04-28 15:39:49,820 INFO L290 TraceCheckUtils]: 8: Hoare triple {124211#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {124211#true} is VALID [2022-04-28 15:39:49,820 INFO L290 TraceCheckUtils]: 9: Hoare triple {124211#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {124211#true} is VALID [2022-04-28 15:39:49,821 INFO L290 TraceCheckUtils]: 10: Hoare triple {124211#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {124211#true} is VALID [2022-04-28 15:39:49,821 INFO L290 TraceCheckUtils]: 11: Hoare triple {124211#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {124211#true} is VALID [2022-04-28 15:39:49,821 INFO L290 TraceCheckUtils]: 12: Hoare triple {124211#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {124211#true} is VALID [2022-04-28 15:39:49,821 INFO L290 TraceCheckUtils]: 13: Hoare triple {124211#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {124211#true} is VALID [2022-04-28 15:39:49,821 INFO L290 TraceCheckUtils]: 14: Hoare triple {124211#true} assume !false; {124211#true} is VALID [2022-04-28 15:39:49,821 INFO L290 TraceCheckUtils]: 15: Hoare triple {124211#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {124211#true} is VALID [2022-04-28 15:39:49,821 INFO L290 TraceCheckUtils]: 16: Hoare triple {124211#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {124211#true} is VALID [2022-04-28 15:39:49,821 INFO L290 TraceCheckUtils]: 17: Hoare triple {124211#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {124211#true} is VALID [2022-04-28 15:39:49,821 INFO L290 TraceCheckUtils]: 18: Hoare triple {124211#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {124211#true} is VALID [2022-04-28 15:39:49,821 INFO L290 TraceCheckUtils]: 19: Hoare triple {124211#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {124211#true} is VALID [2022-04-28 15:39:49,821 INFO L290 TraceCheckUtils]: 20: Hoare triple {124211#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {124211#true} is VALID [2022-04-28 15:39:49,821 INFO L290 TraceCheckUtils]: 21: Hoare triple {124211#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {124211#true} is VALID [2022-04-28 15:39:49,821 INFO L290 TraceCheckUtils]: 22: Hoare triple {124211#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {124211#true} is VALID [2022-04-28 15:39:49,821 INFO L290 TraceCheckUtils]: 23: Hoare triple {124211#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {124211#true} is VALID [2022-04-28 15:39:49,821 INFO L290 TraceCheckUtils]: 24: Hoare triple {124211#true} assume 8464 == #t~mem55;havoc #t~mem55; {124211#true} is VALID [2022-04-28 15:39:49,822 INFO L290 TraceCheckUtils]: 25: Hoare triple {124211#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {124211#true} is VALID [2022-04-28 15:39:49,822 INFO L290 TraceCheckUtils]: 26: Hoare triple {124211#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {124211#true} is VALID [2022-04-28 15:39:49,822 INFO L290 TraceCheckUtils]: 27: Hoare triple {124211#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {124211#true} is VALID [2022-04-28 15:39:49,822 INFO L290 TraceCheckUtils]: 28: Hoare triple {124211#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {124211#true} is VALID [2022-04-28 15:39:49,822 INFO L290 TraceCheckUtils]: 29: Hoare triple {124211#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {124211#true} is VALID [2022-04-28 15:39:49,822 INFO L290 TraceCheckUtils]: 30: Hoare triple {124211#true} ~skip~0 := 0; {124211#true} is VALID [2022-04-28 15:39:49,822 INFO L290 TraceCheckUtils]: 31: Hoare triple {124211#true} assume !false; {124211#true} is VALID [2022-04-28 15:39:49,822 INFO L290 TraceCheckUtils]: 32: Hoare triple {124211#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {124211#true} is VALID [2022-04-28 15:39:49,822 INFO L290 TraceCheckUtils]: 33: Hoare triple {124211#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {124211#true} is VALID [2022-04-28 15:39:49,822 INFO L290 TraceCheckUtils]: 34: Hoare triple {124211#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {124211#true} is VALID [2022-04-28 15:39:49,822 INFO L290 TraceCheckUtils]: 35: Hoare triple {124211#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {124211#true} is VALID [2022-04-28 15:39:49,822 INFO L290 TraceCheckUtils]: 36: Hoare triple {124211#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {124211#true} is VALID [2022-04-28 15:39:49,822 INFO L290 TraceCheckUtils]: 37: Hoare triple {124211#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {124211#true} is VALID [2022-04-28 15:39:49,822 INFO L290 TraceCheckUtils]: 38: Hoare triple {124211#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {124211#true} is VALID [2022-04-28 15:39:49,822 INFO L290 TraceCheckUtils]: 39: Hoare triple {124211#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {124211#true} is VALID [2022-04-28 15:39:49,823 INFO L290 TraceCheckUtils]: 40: Hoare triple {124211#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {124211#true} is VALID [2022-04-28 15:39:49,823 INFO L290 TraceCheckUtils]: 41: Hoare triple {124211#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {124211#true} is VALID [2022-04-28 15:39:49,823 INFO L290 TraceCheckUtils]: 42: Hoare triple {124211#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {124211#true} is VALID [2022-04-28 15:39:49,823 INFO L290 TraceCheckUtils]: 43: Hoare triple {124211#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {124211#true} is VALID [2022-04-28 15:39:49,823 INFO L290 TraceCheckUtils]: 44: Hoare triple {124211#true} assume 8496 == #t~mem58;havoc #t~mem58; {124211#true} is VALID [2022-04-28 15:39:49,823 INFO L290 TraceCheckUtils]: 45: Hoare triple {124211#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {124211#true} is VALID [2022-04-28 15:39:49,823 INFO L290 TraceCheckUtils]: 46: Hoare triple {124211#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {124211#true} is VALID [2022-04-28 15:39:49,823 INFO L290 TraceCheckUtils]: 47: Hoare triple {124211#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {124211#true} is VALID [2022-04-28 15:39:49,823 INFO L290 TraceCheckUtils]: 48: Hoare triple {124211#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {124211#true} is VALID [2022-04-28 15:39:49,823 INFO L290 TraceCheckUtils]: 49: Hoare triple {124211#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {124211#true} is VALID [2022-04-28 15:39:49,823 INFO L290 TraceCheckUtils]: 50: Hoare triple {124211#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {124211#true} is VALID [2022-04-28 15:39:49,823 INFO L290 TraceCheckUtils]: 51: Hoare triple {124211#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {124211#true} is VALID [2022-04-28 15:39:49,823 INFO L290 TraceCheckUtils]: 52: Hoare triple {124211#true} ~skip~0 := 0; {124211#true} is VALID [2022-04-28 15:39:49,823 INFO L290 TraceCheckUtils]: 53: Hoare triple {124211#true} assume !false; {124211#true} is VALID [2022-04-28 15:39:49,823 INFO L290 TraceCheckUtils]: 54: Hoare triple {124211#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {124211#true} is VALID [2022-04-28 15:39:49,824 INFO L290 TraceCheckUtils]: 55: Hoare triple {124211#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {124211#true} is VALID [2022-04-28 15:39:49,824 INFO L290 TraceCheckUtils]: 56: Hoare triple {124211#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {124211#true} is VALID [2022-04-28 15:39:49,824 INFO L290 TraceCheckUtils]: 57: Hoare triple {124211#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {124211#true} is VALID [2022-04-28 15:39:49,824 INFO L290 TraceCheckUtils]: 58: Hoare triple {124211#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {124211#true} is VALID [2022-04-28 15:39:49,824 INFO L290 TraceCheckUtils]: 59: Hoare triple {124211#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {124211#true} is VALID [2022-04-28 15:39:49,824 INFO L290 TraceCheckUtils]: 60: Hoare triple {124211#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {124211#true} is VALID [2022-04-28 15:39:49,824 INFO L290 TraceCheckUtils]: 61: Hoare triple {124211#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {124211#true} is VALID [2022-04-28 15:39:49,824 INFO L290 TraceCheckUtils]: 62: Hoare triple {124211#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {124211#true} is VALID [2022-04-28 15:39:49,824 INFO L290 TraceCheckUtils]: 63: Hoare triple {124211#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {124211#true} is VALID [2022-04-28 15:39:49,824 INFO L290 TraceCheckUtils]: 64: Hoare triple {124211#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {124211#true} is VALID [2022-04-28 15:39:49,824 INFO L290 TraceCheckUtils]: 65: Hoare triple {124211#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {124211#true} is VALID [2022-04-28 15:39:49,824 INFO L290 TraceCheckUtils]: 66: Hoare triple {124211#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {124211#true} is VALID [2022-04-28 15:39:49,824 INFO L290 TraceCheckUtils]: 67: Hoare triple {124211#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {124211#true} is VALID [2022-04-28 15:39:49,824 INFO L290 TraceCheckUtils]: 68: Hoare triple {124211#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {124211#true} is VALID [2022-04-28 15:39:49,824 INFO L290 TraceCheckUtils]: 69: Hoare triple {124211#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {124211#true} is VALID [2022-04-28 15:39:49,825 INFO L290 TraceCheckUtils]: 70: Hoare triple {124211#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {124211#true} is VALID [2022-04-28 15:39:49,825 INFO L290 TraceCheckUtils]: 71: Hoare triple {124211#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {124211#true} is VALID [2022-04-28 15:39:49,825 INFO L290 TraceCheckUtils]: 72: Hoare triple {124211#true} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {124211#true} is VALID [2022-04-28 15:39:49,825 INFO L290 TraceCheckUtils]: 73: Hoare triple {124211#true} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {124211#true} is VALID [2022-04-28 15:39:49,825 INFO L290 TraceCheckUtils]: 74: Hoare triple {124211#true} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {124211#true} is VALID [2022-04-28 15:39:49,825 INFO L290 TraceCheckUtils]: 75: Hoare triple {124211#true} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {124211#true} is VALID [2022-04-28 15:39:49,825 INFO L290 TraceCheckUtils]: 76: Hoare triple {124211#true} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {124211#true} is VALID [2022-04-28 15:39:49,825 INFO L290 TraceCheckUtils]: 77: Hoare triple {124211#true} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {124211#true} is VALID [2022-04-28 15:39:49,825 INFO L290 TraceCheckUtils]: 78: Hoare triple {124211#true} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {124211#true} is VALID [2022-04-28 15:39:49,825 INFO L290 TraceCheckUtils]: 79: Hoare triple {124211#true} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {124211#true} is VALID [2022-04-28 15:39:49,825 INFO L290 TraceCheckUtils]: 80: Hoare triple {124211#true} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {124211#true} is VALID [2022-04-28 15:39:49,825 INFO L290 TraceCheckUtils]: 81: Hoare triple {124211#true} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {124211#true} is VALID [2022-04-28 15:39:49,825 INFO L290 TraceCheckUtils]: 82: Hoare triple {124211#true} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {124211#true} is VALID [2022-04-28 15:39:49,825 INFO L290 TraceCheckUtils]: 83: Hoare triple {124211#true} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {124211#true} is VALID [2022-04-28 15:39:49,825 INFO L290 TraceCheckUtils]: 84: Hoare triple {124211#true} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {124211#true} is VALID [2022-04-28 15:39:49,826 INFO L290 TraceCheckUtils]: 85: Hoare triple {124211#true} assume 8656 == #t~mem77;havoc #t~mem77; {124211#true} is VALID [2022-04-28 15:39:49,826 INFO L290 TraceCheckUtils]: 86: Hoare triple {124211#true} call #t~mem140.base, #t~mem140.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem141.base, #t~mem141.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem142.base, #t~mem142.offset := read~$Pointer$(#t~mem141.base, 888 + #t~mem141.offset, 8);call write~$Pointer$(#t~mem142.base, #t~mem142.offset, #t~mem140.base, 192 + #t~mem140.offset, 8);havoc #t~mem140.base, #t~mem140.offset;havoc #t~mem141.base, #t~mem141.offset;havoc #t~mem142.base, #t~mem142.offset; {124211#true} is VALID [2022-04-28 15:39:49,826 INFO L290 TraceCheckUtils]: 87: Hoare triple {124211#true} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {124211#true} is VALID [2022-04-28 15:39:49,826 INFO L290 TraceCheckUtils]: 88: Hoare triple {124211#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {124216#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:49,826 INFO L290 TraceCheckUtils]: 89: Hoare triple {124216#(= 3 ssl3_accept_~blastFlag~0)} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {124216#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:49,826 INFO L290 TraceCheckUtils]: 90: Hoare triple {124216#(= 3 ssl3_accept_~blastFlag~0)} assume !(0 == ~tmp___10~0); {124216#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:49,827 INFO L290 TraceCheckUtils]: 91: Hoare triple {124216#(= 3 ssl3_accept_~blastFlag~0)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {124216#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:49,827 INFO L290 TraceCheckUtils]: 92: Hoare triple {124216#(= 3 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {124216#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:49,827 INFO L290 TraceCheckUtils]: 93: Hoare triple {124216#(= 3 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {124216#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:49,828 INFO L290 TraceCheckUtils]: 94: Hoare triple {124216#(= 3 ssl3_accept_~blastFlag~0)} assume !false; {124216#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:49,828 INFO L290 TraceCheckUtils]: 95: Hoare triple {124216#(= 3 ssl3_accept_~blastFlag~0)} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {124216#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:49,828 INFO L290 TraceCheckUtils]: 96: Hoare triple {124216#(= 3 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {124216#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:49,828 INFO L290 TraceCheckUtils]: 97: Hoare triple {124216#(= 3 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {124216#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:49,829 INFO L290 TraceCheckUtils]: 98: Hoare triple {124216#(= 3 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {124216#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:49,829 INFO L290 TraceCheckUtils]: 99: Hoare triple {124216#(= 3 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {124216#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:49,829 INFO L290 TraceCheckUtils]: 100: Hoare triple {124216#(= 3 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {124216#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:49,829 INFO L290 TraceCheckUtils]: 101: Hoare triple {124216#(= 3 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {124216#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:49,830 INFO L290 TraceCheckUtils]: 102: Hoare triple {124216#(= 3 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {124216#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:49,830 INFO L290 TraceCheckUtils]: 103: Hoare triple {124216#(= 3 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {124216#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:49,830 INFO L290 TraceCheckUtils]: 104: Hoare triple {124216#(= 3 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {124216#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:49,830 INFO L290 TraceCheckUtils]: 105: Hoare triple {124216#(= 3 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {124216#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:49,831 INFO L290 TraceCheckUtils]: 106: Hoare triple {124216#(= 3 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {124216#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:49,831 INFO L290 TraceCheckUtils]: 107: Hoare triple {124216#(= 3 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {124216#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:49,831 INFO L290 TraceCheckUtils]: 108: Hoare triple {124216#(= 3 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {124216#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:49,831 INFO L290 TraceCheckUtils]: 109: Hoare triple {124216#(= 3 ssl3_accept_~blastFlag~0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {124216#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:49,832 INFO L290 TraceCheckUtils]: 110: Hoare triple {124216#(= 3 ssl3_accept_~blastFlag~0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {124216#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:49,832 INFO L290 TraceCheckUtils]: 111: Hoare triple {124216#(= 3 ssl3_accept_~blastFlag~0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {124216#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:49,832 INFO L290 TraceCheckUtils]: 112: Hoare triple {124216#(= 3 ssl3_accept_~blastFlag~0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {124216#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:49,832 INFO L290 TraceCheckUtils]: 113: Hoare triple {124216#(= 3 ssl3_accept_~blastFlag~0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {124216#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:49,833 INFO L290 TraceCheckUtils]: 114: Hoare triple {124216#(= 3 ssl3_accept_~blastFlag~0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {124216#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:49,833 INFO L290 TraceCheckUtils]: 115: Hoare triple {124216#(= 3 ssl3_accept_~blastFlag~0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {124216#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:49,833 INFO L290 TraceCheckUtils]: 116: Hoare triple {124216#(= 3 ssl3_accept_~blastFlag~0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {124216#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:49,834 INFO L290 TraceCheckUtils]: 117: Hoare triple {124216#(= 3 ssl3_accept_~blastFlag~0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {124216#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:49,834 INFO L290 TraceCheckUtils]: 118: Hoare triple {124216#(= 3 ssl3_accept_~blastFlag~0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {124216#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:49,834 INFO L290 TraceCheckUtils]: 119: Hoare triple {124216#(= 3 ssl3_accept_~blastFlag~0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {124216#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:49,834 INFO L290 TraceCheckUtils]: 120: Hoare triple {124216#(= 3 ssl3_accept_~blastFlag~0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {124216#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:49,835 INFO L290 TraceCheckUtils]: 121: Hoare triple {124216#(= 3 ssl3_accept_~blastFlag~0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {124216#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:49,835 INFO L290 TraceCheckUtils]: 122: Hoare triple {124216#(= 3 ssl3_accept_~blastFlag~0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {124216#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:49,835 INFO L290 TraceCheckUtils]: 123: Hoare triple {124216#(= 3 ssl3_accept_~blastFlag~0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {124216#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:49,835 INFO L290 TraceCheckUtils]: 124: Hoare triple {124216#(= 3 ssl3_accept_~blastFlag~0)} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {124216#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:49,836 INFO L290 TraceCheckUtils]: 125: Hoare triple {124216#(= 3 ssl3_accept_~blastFlag~0)} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {124216#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:49,836 INFO L290 TraceCheckUtils]: 126: Hoare triple {124216#(= 3 ssl3_accept_~blastFlag~0)} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {124216#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:49,836 INFO L290 TraceCheckUtils]: 127: Hoare triple {124216#(= 3 ssl3_accept_~blastFlag~0)} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {124216#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:49,836 INFO L290 TraceCheckUtils]: 128: Hoare triple {124216#(= 3 ssl3_accept_~blastFlag~0)} assume 8672 == #t~mem79;havoc #t~mem79; {124216#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:49,837 INFO L290 TraceCheckUtils]: 129: Hoare triple {124216#(= 3 ssl3_accept_~blastFlag~0)} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {124216#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:49,837 INFO L290 TraceCheckUtils]: 130: Hoare triple {124216#(= 3 ssl3_accept_~blastFlag~0)} assume !(3 == ~blastFlag~0); {124212#false} is VALID [2022-04-28 15:39:49,837 INFO L290 TraceCheckUtils]: 131: Hoare triple {124212#false} assume 6 == ~blastFlag~0;~blastFlag~0 := 7; {124212#false} is VALID [2022-04-28 15:39:49,837 INFO L290 TraceCheckUtils]: 132: Hoare triple {124212#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 72 + ~s.offset, 4);call #t~mem145 := read~int(~s.base, 128 + ~s.offset, 4); {124212#false} is VALID [2022-04-28 15:39:49,837 INFO L290 TraceCheckUtils]: 133: Hoare triple {124212#false} assume 0 != #t~mem145;havoc #t~mem145;call #t~mem146.base, #t~mem146.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8640, #t~mem146.base, 904 + #t~mem146.offset, 4);havoc #t~mem146.base, #t~mem146.offset; {124212#false} is VALID [2022-04-28 15:39:49,837 INFO L290 TraceCheckUtils]: 134: Hoare triple {124212#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {124212#false} is VALID [2022-04-28 15:39:49,837 INFO L290 TraceCheckUtils]: 135: Hoare triple {124212#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {124212#false} is VALID [2022-04-28 15:39:49,837 INFO L290 TraceCheckUtils]: 136: Hoare triple {124212#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {124212#false} is VALID [2022-04-28 15:39:49,837 INFO L290 TraceCheckUtils]: 137: Hoare triple {124212#false} ~skip~0 := 0; {124212#false} is VALID [2022-04-28 15:39:49,837 INFO L290 TraceCheckUtils]: 138: Hoare triple {124212#false} assume !false; {124212#false} is VALID [2022-04-28 15:39:49,837 INFO L290 TraceCheckUtils]: 139: Hoare triple {124212#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {124212#false} is VALID [2022-04-28 15:39:49,837 INFO L290 TraceCheckUtils]: 140: Hoare triple {124212#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {124212#false} is VALID [2022-04-28 15:39:49,838 INFO L290 TraceCheckUtils]: 141: Hoare triple {124212#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {124212#false} is VALID [2022-04-28 15:39:49,838 INFO L290 TraceCheckUtils]: 142: Hoare triple {124212#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {124212#false} is VALID [2022-04-28 15:39:49,838 INFO L290 TraceCheckUtils]: 143: Hoare triple {124212#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {124212#false} is VALID [2022-04-28 15:39:49,838 INFO L290 TraceCheckUtils]: 144: Hoare triple {124212#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {124212#false} is VALID [2022-04-28 15:39:49,838 INFO L290 TraceCheckUtils]: 145: Hoare triple {124212#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {124212#false} is VALID [2022-04-28 15:39:49,838 INFO L290 TraceCheckUtils]: 146: Hoare triple {124212#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {124212#false} is VALID [2022-04-28 15:39:49,838 INFO L290 TraceCheckUtils]: 147: Hoare triple {124212#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {124212#false} is VALID [2022-04-28 15:39:49,838 INFO L290 TraceCheckUtils]: 148: Hoare triple {124212#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {124212#false} is VALID [2022-04-28 15:39:49,838 INFO L290 TraceCheckUtils]: 149: Hoare triple {124212#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {124212#false} is VALID [2022-04-28 15:39:49,838 INFO L290 TraceCheckUtils]: 150: Hoare triple {124212#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {124212#false} is VALID [2022-04-28 15:39:49,838 INFO L290 TraceCheckUtils]: 151: Hoare triple {124212#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {124212#false} is VALID [2022-04-28 15:39:49,838 INFO L290 TraceCheckUtils]: 152: Hoare triple {124212#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {124212#false} is VALID [2022-04-28 15:39:49,838 INFO L290 TraceCheckUtils]: 153: Hoare triple {124212#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {124212#false} is VALID [2022-04-28 15:39:49,838 INFO L290 TraceCheckUtils]: 154: Hoare triple {124212#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {124212#false} is VALID [2022-04-28 15:39:49,838 INFO L290 TraceCheckUtils]: 155: Hoare triple {124212#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {124212#false} is VALID [2022-04-28 15:39:49,839 INFO L290 TraceCheckUtils]: 156: Hoare triple {124212#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {124212#false} is VALID [2022-04-28 15:39:49,839 INFO L290 TraceCheckUtils]: 157: Hoare triple {124212#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {124212#false} is VALID [2022-04-28 15:39:49,839 INFO L290 TraceCheckUtils]: 158: Hoare triple {124212#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {124212#false} is VALID [2022-04-28 15:39:49,839 INFO L290 TraceCheckUtils]: 159: Hoare triple {124212#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {124212#false} is VALID [2022-04-28 15:39:49,839 INFO L290 TraceCheckUtils]: 160: Hoare triple {124212#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {124212#false} is VALID [2022-04-28 15:39:49,839 INFO L290 TraceCheckUtils]: 161: Hoare triple {124212#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {124212#false} is VALID [2022-04-28 15:39:49,839 INFO L290 TraceCheckUtils]: 162: Hoare triple {124212#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {124212#false} is VALID [2022-04-28 15:39:49,839 INFO L290 TraceCheckUtils]: 163: Hoare triple {124212#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {124212#false} is VALID [2022-04-28 15:39:49,839 INFO L290 TraceCheckUtils]: 164: Hoare triple {124212#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {124212#false} is VALID [2022-04-28 15:39:49,839 INFO L290 TraceCheckUtils]: 165: Hoare triple {124212#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {124212#false} is VALID [2022-04-28 15:39:49,839 INFO L290 TraceCheckUtils]: 166: Hoare triple {124212#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {124212#false} is VALID [2022-04-28 15:39:49,839 INFO L290 TraceCheckUtils]: 167: Hoare triple {124212#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {124212#false} is VALID [2022-04-28 15:39:49,839 INFO L290 TraceCheckUtils]: 168: Hoare triple {124212#false} assume 8640 == #t~mem75;havoc #t~mem75; {124212#false} is VALID [2022-04-28 15:39:49,839 INFO L290 TraceCheckUtils]: 169: Hoare triple {124212#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {124212#false} is VALID [2022-04-28 15:39:49,839 INFO L290 TraceCheckUtils]: 170: Hoare triple {124212#false} assume !(4 == ~blastFlag~0); {124212#false} is VALID [2022-04-28 15:39:49,840 INFO L290 TraceCheckUtils]: 171: Hoare triple {124212#false} assume !(7 == ~blastFlag~0); {124212#false} is VALID [2022-04-28 15:39:49,840 INFO L290 TraceCheckUtils]: 172: Hoare triple {124212#false} assume !(10 == ~blastFlag~0); {124212#false} is VALID [2022-04-28 15:39:49,840 INFO L290 TraceCheckUtils]: 173: Hoare triple {124212#false} assume !false; {124212#false} is VALID [2022-04-28 15:39:49,843 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-28 15:39:49,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:39:49,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245997824] [2022-04-28 15:39:49,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245997824] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:39:49,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:39:49,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:39:49,844 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:39:49,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1767736316] [2022-04-28 15:39:49,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1767736316] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:39:49,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:39:49,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:39:49,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017269277] [2022-04-28 15:39:49,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:39:49,844 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 174 [2022-04-28 15:39:49,845 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:39:49,845 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 36.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:39:49,941 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:39:49,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:39:49,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:39:49,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:39:49,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:39:49,941 INFO L87 Difference]: Start difference. First operand 1240 states and 1789 transitions. Second operand has 4 states, 4 states have (on average 36.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:39:52,641 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:39:54,084 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:39:55,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:39:55,429 INFO L93 Difference]: Finished difference Result 3022 states and 4374 transitions. [2022-04-28 15:39:55,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:39:55,429 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 174 [2022-04-28 15:39:55,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:39:55,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 36.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:39:55,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 611 transitions. [2022-04-28 15:39:55,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 36.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:39:55,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 611 transitions. [2022-04-28 15:39:55,434 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 611 transitions. [2022-04-28 15:39:55,812 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 611 edges. 611 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:39:55,958 INFO L225 Difference]: With dead ends: 3022 [2022-04-28 15:39:55,959 INFO L226 Difference]: Without dead ends: 1808 [2022-04-28 15:39:55,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:39:55,960 INFO L413 NwaCegarLoop]: 310 mSDtfsCounter, 136 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-04-28 15:39:55,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 504 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 358 Invalid, 1 Unknown, 0 Unchecked, 3.7s Time] [2022-04-28 15:39:55,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1808 states. [2022-04-28 15:39:56,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1808 to 1806. [2022-04-28 15:39:56,066 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:39:56,068 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1808 states. Second operand has 1806 states, 1801 states have (on average 1.4436424208772904) internal successors, (2600), 1801 states have internal predecessors, (2600), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:39:56,070 INFO L74 IsIncluded]: Start isIncluded. First operand 1808 states. Second operand has 1806 states, 1801 states have (on average 1.4436424208772904) internal successors, (2600), 1801 states have internal predecessors, (2600), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:39:56,071 INFO L87 Difference]: Start difference. First operand 1808 states. Second operand has 1806 states, 1801 states have (on average 1.4436424208772904) internal successors, (2600), 1801 states have internal predecessors, (2600), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:39:56,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:39:56,151 INFO L93 Difference]: Finished difference Result 1808 states and 2605 transitions. [2022-04-28 15:39:56,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2605 transitions. [2022-04-28 15:39:56,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:39:56,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:39:56,155 INFO L74 IsIncluded]: Start isIncluded. First operand has 1806 states, 1801 states have (on average 1.4436424208772904) internal successors, (2600), 1801 states have internal predecessors, (2600), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1808 states. [2022-04-28 15:39:56,156 INFO L87 Difference]: Start difference. First operand has 1806 states, 1801 states have (on average 1.4436424208772904) internal successors, (2600), 1801 states have internal predecessors, (2600), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1808 states. [2022-04-28 15:39:56,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:39:56,236 INFO L93 Difference]: Finished difference Result 1808 states and 2605 transitions. [2022-04-28 15:39:56,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2605 transitions. [2022-04-28 15:39:56,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:39:56,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:39:56,238 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:39:56,238 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:39:56,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1806 states, 1801 states have (on average 1.4436424208772904) internal successors, (2600), 1801 states have internal predecessors, (2600), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:39:56,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1806 states to 1806 states and 2604 transitions. [2022-04-28 15:39:56,393 INFO L78 Accepts]: Start accepts. Automaton has 1806 states and 2604 transitions. Word has length 174 [2022-04-28 15:39:56,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:39:56,393 INFO L495 AbstractCegarLoop]: Abstraction has 1806 states and 2604 transitions. [2022-04-28 15:39:56,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:39:56,393 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1806 states and 2604 transitions. [2022-04-28 15:39:58,533 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2604 edges. 2604 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:39:58,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1806 states and 2604 transitions. [2022-04-28 15:39:58,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-04-28 15:39:58,535 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:39:58,535 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:39:58,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-04-28 15:39:58,536 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:39:58,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:39:58,536 INFO L85 PathProgramCache]: Analyzing trace with hash -729324120, now seen corresponding path program 1 times [2022-04-28 15:39:58,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:39:58,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [105145137] [2022-04-28 15:39:58,609 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:39:58,609 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:39:58,609 INFO L85 PathProgramCache]: Analyzing trace with hash -729324120, now seen corresponding path program 2 times [2022-04-28 15:39:58,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:39:58,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254490750] [2022-04-28 15:39:58,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:39:58,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:39:58,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:39:58,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:39:58,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:39:58,710 INFO L290 TraceCheckUtils]: 0: Hoare triple {137498#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {137492#true} is VALID [2022-04-28 15:39:58,710 INFO L290 TraceCheckUtils]: 1: Hoare triple {137492#true} assume true; {137492#true} is VALID [2022-04-28 15:39:58,710 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {137492#true} {137492#true} #703#return; {137492#true} is VALID [2022-04-28 15:39:58,711 INFO L272 TraceCheckUtils]: 0: Hoare triple {137492#true} call ULTIMATE.init(); {137498#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-28 15:39:58,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {137498#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {137492#true} is VALID [2022-04-28 15:39:58,711 INFO L290 TraceCheckUtils]: 2: Hoare triple {137492#true} assume true; {137492#true} is VALID [2022-04-28 15:39:58,711 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {137492#true} {137492#true} #703#return; {137492#true} is VALID [2022-04-28 15:39:58,711 INFO L272 TraceCheckUtils]: 4: Hoare triple {137492#true} call #t~ret161 := main(); {137492#true} is VALID [2022-04-28 15:39:58,711 INFO L290 TraceCheckUtils]: 5: Hoare triple {137492#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {137492#true} is VALID [2022-04-28 15:39:58,711 INFO L290 TraceCheckUtils]: 6: Hoare triple {137492#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {137492#true} is VALID [2022-04-28 15:39:58,711 INFO L272 TraceCheckUtils]: 7: Hoare triple {137492#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {137492#true} is VALID [2022-04-28 15:39:58,712 INFO L290 TraceCheckUtils]: 8: Hoare triple {137492#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {137492#true} is VALID [2022-04-28 15:39:58,712 INFO L290 TraceCheckUtils]: 9: Hoare triple {137492#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {137492#true} is VALID [2022-04-28 15:39:58,712 INFO L290 TraceCheckUtils]: 10: Hoare triple {137492#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {137492#true} is VALID [2022-04-28 15:39:58,712 INFO L290 TraceCheckUtils]: 11: Hoare triple {137492#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {137492#true} is VALID [2022-04-28 15:39:58,712 INFO L290 TraceCheckUtils]: 12: Hoare triple {137492#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {137492#true} is VALID [2022-04-28 15:39:58,712 INFO L290 TraceCheckUtils]: 13: Hoare triple {137492#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {137492#true} is VALID [2022-04-28 15:39:58,712 INFO L290 TraceCheckUtils]: 14: Hoare triple {137492#true} assume !false; {137492#true} is VALID [2022-04-28 15:39:58,712 INFO L290 TraceCheckUtils]: 15: Hoare triple {137492#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {137492#true} is VALID [2022-04-28 15:39:58,712 INFO L290 TraceCheckUtils]: 16: Hoare triple {137492#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {137492#true} is VALID [2022-04-28 15:39:58,712 INFO L290 TraceCheckUtils]: 17: Hoare triple {137492#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {137492#true} is VALID [2022-04-28 15:39:58,712 INFO L290 TraceCheckUtils]: 18: Hoare triple {137492#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {137492#true} is VALID [2022-04-28 15:39:58,712 INFO L290 TraceCheckUtils]: 19: Hoare triple {137492#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {137492#true} is VALID [2022-04-28 15:39:58,712 INFO L290 TraceCheckUtils]: 20: Hoare triple {137492#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {137492#true} is VALID [2022-04-28 15:39:58,712 INFO L290 TraceCheckUtils]: 21: Hoare triple {137492#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {137492#true} is VALID [2022-04-28 15:39:58,712 INFO L290 TraceCheckUtils]: 22: Hoare triple {137492#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {137492#true} is VALID [2022-04-28 15:39:58,713 INFO L290 TraceCheckUtils]: 23: Hoare triple {137492#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {137492#true} is VALID [2022-04-28 15:39:58,713 INFO L290 TraceCheckUtils]: 24: Hoare triple {137492#true} assume 8464 == #t~mem55;havoc #t~mem55; {137492#true} is VALID [2022-04-28 15:39:58,713 INFO L290 TraceCheckUtils]: 25: Hoare triple {137492#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {137492#true} is VALID [2022-04-28 15:39:58,713 INFO L290 TraceCheckUtils]: 26: Hoare triple {137492#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {137492#true} is VALID [2022-04-28 15:39:58,713 INFO L290 TraceCheckUtils]: 27: Hoare triple {137492#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {137492#true} is VALID [2022-04-28 15:39:58,713 INFO L290 TraceCheckUtils]: 28: Hoare triple {137492#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {137492#true} is VALID [2022-04-28 15:39:58,713 INFO L290 TraceCheckUtils]: 29: Hoare triple {137492#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {137492#true} is VALID [2022-04-28 15:39:58,713 INFO L290 TraceCheckUtils]: 30: Hoare triple {137492#true} ~skip~0 := 0; {137492#true} is VALID [2022-04-28 15:39:58,713 INFO L290 TraceCheckUtils]: 31: Hoare triple {137492#true} assume !false; {137492#true} is VALID [2022-04-28 15:39:58,713 INFO L290 TraceCheckUtils]: 32: Hoare triple {137492#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {137492#true} is VALID [2022-04-28 15:39:58,713 INFO L290 TraceCheckUtils]: 33: Hoare triple {137492#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {137492#true} is VALID [2022-04-28 15:39:58,713 INFO L290 TraceCheckUtils]: 34: Hoare triple {137492#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {137492#true} is VALID [2022-04-28 15:39:58,713 INFO L290 TraceCheckUtils]: 35: Hoare triple {137492#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {137492#true} is VALID [2022-04-28 15:39:58,713 INFO L290 TraceCheckUtils]: 36: Hoare triple {137492#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {137492#true} is VALID [2022-04-28 15:39:58,714 INFO L290 TraceCheckUtils]: 37: Hoare triple {137492#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {137492#true} is VALID [2022-04-28 15:39:58,714 INFO L290 TraceCheckUtils]: 38: Hoare triple {137492#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {137492#true} is VALID [2022-04-28 15:39:58,714 INFO L290 TraceCheckUtils]: 39: Hoare triple {137492#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {137492#true} is VALID [2022-04-28 15:39:58,714 INFO L290 TraceCheckUtils]: 40: Hoare triple {137492#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {137492#true} is VALID [2022-04-28 15:39:58,714 INFO L290 TraceCheckUtils]: 41: Hoare triple {137492#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {137492#true} is VALID [2022-04-28 15:39:58,714 INFO L290 TraceCheckUtils]: 42: Hoare triple {137492#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {137492#true} is VALID [2022-04-28 15:39:58,714 INFO L290 TraceCheckUtils]: 43: Hoare triple {137492#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {137492#true} is VALID [2022-04-28 15:39:58,714 INFO L290 TraceCheckUtils]: 44: Hoare triple {137492#true} assume 8496 == #t~mem58;havoc #t~mem58; {137492#true} is VALID [2022-04-28 15:39:58,714 INFO L290 TraceCheckUtils]: 45: Hoare triple {137492#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {137492#true} is VALID [2022-04-28 15:39:58,715 INFO L290 TraceCheckUtils]: 46: Hoare triple {137492#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {137497#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:58,715 INFO L290 TraceCheckUtils]: 47: Hoare triple {137497#(= 2 ssl3_accept_~blastFlag~0)} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {137497#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:58,715 INFO L290 TraceCheckUtils]: 48: Hoare triple {137497#(= 2 ssl3_accept_~blastFlag~0)} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {137497#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:58,715 INFO L290 TraceCheckUtils]: 49: Hoare triple {137497#(= 2 ssl3_accept_~blastFlag~0)} call write~int(0, ~s.base, 88 + ~s.offset, 4); {137497#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:58,715 INFO L290 TraceCheckUtils]: 50: Hoare triple {137497#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {137497#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:58,716 INFO L290 TraceCheckUtils]: 51: Hoare triple {137497#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {137497#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:58,716 INFO L290 TraceCheckUtils]: 52: Hoare triple {137497#(= 2 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {137497#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:58,716 INFO L290 TraceCheckUtils]: 53: Hoare triple {137497#(= 2 ssl3_accept_~blastFlag~0)} assume !false; {137497#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:58,716 INFO L290 TraceCheckUtils]: 54: Hoare triple {137497#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {137497#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:58,717 INFO L290 TraceCheckUtils]: 55: Hoare triple {137497#(= 2 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {137497#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:58,717 INFO L290 TraceCheckUtils]: 56: Hoare triple {137497#(= 2 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {137497#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:58,717 INFO L290 TraceCheckUtils]: 57: Hoare triple {137497#(= 2 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {137497#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:58,717 INFO L290 TraceCheckUtils]: 58: Hoare triple {137497#(= 2 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {137497#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:58,717 INFO L290 TraceCheckUtils]: 59: Hoare triple {137497#(= 2 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {137497#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:58,718 INFO L290 TraceCheckUtils]: 60: Hoare triple {137497#(= 2 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {137497#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:58,718 INFO L290 TraceCheckUtils]: 61: Hoare triple {137497#(= 2 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {137497#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:58,718 INFO L290 TraceCheckUtils]: 62: Hoare triple {137497#(= 2 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {137497#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:58,718 INFO L290 TraceCheckUtils]: 63: Hoare triple {137497#(= 2 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {137497#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:58,718 INFO L290 TraceCheckUtils]: 64: Hoare triple {137497#(= 2 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {137497#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:58,719 INFO L290 TraceCheckUtils]: 65: Hoare triple {137497#(= 2 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {137497#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:58,719 INFO L290 TraceCheckUtils]: 66: Hoare triple {137497#(= 2 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {137497#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:58,719 INFO L290 TraceCheckUtils]: 67: Hoare triple {137497#(= 2 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {137497#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:58,719 INFO L290 TraceCheckUtils]: 68: Hoare triple {137497#(= 2 ssl3_accept_~blastFlag~0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {137497#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:58,720 INFO L290 TraceCheckUtils]: 69: Hoare triple {137497#(= 2 ssl3_accept_~blastFlag~0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {137497#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:58,720 INFO L290 TraceCheckUtils]: 70: Hoare triple {137497#(= 2 ssl3_accept_~blastFlag~0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {137497#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:58,720 INFO L290 TraceCheckUtils]: 71: Hoare triple {137497#(= 2 ssl3_accept_~blastFlag~0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {137497#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:58,720 INFO L290 TraceCheckUtils]: 72: Hoare triple {137497#(= 2 ssl3_accept_~blastFlag~0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {137497#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:58,720 INFO L290 TraceCheckUtils]: 73: Hoare triple {137497#(= 2 ssl3_accept_~blastFlag~0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {137497#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:58,721 INFO L290 TraceCheckUtils]: 74: Hoare triple {137497#(= 2 ssl3_accept_~blastFlag~0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {137497#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:58,721 INFO L290 TraceCheckUtils]: 75: Hoare triple {137497#(= 2 ssl3_accept_~blastFlag~0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {137497#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:58,721 INFO L290 TraceCheckUtils]: 76: Hoare triple {137497#(= 2 ssl3_accept_~blastFlag~0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {137497#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:58,721 INFO L290 TraceCheckUtils]: 77: Hoare triple {137497#(= 2 ssl3_accept_~blastFlag~0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {137497#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:58,722 INFO L290 TraceCheckUtils]: 78: Hoare triple {137497#(= 2 ssl3_accept_~blastFlag~0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {137497#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:58,722 INFO L290 TraceCheckUtils]: 79: Hoare triple {137497#(= 2 ssl3_accept_~blastFlag~0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {137497#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:58,722 INFO L290 TraceCheckUtils]: 80: Hoare triple {137497#(= 2 ssl3_accept_~blastFlag~0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {137497#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:58,722 INFO L290 TraceCheckUtils]: 81: Hoare triple {137497#(= 2 ssl3_accept_~blastFlag~0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {137497#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:58,722 INFO L290 TraceCheckUtils]: 82: Hoare triple {137497#(= 2 ssl3_accept_~blastFlag~0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {137497#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:58,723 INFO L290 TraceCheckUtils]: 83: Hoare triple {137497#(= 2 ssl3_accept_~blastFlag~0)} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {137497#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:58,723 INFO L290 TraceCheckUtils]: 84: Hoare triple {137497#(= 2 ssl3_accept_~blastFlag~0)} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {137497#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:58,723 INFO L290 TraceCheckUtils]: 85: Hoare triple {137497#(= 2 ssl3_accept_~blastFlag~0)} assume 8656 == #t~mem77;havoc #t~mem77; {137497#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:58,723 INFO L290 TraceCheckUtils]: 86: Hoare triple {137497#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem140.base, #t~mem140.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem141.base, #t~mem141.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem142.base, #t~mem142.offset := read~$Pointer$(#t~mem141.base, 888 + #t~mem141.offset, 8);call write~$Pointer$(#t~mem142.base, #t~mem142.offset, #t~mem140.base, 192 + #t~mem140.offset, 8);havoc #t~mem140.base, #t~mem140.offset;havoc #t~mem141.base, #t~mem141.offset;havoc #t~mem142.base, #t~mem142.offset; {137497#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:58,724 INFO L290 TraceCheckUtils]: 87: Hoare triple {137497#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {137497#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:39:58,724 INFO L290 TraceCheckUtils]: 88: Hoare triple {137497#(= 2 ssl3_accept_~blastFlag~0)} assume !(2 == ~blastFlag~0); {137493#false} is VALID [2022-04-28 15:39:58,724 INFO L290 TraceCheckUtils]: 89: Hoare triple {137493#false} assume 5 == ~blastFlag~0;~blastFlag~0 := 6; {137493#false} is VALID [2022-04-28 15:39:58,724 INFO L290 TraceCheckUtils]: 90: Hoare triple {137493#false} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {137493#false} is VALID [2022-04-28 15:39:58,724 INFO L290 TraceCheckUtils]: 91: Hoare triple {137493#false} assume !(0 == ~tmp___10~0); {137493#false} is VALID [2022-04-28 15:39:58,724 INFO L290 TraceCheckUtils]: 92: Hoare triple {137493#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {137493#false} is VALID [2022-04-28 15:39:58,724 INFO L290 TraceCheckUtils]: 93: Hoare triple {137493#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {137493#false} is VALID [2022-04-28 15:39:58,724 INFO L290 TraceCheckUtils]: 94: Hoare triple {137493#false} ~skip~0 := 0; {137493#false} is VALID [2022-04-28 15:39:58,724 INFO L290 TraceCheckUtils]: 95: Hoare triple {137493#false} assume !false; {137493#false} is VALID [2022-04-28 15:39:58,724 INFO L290 TraceCheckUtils]: 96: Hoare triple {137493#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {137493#false} is VALID [2022-04-28 15:39:58,725 INFO L290 TraceCheckUtils]: 97: Hoare triple {137493#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {137493#false} is VALID [2022-04-28 15:39:58,725 INFO L290 TraceCheckUtils]: 98: Hoare triple {137493#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {137493#false} is VALID [2022-04-28 15:39:58,725 INFO L290 TraceCheckUtils]: 99: Hoare triple {137493#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {137493#false} is VALID [2022-04-28 15:39:58,725 INFO L290 TraceCheckUtils]: 100: Hoare triple {137493#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {137493#false} is VALID [2022-04-28 15:39:58,725 INFO L290 TraceCheckUtils]: 101: Hoare triple {137493#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {137493#false} is VALID [2022-04-28 15:39:58,725 INFO L290 TraceCheckUtils]: 102: Hoare triple {137493#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {137493#false} is VALID [2022-04-28 15:39:58,725 INFO L290 TraceCheckUtils]: 103: Hoare triple {137493#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {137493#false} is VALID [2022-04-28 15:39:58,725 INFO L290 TraceCheckUtils]: 104: Hoare triple {137493#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {137493#false} is VALID [2022-04-28 15:39:58,725 INFO L290 TraceCheckUtils]: 105: Hoare triple {137493#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {137493#false} is VALID [2022-04-28 15:39:58,725 INFO L290 TraceCheckUtils]: 106: Hoare triple {137493#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {137493#false} is VALID [2022-04-28 15:39:58,725 INFO L290 TraceCheckUtils]: 107: Hoare triple {137493#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {137493#false} is VALID [2022-04-28 15:39:58,725 INFO L290 TraceCheckUtils]: 108: Hoare triple {137493#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {137493#false} is VALID [2022-04-28 15:39:58,725 INFO L290 TraceCheckUtils]: 109: Hoare triple {137493#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {137493#false} is VALID [2022-04-28 15:39:58,725 INFO L290 TraceCheckUtils]: 110: Hoare triple {137493#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {137493#false} is VALID [2022-04-28 15:39:58,725 INFO L290 TraceCheckUtils]: 111: Hoare triple {137493#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {137493#false} is VALID [2022-04-28 15:39:58,726 INFO L290 TraceCheckUtils]: 112: Hoare triple {137493#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {137493#false} is VALID [2022-04-28 15:39:58,726 INFO L290 TraceCheckUtils]: 113: Hoare triple {137493#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {137493#false} is VALID [2022-04-28 15:39:58,726 INFO L290 TraceCheckUtils]: 114: Hoare triple {137493#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {137493#false} is VALID [2022-04-28 15:39:58,726 INFO L290 TraceCheckUtils]: 115: Hoare triple {137493#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {137493#false} is VALID [2022-04-28 15:39:58,726 INFO L290 TraceCheckUtils]: 116: Hoare triple {137493#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {137493#false} is VALID [2022-04-28 15:39:58,726 INFO L290 TraceCheckUtils]: 117: Hoare triple {137493#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {137493#false} is VALID [2022-04-28 15:39:58,726 INFO L290 TraceCheckUtils]: 118: Hoare triple {137493#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {137493#false} is VALID [2022-04-28 15:39:58,726 INFO L290 TraceCheckUtils]: 119: Hoare triple {137493#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {137493#false} is VALID [2022-04-28 15:39:58,726 INFO L290 TraceCheckUtils]: 120: Hoare triple {137493#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {137493#false} is VALID [2022-04-28 15:39:58,726 INFO L290 TraceCheckUtils]: 121: Hoare triple {137493#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {137493#false} is VALID [2022-04-28 15:39:58,726 INFO L290 TraceCheckUtils]: 122: Hoare triple {137493#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {137493#false} is VALID [2022-04-28 15:39:58,726 INFO L290 TraceCheckUtils]: 123: Hoare triple {137493#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {137493#false} is VALID [2022-04-28 15:39:58,726 INFO L290 TraceCheckUtils]: 124: Hoare triple {137493#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {137493#false} is VALID [2022-04-28 15:39:58,726 INFO L290 TraceCheckUtils]: 125: Hoare triple {137493#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {137493#false} is VALID [2022-04-28 15:39:58,727 INFO L290 TraceCheckUtils]: 126: Hoare triple {137493#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {137493#false} is VALID [2022-04-28 15:39:58,727 INFO L290 TraceCheckUtils]: 127: Hoare triple {137493#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {137493#false} is VALID [2022-04-28 15:39:58,727 INFO L290 TraceCheckUtils]: 128: Hoare triple {137493#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {137493#false} is VALID [2022-04-28 15:39:58,727 INFO L290 TraceCheckUtils]: 129: Hoare triple {137493#false} assume 8672 == #t~mem79;havoc #t~mem79; {137493#false} is VALID [2022-04-28 15:39:58,727 INFO L290 TraceCheckUtils]: 130: Hoare triple {137493#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {137493#false} is VALID [2022-04-28 15:39:58,727 INFO L290 TraceCheckUtils]: 131: Hoare triple {137493#false} assume !(3 == ~blastFlag~0); {137493#false} is VALID [2022-04-28 15:39:58,727 INFO L290 TraceCheckUtils]: 132: Hoare triple {137493#false} assume 6 == ~blastFlag~0;~blastFlag~0 := 7; {137493#false} is VALID [2022-04-28 15:39:58,727 INFO L290 TraceCheckUtils]: 133: Hoare triple {137493#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 72 + ~s.offset, 4);call #t~mem145 := read~int(~s.base, 128 + ~s.offset, 4); {137493#false} is VALID [2022-04-28 15:39:58,727 INFO L290 TraceCheckUtils]: 134: Hoare triple {137493#false} assume 0 != #t~mem145;havoc #t~mem145;call #t~mem146.base, #t~mem146.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8640, #t~mem146.base, 904 + #t~mem146.offset, 4);havoc #t~mem146.base, #t~mem146.offset; {137493#false} is VALID [2022-04-28 15:39:58,727 INFO L290 TraceCheckUtils]: 135: Hoare triple {137493#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {137493#false} is VALID [2022-04-28 15:39:58,727 INFO L290 TraceCheckUtils]: 136: Hoare triple {137493#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {137493#false} is VALID [2022-04-28 15:39:58,727 INFO L290 TraceCheckUtils]: 137: Hoare triple {137493#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {137493#false} is VALID [2022-04-28 15:39:58,727 INFO L290 TraceCheckUtils]: 138: Hoare triple {137493#false} ~skip~0 := 0; {137493#false} is VALID [2022-04-28 15:39:58,727 INFO L290 TraceCheckUtils]: 139: Hoare triple {137493#false} assume !false; {137493#false} is VALID [2022-04-28 15:39:58,727 INFO L290 TraceCheckUtils]: 140: Hoare triple {137493#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {137493#false} is VALID [2022-04-28 15:39:58,728 INFO L290 TraceCheckUtils]: 141: Hoare triple {137493#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {137493#false} is VALID [2022-04-28 15:39:58,728 INFO L290 TraceCheckUtils]: 142: Hoare triple {137493#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {137493#false} is VALID [2022-04-28 15:39:58,728 INFO L290 TraceCheckUtils]: 143: Hoare triple {137493#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {137493#false} is VALID [2022-04-28 15:39:58,728 INFO L290 TraceCheckUtils]: 144: Hoare triple {137493#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {137493#false} is VALID [2022-04-28 15:39:58,728 INFO L290 TraceCheckUtils]: 145: Hoare triple {137493#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {137493#false} is VALID [2022-04-28 15:39:58,728 INFO L290 TraceCheckUtils]: 146: Hoare triple {137493#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {137493#false} is VALID [2022-04-28 15:39:58,728 INFO L290 TraceCheckUtils]: 147: Hoare triple {137493#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {137493#false} is VALID [2022-04-28 15:39:58,728 INFO L290 TraceCheckUtils]: 148: Hoare triple {137493#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {137493#false} is VALID [2022-04-28 15:39:58,728 INFO L290 TraceCheckUtils]: 149: Hoare triple {137493#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {137493#false} is VALID [2022-04-28 15:39:58,728 INFO L290 TraceCheckUtils]: 150: Hoare triple {137493#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {137493#false} is VALID [2022-04-28 15:39:58,728 INFO L290 TraceCheckUtils]: 151: Hoare triple {137493#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {137493#false} is VALID [2022-04-28 15:39:58,728 INFO L290 TraceCheckUtils]: 152: Hoare triple {137493#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {137493#false} is VALID [2022-04-28 15:39:58,728 INFO L290 TraceCheckUtils]: 153: Hoare triple {137493#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {137493#false} is VALID [2022-04-28 15:39:58,728 INFO L290 TraceCheckUtils]: 154: Hoare triple {137493#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {137493#false} is VALID [2022-04-28 15:39:58,728 INFO L290 TraceCheckUtils]: 155: Hoare triple {137493#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {137493#false} is VALID [2022-04-28 15:39:58,729 INFO L290 TraceCheckUtils]: 156: Hoare triple {137493#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {137493#false} is VALID [2022-04-28 15:39:58,729 INFO L290 TraceCheckUtils]: 157: Hoare triple {137493#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {137493#false} is VALID [2022-04-28 15:39:58,729 INFO L290 TraceCheckUtils]: 158: Hoare triple {137493#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {137493#false} is VALID [2022-04-28 15:39:58,729 INFO L290 TraceCheckUtils]: 159: Hoare triple {137493#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {137493#false} is VALID [2022-04-28 15:39:58,729 INFO L290 TraceCheckUtils]: 160: Hoare triple {137493#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {137493#false} is VALID [2022-04-28 15:39:58,729 INFO L290 TraceCheckUtils]: 161: Hoare triple {137493#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {137493#false} is VALID [2022-04-28 15:39:58,729 INFO L290 TraceCheckUtils]: 162: Hoare triple {137493#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {137493#false} is VALID [2022-04-28 15:39:58,729 INFO L290 TraceCheckUtils]: 163: Hoare triple {137493#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {137493#false} is VALID [2022-04-28 15:39:58,729 INFO L290 TraceCheckUtils]: 164: Hoare triple {137493#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {137493#false} is VALID [2022-04-28 15:39:58,729 INFO L290 TraceCheckUtils]: 165: Hoare triple {137493#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {137493#false} is VALID [2022-04-28 15:39:58,729 INFO L290 TraceCheckUtils]: 166: Hoare triple {137493#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {137493#false} is VALID [2022-04-28 15:39:58,729 INFO L290 TraceCheckUtils]: 167: Hoare triple {137493#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {137493#false} is VALID [2022-04-28 15:39:58,729 INFO L290 TraceCheckUtils]: 168: Hoare triple {137493#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {137493#false} is VALID [2022-04-28 15:39:58,729 INFO L290 TraceCheckUtils]: 169: Hoare triple {137493#false} assume 8640 == #t~mem75;havoc #t~mem75; {137493#false} is VALID [2022-04-28 15:39:58,729 INFO L290 TraceCheckUtils]: 170: Hoare triple {137493#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {137493#false} is VALID [2022-04-28 15:39:58,730 INFO L290 TraceCheckUtils]: 171: Hoare triple {137493#false} assume !(4 == ~blastFlag~0); {137493#false} is VALID [2022-04-28 15:39:58,730 INFO L290 TraceCheckUtils]: 172: Hoare triple {137493#false} assume !(7 == ~blastFlag~0); {137493#false} is VALID [2022-04-28 15:39:58,730 INFO L290 TraceCheckUtils]: 173: Hoare triple {137493#false} assume !(10 == ~blastFlag~0); {137493#false} is VALID [2022-04-28 15:39:58,730 INFO L290 TraceCheckUtils]: 174: Hoare triple {137493#false} assume !false; {137493#false} is VALID [2022-04-28 15:39:58,731 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 15:39:58,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:39:58,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254490750] [2022-04-28 15:39:58,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254490750] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:39:58,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:39:58,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:39:58,732 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:39:58,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [105145137] [2022-04-28 15:39:58,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [105145137] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:39:58,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:39:58,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:39:58,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83680127] [2022-04-28 15:39:58,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:39:58,732 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 3 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 175 [2022-04-28 15:39:58,732 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:39:58,732 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 32.0) internal successors, (128), 3 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:39:58,827 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:39:58,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:39:58,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:39:58,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:39:58,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:39:58,827 INFO L87 Difference]: Start difference. First operand 1806 states and 2604 transitions. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 3 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:40:03,123 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:40:07,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:40:07,162 INFO L93 Difference]: Finished difference Result 4148 states and 5999 transitions. [2022-04-28 15:40:07,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:40:07,162 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 3 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 175 [2022-04-28 15:40:07,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:40:07,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 3 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:40:07,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 613 transitions. [2022-04-28 15:40:07,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 3 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:40:07,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 613 transitions. [2022-04-28 15:40:07,176 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 613 transitions. [2022-04-28 15:40:07,507 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 613 edges. 613 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:40:07,733 INFO L225 Difference]: With dead ends: 4148 [2022-04-28 15:40:07,733 INFO L226 Difference]: Without dead ends: 2368 [2022-04-28 15:40:07,735 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-28 15:40:07,736 INFO L413 NwaCegarLoop]: 330 mSDtfsCounter, 138 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-28 15:40:07,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 524 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-04-28 15:40:07,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2368 states. [2022-04-28 15:40:07,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2368 to 2362. [2022-04-28 15:40:07,872 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:40:07,874 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2368 states. Second operand has 2362 states, 2357 states have (on average 1.4450572761985574) internal successors, (3406), 2357 states have internal predecessors, (3406), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:40:07,875 INFO L74 IsIncluded]: Start isIncluded. First operand 2368 states. Second operand has 2362 states, 2357 states have (on average 1.4450572761985574) internal successors, (3406), 2357 states have internal predecessors, (3406), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:40:07,876 INFO L87 Difference]: Start difference. First operand 2368 states. Second operand has 2362 states, 2357 states have (on average 1.4450572761985574) internal successors, (3406), 2357 states have internal predecessors, (3406), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:40:08,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:40:08,005 INFO L93 Difference]: Finished difference Result 2368 states and 3415 transitions. [2022-04-28 15:40:08,005 INFO L276 IsEmpty]: Start isEmpty. Operand 2368 states and 3415 transitions. [2022-04-28 15:40:08,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:40:08,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:40:08,010 INFO L74 IsIncluded]: Start isIncluded. First operand has 2362 states, 2357 states have (on average 1.4450572761985574) internal successors, (3406), 2357 states have internal predecessors, (3406), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2368 states. [2022-04-28 15:40:08,011 INFO L87 Difference]: Start difference. First operand has 2362 states, 2357 states have (on average 1.4450572761985574) internal successors, (3406), 2357 states have internal predecessors, (3406), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2368 states. [2022-04-28 15:40:08,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:40:08,142 INFO L93 Difference]: Finished difference Result 2368 states and 3415 transitions. [2022-04-28 15:40:08,142 INFO L276 IsEmpty]: Start isEmpty. Operand 2368 states and 3415 transitions. [2022-04-28 15:40:08,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:40:08,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:40:08,144 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:40:08,144 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:40:08,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2362 states, 2357 states have (on average 1.4450572761985574) internal successors, (3406), 2357 states have internal predecessors, (3406), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:40:08,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2362 states to 2362 states and 3410 transitions. [2022-04-28 15:40:08,373 INFO L78 Accepts]: Start accepts. Automaton has 2362 states and 3410 transitions. Word has length 175 [2022-04-28 15:40:08,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:40:08,373 INFO L495 AbstractCegarLoop]: Abstraction has 2362 states and 3410 transitions. [2022-04-28 15:40:08,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 3 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:40:08,373 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2362 states and 3410 transitions. [2022-04-28 15:40:11,456 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3410 edges. 3410 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:40:11,456 INFO L276 IsEmpty]: Start isEmpty. Operand 2362 states and 3410 transitions. [2022-04-28 15:40:11,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-04-28 15:40:11,459 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:40:11,459 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:40:11,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-04-28 15:40:11,459 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:40:11,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:40:11,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1677376086, now seen corresponding path program 1 times [2022-04-28 15:40:11,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:40:11,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [578803604] [2022-04-28 15:40:11,588 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:40:11,588 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:40:11,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1677376086, now seen corresponding path program 2 times [2022-04-28 15:40:11,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:40:11,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677970690] [2022-04-28 15:40:11,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:40:11,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:40:11,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:40:11,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:40:11,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:40:11,680 INFO L290 TraceCheckUtils]: 0: Hoare triple {155263#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {155257#true} is VALID [2022-04-28 15:40:11,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {155257#true} assume true; {155257#true} is VALID [2022-04-28 15:40:11,680 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {155257#true} {155257#true} #703#return; {155257#true} is VALID [2022-04-28 15:40:11,681 INFO L272 TraceCheckUtils]: 0: Hoare triple {155257#true} call ULTIMATE.init(); {155263#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-28 15:40:11,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {155263#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {155257#true} is VALID [2022-04-28 15:40:11,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {155257#true} assume true; {155257#true} is VALID [2022-04-28 15:40:11,681 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {155257#true} {155257#true} #703#return; {155257#true} is VALID [2022-04-28 15:40:11,681 INFO L272 TraceCheckUtils]: 4: Hoare triple {155257#true} call #t~ret161 := main(); {155257#true} is VALID [2022-04-28 15:40:11,681 INFO L290 TraceCheckUtils]: 5: Hoare triple {155257#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {155257#true} is VALID [2022-04-28 15:40:11,681 INFO L290 TraceCheckUtils]: 6: Hoare triple {155257#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {155257#true} is VALID [2022-04-28 15:40:11,681 INFO L272 TraceCheckUtils]: 7: Hoare triple {155257#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {155257#true} is VALID [2022-04-28 15:40:11,681 INFO L290 TraceCheckUtils]: 8: Hoare triple {155257#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {155257#true} is VALID [2022-04-28 15:40:11,682 INFO L290 TraceCheckUtils]: 9: Hoare triple {155257#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {155257#true} is VALID [2022-04-28 15:40:11,682 INFO L290 TraceCheckUtils]: 10: Hoare triple {155257#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {155257#true} is VALID [2022-04-28 15:40:11,682 INFO L290 TraceCheckUtils]: 11: Hoare triple {155257#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {155257#true} is VALID [2022-04-28 15:40:11,682 INFO L290 TraceCheckUtils]: 12: Hoare triple {155257#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {155257#true} is VALID [2022-04-28 15:40:11,682 INFO L290 TraceCheckUtils]: 13: Hoare triple {155257#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {155257#true} is VALID [2022-04-28 15:40:11,682 INFO L290 TraceCheckUtils]: 14: Hoare triple {155257#true} assume !false; {155257#true} is VALID [2022-04-28 15:40:11,682 INFO L290 TraceCheckUtils]: 15: Hoare triple {155257#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {155257#true} is VALID [2022-04-28 15:40:11,682 INFO L290 TraceCheckUtils]: 16: Hoare triple {155257#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {155257#true} is VALID [2022-04-28 15:40:11,682 INFO L290 TraceCheckUtils]: 17: Hoare triple {155257#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {155257#true} is VALID [2022-04-28 15:40:11,682 INFO L290 TraceCheckUtils]: 18: Hoare triple {155257#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {155257#true} is VALID [2022-04-28 15:40:11,682 INFO L290 TraceCheckUtils]: 19: Hoare triple {155257#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {155257#true} is VALID [2022-04-28 15:40:11,682 INFO L290 TraceCheckUtils]: 20: Hoare triple {155257#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {155257#true} is VALID [2022-04-28 15:40:11,682 INFO L290 TraceCheckUtils]: 21: Hoare triple {155257#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {155257#true} is VALID [2022-04-28 15:40:11,682 INFO L290 TraceCheckUtils]: 22: Hoare triple {155257#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {155257#true} is VALID [2022-04-28 15:40:11,682 INFO L290 TraceCheckUtils]: 23: Hoare triple {155257#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {155257#true} is VALID [2022-04-28 15:40:11,683 INFO L290 TraceCheckUtils]: 24: Hoare triple {155257#true} assume 8464 == #t~mem55;havoc #t~mem55; {155257#true} is VALID [2022-04-28 15:40:11,683 INFO L290 TraceCheckUtils]: 25: Hoare triple {155257#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {155257#true} is VALID [2022-04-28 15:40:11,683 INFO L290 TraceCheckUtils]: 26: Hoare triple {155257#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {155262#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:40:11,683 INFO L290 TraceCheckUtils]: 27: Hoare triple {155262#(= ssl3_accept_~blastFlag~0 1)} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {155262#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:40:11,683 INFO L290 TraceCheckUtils]: 28: Hoare triple {155262#(= ssl3_accept_~blastFlag~0 1)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {155262#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:40:11,684 INFO L290 TraceCheckUtils]: 29: Hoare triple {155262#(= ssl3_accept_~blastFlag~0 1)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {155262#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:40:11,684 INFO L290 TraceCheckUtils]: 30: Hoare triple {155262#(= ssl3_accept_~blastFlag~0 1)} ~skip~0 := 0; {155262#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:40:11,684 INFO L290 TraceCheckUtils]: 31: Hoare triple {155262#(= ssl3_accept_~blastFlag~0 1)} assume !false; {155262#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:40:11,684 INFO L290 TraceCheckUtils]: 32: Hoare triple {155262#(= ssl3_accept_~blastFlag~0 1)} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {155262#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:40:11,685 INFO L290 TraceCheckUtils]: 33: Hoare triple {155262#(= ssl3_accept_~blastFlag~0 1)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {155262#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:40:11,685 INFO L290 TraceCheckUtils]: 34: Hoare triple {155262#(= ssl3_accept_~blastFlag~0 1)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {155262#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:40:11,685 INFO L290 TraceCheckUtils]: 35: Hoare triple {155262#(= ssl3_accept_~blastFlag~0 1)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {155262#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:40:11,685 INFO L290 TraceCheckUtils]: 36: Hoare triple {155262#(= ssl3_accept_~blastFlag~0 1)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {155262#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:40:11,686 INFO L290 TraceCheckUtils]: 37: Hoare triple {155262#(= ssl3_accept_~blastFlag~0 1)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {155262#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:40:11,686 INFO L290 TraceCheckUtils]: 38: Hoare triple {155262#(= ssl3_accept_~blastFlag~0 1)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {155262#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:40:11,686 INFO L290 TraceCheckUtils]: 39: Hoare triple {155262#(= ssl3_accept_~blastFlag~0 1)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {155262#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:40:11,686 INFO L290 TraceCheckUtils]: 40: Hoare triple {155262#(= ssl3_accept_~blastFlag~0 1)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {155262#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:40:11,687 INFO L290 TraceCheckUtils]: 41: Hoare triple {155262#(= ssl3_accept_~blastFlag~0 1)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {155262#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:40:11,687 INFO L290 TraceCheckUtils]: 42: Hoare triple {155262#(= ssl3_accept_~blastFlag~0 1)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {155262#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:40:11,687 INFO L290 TraceCheckUtils]: 43: Hoare triple {155262#(= ssl3_accept_~blastFlag~0 1)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {155262#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:40:11,687 INFO L290 TraceCheckUtils]: 44: Hoare triple {155262#(= ssl3_accept_~blastFlag~0 1)} assume 8496 == #t~mem58;havoc #t~mem58; {155262#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:40:11,688 INFO L290 TraceCheckUtils]: 45: Hoare triple {155262#(= ssl3_accept_~blastFlag~0 1)} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {155262#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:40:11,688 INFO L290 TraceCheckUtils]: 46: Hoare triple {155262#(= ssl3_accept_~blastFlag~0 1)} assume !(1 == ~blastFlag~0); {155258#false} is VALID [2022-04-28 15:40:11,688 INFO L290 TraceCheckUtils]: 47: Hoare triple {155258#false} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,688 INFO L290 TraceCheckUtils]: 48: Hoare triple {155258#false} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,688 INFO L290 TraceCheckUtils]: 49: Hoare triple {155258#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,688 INFO L290 TraceCheckUtils]: 50: Hoare triple {155258#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,688 INFO L290 TraceCheckUtils]: 51: Hoare triple {155258#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {155258#false} is VALID [2022-04-28 15:40:11,688 INFO L290 TraceCheckUtils]: 52: Hoare triple {155258#false} ~skip~0 := 0; {155258#false} is VALID [2022-04-28 15:40:11,688 INFO L290 TraceCheckUtils]: 53: Hoare triple {155258#false} assume !false; {155258#false} is VALID [2022-04-28 15:40:11,688 INFO L290 TraceCheckUtils]: 54: Hoare triple {155258#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,688 INFO L290 TraceCheckUtils]: 55: Hoare triple {155258#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,689 INFO L290 TraceCheckUtils]: 56: Hoare triple {155258#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,689 INFO L290 TraceCheckUtils]: 57: Hoare triple {155258#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,689 INFO L290 TraceCheckUtils]: 58: Hoare triple {155258#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,689 INFO L290 TraceCheckUtils]: 59: Hoare triple {155258#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,689 INFO L290 TraceCheckUtils]: 60: Hoare triple {155258#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,689 INFO L290 TraceCheckUtils]: 61: Hoare triple {155258#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,689 INFO L290 TraceCheckUtils]: 62: Hoare triple {155258#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,689 INFO L290 TraceCheckUtils]: 63: Hoare triple {155258#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,689 INFO L290 TraceCheckUtils]: 64: Hoare triple {155258#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,689 INFO L290 TraceCheckUtils]: 65: Hoare triple {155258#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,689 INFO L290 TraceCheckUtils]: 66: Hoare triple {155258#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,689 INFO L290 TraceCheckUtils]: 67: Hoare triple {155258#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,689 INFO L290 TraceCheckUtils]: 68: Hoare triple {155258#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,689 INFO L290 TraceCheckUtils]: 69: Hoare triple {155258#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,689 INFO L290 TraceCheckUtils]: 70: Hoare triple {155258#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,690 INFO L290 TraceCheckUtils]: 71: Hoare triple {155258#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,690 INFO L290 TraceCheckUtils]: 72: Hoare triple {155258#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,690 INFO L290 TraceCheckUtils]: 73: Hoare triple {155258#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,690 INFO L290 TraceCheckUtils]: 74: Hoare triple {155258#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,690 INFO L290 TraceCheckUtils]: 75: Hoare triple {155258#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,690 INFO L290 TraceCheckUtils]: 76: Hoare triple {155258#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,690 INFO L290 TraceCheckUtils]: 77: Hoare triple {155258#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,690 INFO L290 TraceCheckUtils]: 78: Hoare triple {155258#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,690 INFO L290 TraceCheckUtils]: 79: Hoare triple {155258#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,690 INFO L290 TraceCheckUtils]: 80: Hoare triple {155258#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,690 INFO L290 TraceCheckUtils]: 81: Hoare triple {155258#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,690 INFO L290 TraceCheckUtils]: 82: Hoare triple {155258#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,690 INFO L290 TraceCheckUtils]: 83: Hoare triple {155258#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,690 INFO L290 TraceCheckUtils]: 84: Hoare triple {155258#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,690 INFO L290 TraceCheckUtils]: 85: Hoare triple {155258#false} assume 8656 == #t~mem77;havoc #t~mem77; {155258#false} is VALID [2022-04-28 15:40:11,691 INFO L290 TraceCheckUtils]: 86: Hoare triple {155258#false} call #t~mem140.base, #t~mem140.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem141.base, #t~mem141.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem142.base, #t~mem142.offset := read~$Pointer$(#t~mem141.base, 888 + #t~mem141.offset, 8);call write~$Pointer$(#t~mem142.base, #t~mem142.offset, #t~mem140.base, 192 + #t~mem140.offset, 8);havoc #t~mem140.base, #t~mem140.offset;havoc #t~mem141.base, #t~mem141.offset;havoc #t~mem142.base, #t~mem142.offset; {155258#false} is VALID [2022-04-28 15:40:11,691 INFO L290 TraceCheckUtils]: 87: Hoare triple {155258#false} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {155258#false} is VALID [2022-04-28 15:40:11,691 INFO L290 TraceCheckUtils]: 88: Hoare triple {155258#false} assume !(2 == ~blastFlag~0); {155258#false} is VALID [2022-04-28 15:40:11,691 INFO L290 TraceCheckUtils]: 89: Hoare triple {155258#false} assume 5 == ~blastFlag~0;~blastFlag~0 := 6; {155258#false} is VALID [2022-04-28 15:40:11,691 INFO L290 TraceCheckUtils]: 90: Hoare triple {155258#false} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,691 INFO L290 TraceCheckUtils]: 91: Hoare triple {155258#false} assume !(0 == ~tmp___10~0); {155258#false} is VALID [2022-04-28 15:40:11,691 INFO L290 TraceCheckUtils]: 92: Hoare triple {155258#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,691 INFO L290 TraceCheckUtils]: 93: Hoare triple {155258#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {155258#false} is VALID [2022-04-28 15:40:11,691 INFO L290 TraceCheckUtils]: 94: Hoare triple {155258#false} ~skip~0 := 0; {155258#false} is VALID [2022-04-28 15:40:11,691 INFO L290 TraceCheckUtils]: 95: Hoare triple {155258#false} assume !false; {155258#false} is VALID [2022-04-28 15:40:11,691 INFO L290 TraceCheckUtils]: 96: Hoare triple {155258#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,691 INFO L290 TraceCheckUtils]: 97: Hoare triple {155258#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,691 INFO L290 TraceCheckUtils]: 98: Hoare triple {155258#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,691 INFO L290 TraceCheckUtils]: 99: Hoare triple {155258#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,691 INFO L290 TraceCheckUtils]: 100: Hoare triple {155258#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,691 INFO L290 TraceCheckUtils]: 101: Hoare triple {155258#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,692 INFO L290 TraceCheckUtils]: 102: Hoare triple {155258#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,692 INFO L290 TraceCheckUtils]: 103: Hoare triple {155258#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,692 INFO L290 TraceCheckUtils]: 104: Hoare triple {155258#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,692 INFO L290 TraceCheckUtils]: 105: Hoare triple {155258#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,692 INFO L290 TraceCheckUtils]: 106: Hoare triple {155258#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,692 INFO L290 TraceCheckUtils]: 107: Hoare triple {155258#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,692 INFO L290 TraceCheckUtils]: 108: Hoare triple {155258#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,692 INFO L290 TraceCheckUtils]: 109: Hoare triple {155258#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,692 INFO L290 TraceCheckUtils]: 110: Hoare triple {155258#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,692 INFO L290 TraceCheckUtils]: 111: Hoare triple {155258#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,692 INFO L290 TraceCheckUtils]: 112: Hoare triple {155258#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,692 INFO L290 TraceCheckUtils]: 113: Hoare triple {155258#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,692 INFO L290 TraceCheckUtils]: 114: Hoare triple {155258#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,692 INFO L290 TraceCheckUtils]: 115: Hoare triple {155258#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,693 INFO L290 TraceCheckUtils]: 116: Hoare triple {155258#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,693 INFO L290 TraceCheckUtils]: 117: Hoare triple {155258#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,693 INFO L290 TraceCheckUtils]: 118: Hoare triple {155258#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,693 INFO L290 TraceCheckUtils]: 119: Hoare triple {155258#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,693 INFO L290 TraceCheckUtils]: 120: Hoare triple {155258#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,693 INFO L290 TraceCheckUtils]: 121: Hoare triple {155258#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,693 INFO L290 TraceCheckUtils]: 122: Hoare triple {155258#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,693 INFO L290 TraceCheckUtils]: 123: Hoare triple {155258#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,693 INFO L290 TraceCheckUtils]: 124: Hoare triple {155258#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,693 INFO L290 TraceCheckUtils]: 125: Hoare triple {155258#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,693 INFO L290 TraceCheckUtils]: 126: Hoare triple {155258#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,693 INFO L290 TraceCheckUtils]: 127: Hoare triple {155258#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,693 INFO L290 TraceCheckUtils]: 128: Hoare triple {155258#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,693 INFO L290 TraceCheckUtils]: 129: Hoare triple {155258#false} assume 8672 == #t~mem79;havoc #t~mem79; {155258#false} is VALID [2022-04-28 15:40:11,693 INFO L290 TraceCheckUtils]: 130: Hoare triple {155258#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {155258#false} is VALID [2022-04-28 15:40:11,694 INFO L290 TraceCheckUtils]: 131: Hoare triple {155258#false} assume !(3 == ~blastFlag~0); {155258#false} is VALID [2022-04-28 15:40:11,694 INFO L290 TraceCheckUtils]: 132: Hoare triple {155258#false} assume 6 == ~blastFlag~0;~blastFlag~0 := 7; {155258#false} is VALID [2022-04-28 15:40:11,694 INFO L290 TraceCheckUtils]: 133: Hoare triple {155258#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 72 + ~s.offset, 4);call #t~mem145 := read~int(~s.base, 128 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,694 INFO L290 TraceCheckUtils]: 134: Hoare triple {155258#false} assume 0 != #t~mem145;havoc #t~mem145;call #t~mem146.base, #t~mem146.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8640, #t~mem146.base, 904 + #t~mem146.offset, 4);havoc #t~mem146.base, #t~mem146.offset; {155258#false} is VALID [2022-04-28 15:40:11,694 INFO L290 TraceCheckUtils]: 135: Hoare triple {155258#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,694 INFO L290 TraceCheckUtils]: 136: Hoare triple {155258#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,694 INFO L290 TraceCheckUtils]: 137: Hoare triple {155258#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {155258#false} is VALID [2022-04-28 15:40:11,694 INFO L290 TraceCheckUtils]: 138: Hoare triple {155258#false} ~skip~0 := 0; {155258#false} is VALID [2022-04-28 15:40:11,694 INFO L290 TraceCheckUtils]: 139: Hoare triple {155258#false} assume !false; {155258#false} is VALID [2022-04-28 15:40:11,694 INFO L290 TraceCheckUtils]: 140: Hoare triple {155258#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,694 INFO L290 TraceCheckUtils]: 141: Hoare triple {155258#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,694 INFO L290 TraceCheckUtils]: 142: Hoare triple {155258#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,694 INFO L290 TraceCheckUtils]: 143: Hoare triple {155258#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,694 INFO L290 TraceCheckUtils]: 144: Hoare triple {155258#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,694 INFO L290 TraceCheckUtils]: 145: Hoare triple {155258#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,695 INFO L290 TraceCheckUtils]: 146: Hoare triple {155258#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,695 INFO L290 TraceCheckUtils]: 147: Hoare triple {155258#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,695 INFO L290 TraceCheckUtils]: 148: Hoare triple {155258#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,695 INFO L290 TraceCheckUtils]: 149: Hoare triple {155258#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,695 INFO L290 TraceCheckUtils]: 150: Hoare triple {155258#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,695 INFO L290 TraceCheckUtils]: 151: Hoare triple {155258#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,695 INFO L290 TraceCheckUtils]: 152: Hoare triple {155258#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,695 INFO L290 TraceCheckUtils]: 153: Hoare triple {155258#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,695 INFO L290 TraceCheckUtils]: 154: Hoare triple {155258#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,695 INFO L290 TraceCheckUtils]: 155: Hoare triple {155258#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,695 INFO L290 TraceCheckUtils]: 156: Hoare triple {155258#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,695 INFO L290 TraceCheckUtils]: 157: Hoare triple {155258#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,695 INFO L290 TraceCheckUtils]: 158: Hoare triple {155258#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,695 INFO L290 TraceCheckUtils]: 159: Hoare triple {155258#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,695 INFO L290 TraceCheckUtils]: 160: Hoare triple {155258#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,696 INFO L290 TraceCheckUtils]: 161: Hoare triple {155258#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,696 INFO L290 TraceCheckUtils]: 162: Hoare triple {155258#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,696 INFO L290 TraceCheckUtils]: 163: Hoare triple {155258#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,696 INFO L290 TraceCheckUtils]: 164: Hoare triple {155258#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,696 INFO L290 TraceCheckUtils]: 165: Hoare triple {155258#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,696 INFO L290 TraceCheckUtils]: 166: Hoare triple {155258#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,696 INFO L290 TraceCheckUtils]: 167: Hoare triple {155258#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,696 INFO L290 TraceCheckUtils]: 168: Hoare triple {155258#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {155258#false} is VALID [2022-04-28 15:40:11,696 INFO L290 TraceCheckUtils]: 169: Hoare triple {155258#false} assume 8640 == #t~mem75;havoc #t~mem75; {155258#false} is VALID [2022-04-28 15:40:11,696 INFO L290 TraceCheckUtils]: 170: Hoare triple {155258#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {155258#false} is VALID [2022-04-28 15:40:11,696 INFO L290 TraceCheckUtils]: 171: Hoare triple {155258#false} assume !(4 == ~blastFlag~0); {155258#false} is VALID [2022-04-28 15:40:11,696 INFO L290 TraceCheckUtils]: 172: Hoare triple {155258#false} assume !(7 == ~blastFlag~0); {155258#false} is VALID [2022-04-28 15:40:11,696 INFO L290 TraceCheckUtils]: 173: Hoare triple {155258#false} assume !(10 == ~blastFlag~0); {155258#false} is VALID [2022-04-28 15:40:11,696 INFO L290 TraceCheckUtils]: 174: Hoare triple {155258#false} assume !false; {155258#false} is VALID [2022-04-28 15:40:11,698 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-04-28 15:40:11,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:40:11,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677970690] [2022-04-28 15:40:11,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677970690] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:40:11,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:40:11,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:40:11,698 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:40:11,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [578803604] [2022-04-28 15:40:11,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [578803604] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:40:11,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:40:11,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:40:11,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661147620] [2022-04-28 15:40:11,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:40:11,699 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 175 [2022-04-28 15:40:11,699 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:40:11,699 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 25.75) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:40:11,764 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:40:11,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:40:11,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:40:11,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:40:11,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:40:11,764 INFO L87 Difference]: Start difference. First operand 2362 states and 3410 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:40:13,777 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:40:15,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:40:15,467 INFO L93 Difference]: Finished difference Result 4725 states and 6827 transitions. [2022-04-28 15:40:15,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:40:15,467 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 175 [2022-04-28 15:40:15,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:40:15,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:40:15,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 460 transitions. [2022-04-28 15:40:15,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:40:15,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 460 transitions. [2022-04-28 15:40:15,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 460 transitions. [2022-04-28 15:40:15,745 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 460 edges. 460 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:40:15,980 INFO L225 Difference]: With dead ends: 4725 [2022-04-28 15:40:15,980 INFO L226 Difference]: Without dead ends: 2389 [2022-04-28 15:40:15,983 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-28 15:40:15,984 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 15 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-28 15:40:15,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 423 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 259 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-28 15:40:15,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2389 states. [2022-04-28 15:40:16,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2389 to 2389. [2022-04-28 15:40:16,138 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:40:16,140 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2389 states. Second operand has 2389 states, 2384 states have (on average 1.4433724832214765) internal successors, (3441), 2384 states have internal predecessors, (3441), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:40:16,142 INFO L74 IsIncluded]: Start isIncluded. First operand 2389 states. Second operand has 2389 states, 2384 states have (on average 1.4433724832214765) internal successors, (3441), 2384 states have internal predecessors, (3441), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:40:16,143 INFO L87 Difference]: Start difference. First operand 2389 states. Second operand has 2389 states, 2384 states have (on average 1.4433724832214765) internal successors, (3441), 2384 states have internal predecessors, (3441), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:40:16,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:40:16,274 INFO L93 Difference]: Finished difference Result 2389 states and 3445 transitions. [2022-04-28 15:40:16,274 INFO L276 IsEmpty]: Start isEmpty. Operand 2389 states and 3445 transitions. [2022-04-28 15:40:16,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:40:16,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:40:16,278 INFO L74 IsIncluded]: Start isIncluded. First operand has 2389 states, 2384 states have (on average 1.4433724832214765) internal successors, (3441), 2384 states have internal predecessors, (3441), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2389 states. [2022-04-28 15:40:16,280 INFO L87 Difference]: Start difference. First operand has 2389 states, 2384 states have (on average 1.4433724832214765) internal successors, (3441), 2384 states have internal predecessors, (3441), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2389 states. [2022-04-28 15:40:16,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:40:16,414 INFO L93 Difference]: Finished difference Result 2389 states and 3445 transitions. [2022-04-28 15:40:16,414 INFO L276 IsEmpty]: Start isEmpty. Operand 2389 states and 3445 transitions. [2022-04-28 15:40:16,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:40:16,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:40:16,415 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:40:16,415 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:40:16,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2389 states, 2384 states have (on average 1.4433724832214765) internal successors, (3441), 2384 states have internal predecessors, (3441), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:40:16,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2389 states to 2389 states and 3445 transitions. [2022-04-28 15:40:16,671 INFO L78 Accepts]: Start accepts. Automaton has 2389 states and 3445 transitions. Word has length 175 [2022-04-28 15:40:16,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:40:16,672 INFO L495 AbstractCegarLoop]: Abstraction has 2389 states and 3445 transitions. [2022-04-28 15:40:16,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:40:16,672 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2389 states and 3445 transitions. [2022-04-28 15:40:19,880 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3445 edges. 3445 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:40:19,880 INFO L276 IsEmpty]: Start isEmpty. Operand 2389 states and 3445 transitions. [2022-04-28 15:40:19,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-04-28 15:40:19,882 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:40:19,882 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:40:19,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-04-28 15:40:19,883 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:40:19,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:40:19,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1291513684, now seen corresponding path program 1 times [2022-04-28 15:40:19,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:40:19,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [227536168] [2022-04-28 15:40:20,009 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:40:20,009 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:40:20,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1291513684, now seen corresponding path program 2 times [2022-04-28 15:40:20,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:40:20,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979496175] [2022-04-28 15:40:20,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:40:20,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:40:20,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:40:20,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:40:20,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:40:20,130 INFO L290 TraceCheckUtils]: 0: Hoare triple {174278#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {174272#true} is VALID [2022-04-28 15:40:20,130 INFO L290 TraceCheckUtils]: 1: Hoare triple {174272#true} assume true; {174272#true} is VALID [2022-04-28 15:40:20,130 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {174272#true} {174272#true} #703#return; {174272#true} is VALID [2022-04-28 15:40:20,131 INFO L272 TraceCheckUtils]: 0: Hoare triple {174272#true} call ULTIMATE.init(); {174278#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-28 15:40:20,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {174278#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {174272#true} is VALID [2022-04-28 15:40:20,131 INFO L290 TraceCheckUtils]: 2: Hoare triple {174272#true} assume true; {174272#true} is VALID [2022-04-28 15:40:20,131 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {174272#true} {174272#true} #703#return; {174272#true} is VALID [2022-04-28 15:40:20,131 INFO L272 TraceCheckUtils]: 4: Hoare triple {174272#true} call #t~ret161 := main(); {174272#true} is VALID [2022-04-28 15:40:20,131 INFO L290 TraceCheckUtils]: 5: Hoare triple {174272#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {174272#true} is VALID [2022-04-28 15:40:20,131 INFO L290 TraceCheckUtils]: 6: Hoare triple {174272#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {174272#true} is VALID [2022-04-28 15:40:20,132 INFO L272 TraceCheckUtils]: 7: Hoare triple {174272#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {174272#true} is VALID [2022-04-28 15:40:20,132 INFO L290 TraceCheckUtils]: 8: Hoare triple {174272#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {174277#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:40:20,132 INFO L290 TraceCheckUtils]: 9: Hoare triple {174277#(= ssl3_accept_~blastFlag~0 0)} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {174277#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:40:20,132 INFO L290 TraceCheckUtils]: 10: Hoare triple {174277#(= ssl3_accept_~blastFlag~0 0)} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {174277#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:40:20,133 INFO L290 TraceCheckUtils]: 11: Hoare triple {174277#(= 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)))); {174277#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:40:20,133 INFO L290 TraceCheckUtils]: 12: Hoare triple {174277#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {174277#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:40:20,133 INFO L290 TraceCheckUtils]: 13: Hoare triple {174277#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {174277#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:40:20,133 INFO L290 TraceCheckUtils]: 14: Hoare triple {174277#(= ssl3_accept_~blastFlag~0 0)} assume !false; {174277#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:40:20,134 INFO L290 TraceCheckUtils]: 15: Hoare triple {174277#(= ssl3_accept_~blastFlag~0 0)} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {174277#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:40:20,134 INFO L290 TraceCheckUtils]: 16: Hoare triple {174277#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {174277#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:40:20,134 INFO L290 TraceCheckUtils]: 17: Hoare triple {174277#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {174277#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:40:20,134 INFO L290 TraceCheckUtils]: 18: Hoare triple {174277#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {174277#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:40:20,135 INFO L290 TraceCheckUtils]: 19: Hoare triple {174277#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {174277#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:40:20,135 INFO L290 TraceCheckUtils]: 20: Hoare triple {174277#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {174277#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:40:20,135 INFO L290 TraceCheckUtils]: 21: Hoare triple {174277#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {174277#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:40:20,135 INFO L290 TraceCheckUtils]: 22: Hoare triple {174277#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {174277#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:40:20,135 INFO L290 TraceCheckUtils]: 23: Hoare triple {174277#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {174277#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:40:20,136 INFO L290 TraceCheckUtils]: 24: Hoare triple {174277#(= ssl3_accept_~blastFlag~0 0)} assume 8464 == #t~mem55;havoc #t~mem55; {174277#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:40:20,136 INFO L290 TraceCheckUtils]: 25: Hoare triple {174277#(= ssl3_accept_~blastFlag~0 0)} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {174277#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:40:20,136 INFO L290 TraceCheckUtils]: 26: Hoare triple {174277#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == ~blastFlag~0); {174273#false} is VALID [2022-04-28 15:40:20,136 INFO L290 TraceCheckUtils]: 27: Hoare triple {174273#false} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,136 INFO L290 TraceCheckUtils]: 28: Hoare triple {174273#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,136 INFO L290 TraceCheckUtils]: 29: Hoare triple {174273#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {174273#false} is VALID [2022-04-28 15:40:20,137 INFO L290 TraceCheckUtils]: 30: Hoare triple {174273#false} ~skip~0 := 0; {174273#false} is VALID [2022-04-28 15:40:20,137 INFO L290 TraceCheckUtils]: 31: Hoare triple {174273#false} assume !false; {174273#false} is VALID [2022-04-28 15:40:20,137 INFO L290 TraceCheckUtils]: 32: Hoare triple {174273#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,137 INFO L290 TraceCheckUtils]: 33: Hoare triple {174273#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,137 INFO L290 TraceCheckUtils]: 34: Hoare triple {174273#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,137 INFO L290 TraceCheckUtils]: 35: Hoare triple {174273#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,137 INFO L290 TraceCheckUtils]: 36: Hoare triple {174273#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,137 INFO L290 TraceCheckUtils]: 37: Hoare triple {174273#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,137 INFO L290 TraceCheckUtils]: 38: Hoare triple {174273#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,137 INFO L290 TraceCheckUtils]: 39: Hoare triple {174273#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,137 INFO L290 TraceCheckUtils]: 40: Hoare triple {174273#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,137 INFO L290 TraceCheckUtils]: 41: Hoare triple {174273#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,137 INFO L290 TraceCheckUtils]: 42: Hoare triple {174273#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,137 INFO L290 TraceCheckUtils]: 43: Hoare triple {174273#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,137 INFO L290 TraceCheckUtils]: 44: Hoare triple {174273#false} assume 8496 == #t~mem58;havoc #t~mem58; {174273#false} is VALID [2022-04-28 15:40:20,138 INFO L290 TraceCheckUtils]: 45: Hoare triple {174273#false} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {174273#false} is VALID [2022-04-28 15:40:20,138 INFO L290 TraceCheckUtils]: 46: Hoare triple {174273#false} assume !(1 == ~blastFlag~0); {174273#false} is VALID [2022-04-28 15:40:20,138 INFO L290 TraceCheckUtils]: 47: Hoare triple {174273#false} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,138 INFO L290 TraceCheckUtils]: 48: Hoare triple {174273#false} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,138 INFO L290 TraceCheckUtils]: 49: Hoare triple {174273#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,138 INFO L290 TraceCheckUtils]: 50: Hoare triple {174273#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,138 INFO L290 TraceCheckUtils]: 51: Hoare triple {174273#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {174273#false} is VALID [2022-04-28 15:40:20,138 INFO L290 TraceCheckUtils]: 52: Hoare triple {174273#false} ~skip~0 := 0; {174273#false} is VALID [2022-04-28 15:40:20,138 INFO L290 TraceCheckUtils]: 53: Hoare triple {174273#false} assume !false; {174273#false} is VALID [2022-04-28 15:40:20,138 INFO L290 TraceCheckUtils]: 54: Hoare triple {174273#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,138 INFO L290 TraceCheckUtils]: 55: Hoare triple {174273#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,138 INFO L290 TraceCheckUtils]: 56: Hoare triple {174273#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,138 INFO L290 TraceCheckUtils]: 57: Hoare triple {174273#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,138 INFO L290 TraceCheckUtils]: 58: Hoare triple {174273#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,138 INFO L290 TraceCheckUtils]: 59: Hoare triple {174273#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,138 INFO L290 TraceCheckUtils]: 60: Hoare triple {174273#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,139 INFO L290 TraceCheckUtils]: 61: Hoare triple {174273#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,139 INFO L290 TraceCheckUtils]: 62: Hoare triple {174273#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,139 INFO L290 TraceCheckUtils]: 63: Hoare triple {174273#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,139 INFO L290 TraceCheckUtils]: 64: Hoare triple {174273#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,139 INFO L290 TraceCheckUtils]: 65: Hoare triple {174273#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,139 INFO L290 TraceCheckUtils]: 66: Hoare triple {174273#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,139 INFO L290 TraceCheckUtils]: 67: Hoare triple {174273#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,139 INFO L290 TraceCheckUtils]: 68: Hoare triple {174273#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,139 INFO L290 TraceCheckUtils]: 69: Hoare triple {174273#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,139 INFO L290 TraceCheckUtils]: 70: Hoare triple {174273#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,139 INFO L290 TraceCheckUtils]: 71: Hoare triple {174273#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,139 INFO L290 TraceCheckUtils]: 72: Hoare triple {174273#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,139 INFO L290 TraceCheckUtils]: 73: Hoare triple {174273#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,139 INFO L290 TraceCheckUtils]: 74: Hoare triple {174273#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,139 INFO L290 TraceCheckUtils]: 75: Hoare triple {174273#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,140 INFO L290 TraceCheckUtils]: 76: Hoare triple {174273#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,140 INFO L290 TraceCheckUtils]: 77: Hoare triple {174273#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,140 INFO L290 TraceCheckUtils]: 78: Hoare triple {174273#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,140 INFO L290 TraceCheckUtils]: 79: Hoare triple {174273#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,140 INFO L290 TraceCheckUtils]: 80: Hoare triple {174273#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,140 INFO L290 TraceCheckUtils]: 81: Hoare triple {174273#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,140 INFO L290 TraceCheckUtils]: 82: Hoare triple {174273#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,140 INFO L290 TraceCheckUtils]: 83: Hoare triple {174273#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,140 INFO L290 TraceCheckUtils]: 84: Hoare triple {174273#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,140 INFO L290 TraceCheckUtils]: 85: Hoare triple {174273#false} assume 8656 == #t~mem77;havoc #t~mem77; {174273#false} is VALID [2022-04-28 15:40:20,140 INFO L290 TraceCheckUtils]: 86: Hoare triple {174273#false} call #t~mem140.base, #t~mem140.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem141.base, #t~mem141.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem142.base, #t~mem142.offset := read~$Pointer$(#t~mem141.base, 888 + #t~mem141.offset, 8);call write~$Pointer$(#t~mem142.base, #t~mem142.offset, #t~mem140.base, 192 + #t~mem140.offset, 8);havoc #t~mem140.base, #t~mem140.offset;havoc #t~mem141.base, #t~mem141.offset;havoc #t~mem142.base, #t~mem142.offset; {174273#false} is VALID [2022-04-28 15:40:20,140 INFO L290 TraceCheckUtils]: 87: Hoare triple {174273#false} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {174273#false} is VALID [2022-04-28 15:40:20,140 INFO L290 TraceCheckUtils]: 88: Hoare triple {174273#false} assume !(2 == ~blastFlag~0); {174273#false} is VALID [2022-04-28 15:40:20,140 INFO L290 TraceCheckUtils]: 89: Hoare triple {174273#false} assume 5 == ~blastFlag~0;~blastFlag~0 := 6; {174273#false} is VALID [2022-04-28 15:40:20,140 INFO L290 TraceCheckUtils]: 90: Hoare triple {174273#false} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,141 INFO L290 TraceCheckUtils]: 91: Hoare triple {174273#false} assume !(0 == ~tmp___10~0); {174273#false} is VALID [2022-04-28 15:40:20,141 INFO L290 TraceCheckUtils]: 92: Hoare triple {174273#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,141 INFO L290 TraceCheckUtils]: 93: Hoare triple {174273#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {174273#false} is VALID [2022-04-28 15:40:20,141 INFO L290 TraceCheckUtils]: 94: Hoare triple {174273#false} ~skip~0 := 0; {174273#false} is VALID [2022-04-28 15:40:20,141 INFO L290 TraceCheckUtils]: 95: Hoare triple {174273#false} assume !false; {174273#false} is VALID [2022-04-28 15:40:20,141 INFO L290 TraceCheckUtils]: 96: Hoare triple {174273#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,141 INFO L290 TraceCheckUtils]: 97: Hoare triple {174273#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,141 INFO L290 TraceCheckUtils]: 98: Hoare triple {174273#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,141 INFO L290 TraceCheckUtils]: 99: Hoare triple {174273#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,141 INFO L290 TraceCheckUtils]: 100: Hoare triple {174273#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,141 INFO L290 TraceCheckUtils]: 101: Hoare triple {174273#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,141 INFO L290 TraceCheckUtils]: 102: Hoare triple {174273#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,141 INFO L290 TraceCheckUtils]: 103: Hoare triple {174273#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,141 INFO L290 TraceCheckUtils]: 104: Hoare triple {174273#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,141 INFO L290 TraceCheckUtils]: 105: Hoare triple {174273#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,141 INFO L290 TraceCheckUtils]: 106: Hoare triple {174273#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,142 INFO L290 TraceCheckUtils]: 107: Hoare triple {174273#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,142 INFO L290 TraceCheckUtils]: 108: Hoare triple {174273#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,142 INFO L290 TraceCheckUtils]: 109: Hoare triple {174273#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,142 INFO L290 TraceCheckUtils]: 110: Hoare triple {174273#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,142 INFO L290 TraceCheckUtils]: 111: Hoare triple {174273#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,142 INFO L290 TraceCheckUtils]: 112: Hoare triple {174273#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,142 INFO L290 TraceCheckUtils]: 113: Hoare triple {174273#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,142 INFO L290 TraceCheckUtils]: 114: Hoare triple {174273#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,142 INFO L290 TraceCheckUtils]: 115: Hoare triple {174273#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,142 INFO L290 TraceCheckUtils]: 116: Hoare triple {174273#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,142 INFO L290 TraceCheckUtils]: 117: Hoare triple {174273#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,142 INFO L290 TraceCheckUtils]: 118: Hoare triple {174273#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,142 INFO L290 TraceCheckUtils]: 119: Hoare triple {174273#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,142 INFO L290 TraceCheckUtils]: 120: Hoare triple {174273#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,142 INFO L290 TraceCheckUtils]: 121: Hoare triple {174273#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,143 INFO L290 TraceCheckUtils]: 122: Hoare triple {174273#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,143 INFO L290 TraceCheckUtils]: 123: Hoare triple {174273#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,143 INFO L290 TraceCheckUtils]: 124: Hoare triple {174273#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,143 INFO L290 TraceCheckUtils]: 125: Hoare triple {174273#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,143 INFO L290 TraceCheckUtils]: 126: Hoare triple {174273#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,143 INFO L290 TraceCheckUtils]: 127: Hoare triple {174273#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,143 INFO L290 TraceCheckUtils]: 128: Hoare triple {174273#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,143 INFO L290 TraceCheckUtils]: 129: Hoare triple {174273#false} assume 8672 == #t~mem79;havoc #t~mem79; {174273#false} is VALID [2022-04-28 15:40:20,143 INFO L290 TraceCheckUtils]: 130: Hoare triple {174273#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {174273#false} is VALID [2022-04-28 15:40:20,143 INFO L290 TraceCheckUtils]: 131: Hoare triple {174273#false} assume !(3 == ~blastFlag~0); {174273#false} is VALID [2022-04-28 15:40:20,143 INFO L290 TraceCheckUtils]: 132: Hoare triple {174273#false} assume 6 == ~blastFlag~0;~blastFlag~0 := 7; {174273#false} is VALID [2022-04-28 15:40:20,143 INFO L290 TraceCheckUtils]: 133: Hoare triple {174273#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 72 + ~s.offset, 4);call #t~mem145 := read~int(~s.base, 128 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,143 INFO L290 TraceCheckUtils]: 134: Hoare triple {174273#false} assume 0 != #t~mem145;havoc #t~mem145;call #t~mem146.base, #t~mem146.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8640, #t~mem146.base, 904 + #t~mem146.offset, 4);havoc #t~mem146.base, #t~mem146.offset; {174273#false} is VALID [2022-04-28 15:40:20,143 INFO L290 TraceCheckUtils]: 135: Hoare triple {174273#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,143 INFO L290 TraceCheckUtils]: 136: Hoare triple {174273#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,143 INFO L290 TraceCheckUtils]: 137: Hoare triple {174273#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {174273#false} is VALID [2022-04-28 15:40:20,144 INFO L290 TraceCheckUtils]: 138: Hoare triple {174273#false} ~skip~0 := 0; {174273#false} is VALID [2022-04-28 15:40:20,144 INFO L290 TraceCheckUtils]: 139: Hoare triple {174273#false} assume !false; {174273#false} is VALID [2022-04-28 15:40:20,144 INFO L290 TraceCheckUtils]: 140: Hoare triple {174273#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,144 INFO L290 TraceCheckUtils]: 141: Hoare triple {174273#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,144 INFO L290 TraceCheckUtils]: 142: Hoare triple {174273#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,144 INFO L290 TraceCheckUtils]: 143: Hoare triple {174273#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,144 INFO L290 TraceCheckUtils]: 144: Hoare triple {174273#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,144 INFO L290 TraceCheckUtils]: 145: Hoare triple {174273#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,144 INFO L290 TraceCheckUtils]: 146: Hoare triple {174273#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,144 INFO L290 TraceCheckUtils]: 147: Hoare triple {174273#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,144 INFO L290 TraceCheckUtils]: 148: Hoare triple {174273#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,144 INFO L290 TraceCheckUtils]: 149: Hoare triple {174273#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,144 INFO L290 TraceCheckUtils]: 150: Hoare triple {174273#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,144 INFO L290 TraceCheckUtils]: 151: Hoare triple {174273#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,144 INFO L290 TraceCheckUtils]: 152: Hoare triple {174273#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,145 INFO L290 TraceCheckUtils]: 153: Hoare triple {174273#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,145 INFO L290 TraceCheckUtils]: 154: Hoare triple {174273#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,145 INFO L290 TraceCheckUtils]: 155: Hoare triple {174273#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,145 INFO L290 TraceCheckUtils]: 156: Hoare triple {174273#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,145 INFO L290 TraceCheckUtils]: 157: Hoare triple {174273#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,145 INFO L290 TraceCheckUtils]: 158: Hoare triple {174273#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,145 INFO L290 TraceCheckUtils]: 159: Hoare triple {174273#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,145 INFO L290 TraceCheckUtils]: 160: Hoare triple {174273#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,145 INFO L290 TraceCheckUtils]: 161: Hoare triple {174273#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,145 INFO L290 TraceCheckUtils]: 162: Hoare triple {174273#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,145 INFO L290 TraceCheckUtils]: 163: Hoare triple {174273#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,145 INFO L290 TraceCheckUtils]: 164: Hoare triple {174273#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,145 INFO L290 TraceCheckUtils]: 165: Hoare triple {174273#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,145 INFO L290 TraceCheckUtils]: 166: Hoare triple {174273#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,145 INFO L290 TraceCheckUtils]: 167: Hoare triple {174273#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,146 INFO L290 TraceCheckUtils]: 168: Hoare triple {174273#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {174273#false} is VALID [2022-04-28 15:40:20,146 INFO L290 TraceCheckUtils]: 169: Hoare triple {174273#false} assume 8640 == #t~mem75;havoc #t~mem75; {174273#false} is VALID [2022-04-28 15:40:20,146 INFO L290 TraceCheckUtils]: 170: Hoare triple {174273#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {174273#false} is VALID [2022-04-28 15:40:20,146 INFO L290 TraceCheckUtils]: 171: Hoare triple {174273#false} assume !(4 == ~blastFlag~0); {174273#false} is VALID [2022-04-28 15:40:20,146 INFO L290 TraceCheckUtils]: 172: Hoare triple {174273#false} assume !(7 == ~blastFlag~0); {174273#false} is VALID [2022-04-28 15:40:20,146 INFO L290 TraceCheckUtils]: 173: Hoare triple {174273#false} assume !(10 == ~blastFlag~0); {174273#false} is VALID [2022-04-28 15:40:20,146 INFO L290 TraceCheckUtils]: 174: Hoare triple {174273#false} assume !false; {174273#false} is VALID [2022-04-28 15:40:20,146 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2022-04-28 15:40:20,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:40:20,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979496175] [2022-04-28 15:40:20,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979496175] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:40:20,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:40:20,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:40:20,147 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:40:20,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [227536168] [2022-04-28 15:40:20,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [227536168] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:40:20,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:40:20,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:40:20,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465453768] [2022-04-28 15:40:20,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:40:20,147 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 175 [2022-04-28 15:40:20,147 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:40:20,148 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 21.75) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:40:20,208 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:40:20,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:40:20,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:40:20,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:40:20,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:40:20,209 INFO L87 Difference]: Start difference. First operand 2389 states and 3445 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:40:27,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:40:27,401 INFO L93 Difference]: Finished difference Result 4754 states and 6863 transitions. [2022-04-28 15:40:27,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:40:27,401 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 175 [2022-04-28 15:40:27,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:40:27,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:40:27,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 437 transitions. [2022-04-28 15:40:27,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:40:27,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 437 transitions. [2022-04-28 15:40:27,404 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 437 transitions. [2022-04-28 15:40:27,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 437 edges. 437 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:40:27,899 INFO L225 Difference]: With dead ends: 4754 [2022-04-28 15:40:27,900 INFO L226 Difference]: Without dead ends: 2391 [2022-04-28 15:40:27,902 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-28 15:40:27,902 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 4 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-28 15:40:27,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 402 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-04-28 15:40:27,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2391 states. [2022-04-28 15:40:28,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2391 to 2391. [2022-04-28 15:40:28,052 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:40:28,054 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2391 states. Second operand has 2391 states, 2386 states have (on average 1.4430008382229673) internal successors, (3443), 2386 states have internal predecessors, (3443), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:40:28,055 INFO L74 IsIncluded]: Start isIncluded. First operand 2391 states. Second operand has 2391 states, 2386 states have (on average 1.4430008382229673) internal successors, (3443), 2386 states have internal predecessors, (3443), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:40:28,057 INFO L87 Difference]: Start difference. First operand 2391 states. Second operand has 2391 states, 2386 states have (on average 1.4430008382229673) internal successors, (3443), 2386 states have internal predecessors, (3443), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:40:28,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:40:28,191 INFO L93 Difference]: Finished difference Result 2391 states and 3447 transitions. [2022-04-28 15:40:28,191 INFO L276 IsEmpty]: Start isEmpty. Operand 2391 states and 3447 transitions. [2022-04-28 15:40:28,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:40:28,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:40:28,194 INFO L74 IsIncluded]: Start isIncluded. First operand has 2391 states, 2386 states have (on average 1.4430008382229673) internal successors, (3443), 2386 states have internal predecessors, (3443), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2391 states. [2022-04-28 15:40:28,195 INFO L87 Difference]: Start difference. First operand has 2391 states, 2386 states have (on average 1.4430008382229673) internal successors, (3443), 2386 states have internal predecessors, (3443), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2391 states. [2022-04-28 15:40:28,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:40:28,330 INFO L93 Difference]: Finished difference Result 2391 states and 3447 transitions. [2022-04-28 15:40:28,330 INFO L276 IsEmpty]: Start isEmpty. Operand 2391 states and 3447 transitions. [2022-04-28 15:40:28,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:40:28,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:40:28,331 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:40:28,331 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:40:28,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2391 states, 2386 states have (on average 1.4430008382229673) internal successors, (3443), 2386 states have internal predecessors, (3443), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:40:28,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2391 states to 2391 states and 3447 transitions. [2022-04-28 15:40:28,565 INFO L78 Accepts]: Start accepts. Automaton has 2391 states and 3447 transitions. Word has length 175 [2022-04-28 15:40:28,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:40:28,565 INFO L495 AbstractCegarLoop]: Abstraction has 2391 states and 3447 transitions. [2022-04-28 15:40:28,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:40:28,565 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2391 states and 3447 transitions. [2022-04-28 15:40:31,566 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3447 edges. 3447 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:40:31,566 INFO L276 IsEmpty]: Start isEmpty. Operand 2391 states and 3447 transitions. [2022-04-28 15:40:31,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-04-28 15:40:31,568 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:40:31,568 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:40:31,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-04-28 15:40:31,569 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:40:31,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:40:31,569 INFO L85 PathProgramCache]: Analyzing trace with hash -205337865, now seen corresponding path program 1 times [2022-04-28 15:40:31,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:40:31,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [675795870] [2022-04-28 15:40:31,703 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:40:31,703 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:40:31,704 INFO L85 PathProgramCache]: Analyzing trace with hash -205337865, now seen corresponding path program 2 times [2022-04-28 15:40:31,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:40:31,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988892975] [2022-04-28 15:40:31,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:40:31,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:40:31,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:40:31,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:40:31,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:40:31,849 INFO L290 TraceCheckUtils]: 0: Hoare triple {193360#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {193353#true} is VALID [2022-04-28 15:40:31,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {193353#true} assume true; {193353#true} is VALID [2022-04-28 15:40:31,849 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {193353#true} {193353#true} #703#return; {193353#true} is VALID [2022-04-28 15:40:31,849 INFO L272 TraceCheckUtils]: 0: Hoare triple {193353#true} call ULTIMATE.init(); {193360#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-28 15:40:31,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {193360#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {193353#true} is VALID [2022-04-28 15:40:31,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {193353#true} assume true; {193353#true} is VALID [2022-04-28 15:40:31,850 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {193353#true} {193353#true} #703#return; {193353#true} is VALID [2022-04-28 15:40:31,850 INFO L272 TraceCheckUtils]: 4: Hoare triple {193353#true} call #t~ret161 := main(); {193353#true} is VALID [2022-04-28 15:40:31,850 INFO L290 TraceCheckUtils]: 5: Hoare triple {193353#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {193353#true} is VALID [2022-04-28 15:40:31,850 INFO L290 TraceCheckUtils]: 6: Hoare triple {193353#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {193353#true} is VALID [2022-04-28 15:40:31,850 INFO L272 TraceCheckUtils]: 7: Hoare triple {193353#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {193353#true} is VALID [2022-04-28 15:40:31,850 INFO L290 TraceCheckUtils]: 8: Hoare triple {193353#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {193353#true} is VALID [2022-04-28 15:40:31,850 INFO L290 TraceCheckUtils]: 9: Hoare triple {193353#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {193353#true} is VALID [2022-04-28 15:40:31,850 INFO L290 TraceCheckUtils]: 10: Hoare triple {193353#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {193353#true} is VALID [2022-04-28 15:40:31,850 INFO L290 TraceCheckUtils]: 11: Hoare triple {193353#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {193353#true} is VALID [2022-04-28 15:40:31,850 INFO L290 TraceCheckUtils]: 12: Hoare triple {193353#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {193353#true} is VALID [2022-04-28 15:40:31,850 INFO L290 TraceCheckUtils]: 13: Hoare triple {193353#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {193353#true} is VALID [2022-04-28 15:40:31,850 INFO L290 TraceCheckUtils]: 14: Hoare triple {193353#true} assume !false; {193353#true} is VALID [2022-04-28 15:40:31,850 INFO L290 TraceCheckUtils]: 15: Hoare triple {193353#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {193353#true} is VALID [2022-04-28 15:40:31,851 INFO L290 TraceCheckUtils]: 16: Hoare triple {193353#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {193353#true} is VALID [2022-04-28 15:40:31,851 INFO L290 TraceCheckUtils]: 17: Hoare triple {193353#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {193353#true} is VALID [2022-04-28 15:40:31,851 INFO L290 TraceCheckUtils]: 18: Hoare triple {193353#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {193353#true} is VALID [2022-04-28 15:40:31,851 INFO L290 TraceCheckUtils]: 19: Hoare triple {193353#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {193353#true} is VALID [2022-04-28 15:40:31,851 INFO L290 TraceCheckUtils]: 20: Hoare triple {193353#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {193353#true} is VALID [2022-04-28 15:40:31,851 INFO L290 TraceCheckUtils]: 21: Hoare triple {193353#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {193353#true} is VALID [2022-04-28 15:40:31,851 INFO L290 TraceCheckUtils]: 22: Hoare triple {193353#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {193353#true} is VALID [2022-04-28 15:40:31,851 INFO L290 TraceCheckUtils]: 23: Hoare triple {193353#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {193353#true} is VALID [2022-04-28 15:40:31,851 INFO L290 TraceCheckUtils]: 24: Hoare triple {193353#true} assume 8464 == #t~mem55;havoc #t~mem55; {193353#true} is VALID [2022-04-28 15:40:31,851 INFO L290 TraceCheckUtils]: 25: Hoare triple {193353#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {193353#true} is VALID [2022-04-28 15:40:31,851 INFO L290 TraceCheckUtils]: 26: Hoare triple {193353#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {193353#true} is VALID [2022-04-28 15:40:31,851 INFO L290 TraceCheckUtils]: 27: Hoare triple {193353#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {193353#true} is VALID [2022-04-28 15:40:31,851 INFO L290 TraceCheckUtils]: 28: Hoare triple {193353#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {193353#true} is VALID [2022-04-28 15:40:31,851 INFO L290 TraceCheckUtils]: 29: Hoare triple {193353#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {193353#true} is VALID [2022-04-28 15:40:31,851 INFO L290 TraceCheckUtils]: 30: Hoare triple {193353#true} ~skip~0 := 0; {193353#true} is VALID [2022-04-28 15:40:31,852 INFO L290 TraceCheckUtils]: 31: Hoare triple {193353#true} assume !false; {193353#true} is VALID [2022-04-28 15:40:31,852 INFO L290 TraceCheckUtils]: 32: Hoare triple {193353#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {193353#true} is VALID [2022-04-28 15:40:31,852 INFO L290 TraceCheckUtils]: 33: Hoare triple {193353#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {193353#true} is VALID [2022-04-28 15:40:31,852 INFO L290 TraceCheckUtils]: 34: Hoare triple {193353#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {193353#true} is VALID [2022-04-28 15:40:31,852 INFO L290 TraceCheckUtils]: 35: Hoare triple {193353#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {193353#true} is VALID [2022-04-28 15:40:31,852 INFO L290 TraceCheckUtils]: 36: Hoare triple {193353#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {193353#true} is VALID [2022-04-28 15:40:31,852 INFO L290 TraceCheckUtils]: 37: Hoare triple {193353#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {193353#true} is VALID [2022-04-28 15:40:31,852 INFO L290 TraceCheckUtils]: 38: Hoare triple {193353#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {193353#true} is VALID [2022-04-28 15:40:31,852 INFO L290 TraceCheckUtils]: 39: Hoare triple {193353#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {193353#true} is VALID [2022-04-28 15:40:31,852 INFO L290 TraceCheckUtils]: 40: Hoare triple {193353#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {193353#true} is VALID [2022-04-28 15:40:31,852 INFO L290 TraceCheckUtils]: 41: Hoare triple {193353#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {193353#true} is VALID [2022-04-28 15:40:31,852 INFO L290 TraceCheckUtils]: 42: Hoare triple {193353#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {193353#true} is VALID [2022-04-28 15:40:31,852 INFO L290 TraceCheckUtils]: 43: Hoare triple {193353#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {193353#true} is VALID [2022-04-28 15:40:31,852 INFO L290 TraceCheckUtils]: 44: Hoare triple {193353#true} assume 8496 == #t~mem58;havoc #t~mem58; {193353#true} is VALID [2022-04-28 15:40:31,852 INFO L290 TraceCheckUtils]: 45: Hoare triple {193353#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {193353#true} is VALID [2022-04-28 15:40:31,853 INFO L290 TraceCheckUtils]: 46: Hoare triple {193353#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {193353#true} is VALID [2022-04-28 15:40:31,853 INFO L290 TraceCheckUtils]: 47: Hoare triple {193353#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {193353#true} is VALID [2022-04-28 15:40:31,853 INFO L290 TraceCheckUtils]: 48: Hoare triple {193353#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 72 + ~s.offset, 4); {193353#true} is VALID [2022-04-28 15:40:31,853 INFO L290 TraceCheckUtils]: 49: Hoare triple {193353#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {193353#true} is VALID [2022-04-28 15:40:31,853 INFO L290 TraceCheckUtils]: 50: Hoare triple {193353#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {193353#true} is VALID [2022-04-28 15:40:31,853 INFO L290 TraceCheckUtils]: 51: Hoare triple {193353#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {193353#true} is VALID [2022-04-28 15:40:31,853 INFO L290 TraceCheckUtils]: 52: Hoare triple {193353#true} ~skip~0 := 0; {193353#true} is VALID [2022-04-28 15:40:31,853 INFO L290 TraceCheckUtils]: 53: Hoare triple {193353#true} assume !false; {193353#true} is VALID [2022-04-28 15:40:31,853 INFO L290 TraceCheckUtils]: 54: Hoare triple {193353#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {193353#true} is VALID [2022-04-28 15:40:31,853 INFO L290 TraceCheckUtils]: 55: Hoare triple {193353#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {193353#true} is VALID [2022-04-28 15:40:31,853 INFO L290 TraceCheckUtils]: 56: Hoare triple {193353#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {193353#true} is VALID [2022-04-28 15:40:31,853 INFO L290 TraceCheckUtils]: 57: Hoare triple {193353#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {193353#true} is VALID [2022-04-28 15:40:31,853 INFO L290 TraceCheckUtils]: 58: Hoare triple {193353#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {193353#true} is VALID [2022-04-28 15:40:31,853 INFO L290 TraceCheckUtils]: 59: Hoare triple {193353#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {193353#true} is VALID [2022-04-28 15:40:31,853 INFO L290 TraceCheckUtils]: 60: Hoare triple {193353#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {193353#true} is VALID [2022-04-28 15:40:31,854 INFO L290 TraceCheckUtils]: 61: Hoare triple {193353#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {193353#true} is VALID [2022-04-28 15:40:31,854 INFO L290 TraceCheckUtils]: 62: Hoare triple {193353#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {193353#true} is VALID [2022-04-28 15:40:31,854 INFO L290 TraceCheckUtils]: 63: Hoare triple {193353#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {193353#true} is VALID [2022-04-28 15:40:31,854 INFO L290 TraceCheckUtils]: 64: Hoare triple {193353#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {193353#true} is VALID [2022-04-28 15:40:31,854 INFO L290 TraceCheckUtils]: 65: Hoare triple {193353#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {193353#true} is VALID [2022-04-28 15:40:31,854 INFO L290 TraceCheckUtils]: 66: Hoare triple {193353#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {193353#true} is VALID [2022-04-28 15:40:31,854 INFO L290 TraceCheckUtils]: 67: Hoare triple {193353#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {193353#true} is VALID [2022-04-28 15:40:31,854 INFO L290 TraceCheckUtils]: 68: Hoare triple {193353#true} assume 8512 == #t~mem60;havoc #t~mem60; {193353#true} is VALID [2022-04-28 15:40:31,854 INFO L290 TraceCheckUtils]: 69: Hoare triple {193353#true} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 888 + #t~mem95.offset, 8);call #t~mem97 := read~int(#t~mem96.base, 20 + #t~mem96.offset, 8); {193353#true} is VALID [2022-04-28 15:40:31,854 INFO L290 TraceCheckUtils]: 70: Hoare triple {193353#true} assume 0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 18446744073709551616;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;~skip~0 := 1; {193353#true} is VALID [2022-04-28 15:40:31,854 INFO L290 TraceCheckUtils]: 71: Hoare triple {193353#true} call write~int(8528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {193353#true} is VALID [2022-04-28 15:40:31,854 INFO L290 TraceCheckUtils]: 72: Hoare triple {193353#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {193353#true} is VALID [2022-04-28 15:40:31,854 INFO L290 TraceCheckUtils]: 73: Hoare triple {193353#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {193353#true} is VALID [2022-04-28 15:40:31,854 INFO L290 TraceCheckUtils]: 74: Hoare triple {193353#true} ~skip~0 := 0; {193353#true} is VALID [2022-04-28 15:40:31,854 INFO L290 TraceCheckUtils]: 75: Hoare triple {193353#true} assume !false; {193353#true} is VALID [2022-04-28 15:40:31,854 INFO L290 TraceCheckUtils]: 76: Hoare triple {193353#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {193353#true} is VALID [2022-04-28 15:40:31,855 INFO L290 TraceCheckUtils]: 77: Hoare triple {193353#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {193353#true} is VALID [2022-04-28 15:40:31,855 INFO L290 TraceCheckUtils]: 78: Hoare triple {193353#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {193353#true} is VALID [2022-04-28 15:40:31,855 INFO L290 TraceCheckUtils]: 79: Hoare triple {193353#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {193353#true} is VALID [2022-04-28 15:40:31,855 INFO L290 TraceCheckUtils]: 80: Hoare triple {193353#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {193353#true} is VALID [2022-04-28 15:40:31,855 INFO L290 TraceCheckUtils]: 81: Hoare triple {193353#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {193353#true} is VALID [2022-04-28 15:40:31,855 INFO L290 TraceCheckUtils]: 82: Hoare triple {193353#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {193353#true} is VALID [2022-04-28 15:40:31,855 INFO L290 TraceCheckUtils]: 83: Hoare triple {193353#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {193353#true} is VALID [2022-04-28 15:40:31,855 INFO L290 TraceCheckUtils]: 84: Hoare triple {193353#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {193353#true} is VALID [2022-04-28 15:40:31,855 INFO L290 TraceCheckUtils]: 85: Hoare triple {193353#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {193353#true} is VALID [2022-04-28 15:40:31,855 INFO L290 TraceCheckUtils]: 86: Hoare triple {193353#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {193353#true} is VALID [2022-04-28 15:40:31,855 INFO L290 TraceCheckUtils]: 87: Hoare triple {193353#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {193353#true} is VALID [2022-04-28 15:40:31,855 INFO L290 TraceCheckUtils]: 88: Hoare triple {193353#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {193353#true} is VALID [2022-04-28 15:40:31,855 INFO L290 TraceCheckUtils]: 89: Hoare triple {193353#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {193353#true} is VALID [2022-04-28 15:40:31,855 INFO L290 TraceCheckUtils]: 90: Hoare triple {193353#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {193353#true} is VALID [2022-04-28 15:40:31,855 INFO L290 TraceCheckUtils]: 91: Hoare triple {193353#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {193353#true} is VALID [2022-04-28 15:40:31,856 INFO L290 TraceCheckUtils]: 92: Hoare triple {193353#true} assume 8528 == #t~mem62;havoc #t~mem62; {193353#true} is VALID [2022-04-28 15:40:31,856 INFO L290 TraceCheckUtils]: 93: Hoare triple {193353#true} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 888 + #t~mem99.offset, 8);call #t~mem101 := read~int(#t~mem100.base, 20 + #t~mem100.offset, 8);~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, 332 + ~s.offset, 8); {193353#true} is VALID [2022-04-28 15:40:31,856 INFO L290 TraceCheckUtils]: 94: Hoare triple {193353#true} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 18446744073709551616;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem103.base, 935 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {193353#true} is VALID [2022-04-28 15:40:31,856 INFO L290 TraceCheckUtils]: 95: Hoare triple {193353#true} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem106 := read~int(#t~mem105.base, 935 + #t~mem105.offset, 4); {193353#true} is VALID [2022-04-28 15:40:31,856 INFO L290 TraceCheckUtils]: 96: Hoare triple {193353#true} assume 0 != #t~mem106;havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {193353#true} is VALID [2022-04-28 15:40:31,856 INFO L290 TraceCheckUtils]: 97: Hoare triple {193353#true} assume -2147483648 <= #t~nondet115 && #t~nondet115 <= 2147483647;~ret~0 := #t~nondet115;havoc #t~nondet115; {193353#true} is VALID [2022-04-28 15:40:31,856 INFO L290 TraceCheckUtils]: 98: Hoare triple {193353#true} assume !(~ret~0 <= 0); {193353#true} is VALID [2022-04-28 15:40:31,857 INFO L290 TraceCheckUtils]: 99: Hoare triple {193353#true} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {193358#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:40:31,857 INFO L290 TraceCheckUtils]: 100: Hoare triple {193358#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {193358#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:40:31,857 INFO L290 TraceCheckUtils]: 101: Hoare triple {193358#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {193358#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:40:31,858 INFO L290 TraceCheckUtils]: 102: Hoare triple {193358#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {193358#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:40:31,858 INFO L290 TraceCheckUtils]: 103: Hoare triple {193358#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {193358#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:40:31,858 INFO L290 TraceCheckUtils]: 104: Hoare triple {193358#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {193358#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:40:31,859 INFO L290 TraceCheckUtils]: 105: Hoare triple {193358#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {193358#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:40:31,859 INFO L290 TraceCheckUtils]: 106: Hoare triple {193358#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {193358#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:40:31,859 INFO L290 TraceCheckUtils]: 107: Hoare triple {193358#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {193358#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:40:31,860 INFO L290 TraceCheckUtils]: 108: Hoare triple {193358#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {193358#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:40:31,860 INFO L290 TraceCheckUtils]: 109: Hoare triple {193358#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {193358#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:40:31,860 INFO L290 TraceCheckUtils]: 110: Hoare triple {193358#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {193358#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:40:31,861 INFO L290 TraceCheckUtils]: 111: Hoare triple {193358#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {193358#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:40:31,861 INFO L290 TraceCheckUtils]: 112: Hoare triple {193358#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {193358#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:40:31,861 INFO L290 TraceCheckUtils]: 113: Hoare triple {193358#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {193358#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:40:31,862 INFO L290 TraceCheckUtils]: 114: Hoare triple {193358#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {193358#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:40:31,862 INFO L290 TraceCheckUtils]: 115: Hoare triple {193358#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {193358#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:40:31,862 INFO L290 TraceCheckUtils]: 116: Hoare triple {193358#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {193358#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:40:31,862 INFO L290 TraceCheckUtils]: 117: Hoare triple {193358#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {193358#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:40:31,863 INFO L290 TraceCheckUtils]: 118: Hoare triple {193358#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {193358#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:40:31,863 INFO L290 TraceCheckUtils]: 119: Hoare triple {193358#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {193358#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:40:31,863 INFO L290 TraceCheckUtils]: 120: Hoare triple {193358#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {193358#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:40:31,864 INFO L290 TraceCheckUtils]: 121: Hoare triple {193358#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {193359#(= |ssl3_accept_#t~mem64| 8544)} is VALID [2022-04-28 15:40:31,864 INFO L290 TraceCheckUtils]: 122: Hoare triple {193359#(= |ssl3_accept_#t~mem64| 8544)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {193354#false} is VALID [2022-04-28 15:40:31,864 INFO L290 TraceCheckUtils]: 123: Hoare triple {193354#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {193354#false} is VALID [2022-04-28 15:40:31,864 INFO L290 TraceCheckUtils]: 124: Hoare triple {193354#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {193354#false} is VALID [2022-04-28 15:40:31,864 INFO L290 TraceCheckUtils]: 125: Hoare triple {193354#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {193354#false} is VALID [2022-04-28 15:40:31,864 INFO L290 TraceCheckUtils]: 126: Hoare triple {193354#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {193354#false} is VALID [2022-04-28 15:40:31,864 INFO L290 TraceCheckUtils]: 127: Hoare triple {193354#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {193354#false} is VALID [2022-04-28 15:40:31,864 INFO L290 TraceCheckUtils]: 128: Hoare triple {193354#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {193354#false} is VALID [2022-04-28 15:40:31,864 INFO L290 TraceCheckUtils]: 129: Hoare triple {193354#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {193354#false} is VALID [2022-04-28 15:40:31,864 INFO L290 TraceCheckUtils]: 130: Hoare triple {193354#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {193354#false} is VALID [2022-04-28 15:40:31,865 INFO L290 TraceCheckUtils]: 131: Hoare triple {193354#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {193354#false} is VALID [2022-04-28 15:40:31,865 INFO L290 TraceCheckUtils]: 132: Hoare triple {193354#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {193354#false} is VALID [2022-04-28 15:40:31,865 INFO L290 TraceCheckUtils]: 133: Hoare triple {193354#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {193354#false} is VALID [2022-04-28 15:40:31,865 INFO L290 TraceCheckUtils]: 134: Hoare triple {193354#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {193354#false} is VALID [2022-04-28 15:40:31,865 INFO L290 TraceCheckUtils]: 135: Hoare triple {193354#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {193354#false} is VALID [2022-04-28 15:40:31,865 INFO L290 TraceCheckUtils]: 136: Hoare triple {193354#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {193354#false} is VALID [2022-04-28 15:40:31,865 INFO L290 TraceCheckUtils]: 137: Hoare triple {193354#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 72 + ~s.offset, 4); {193354#false} is VALID [2022-04-28 15:40:31,865 INFO L290 TraceCheckUtils]: 138: Hoare triple {193354#false} assume 8673 == #t~mem80;havoc #t~mem80; {193354#false} is VALID [2022-04-28 15:40:31,865 INFO L290 TraceCheckUtils]: 139: Hoare triple {193354#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {193354#false} is VALID [2022-04-28 15:40:31,865 INFO L290 TraceCheckUtils]: 140: Hoare triple {193354#false} assume !(3 == ~blastFlag~0); {193354#false} is VALID [2022-04-28 15:40:31,865 INFO L290 TraceCheckUtils]: 141: Hoare triple {193354#false} assume !(6 == ~blastFlag~0); {193354#false} is VALID [2022-04-28 15:40:31,865 INFO L290 TraceCheckUtils]: 142: Hoare triple {193354#false} assume !(9 == ~blastFlag~0); {193354#false} is VALID [2022-04-28 15:40:31,865 INFO L290 TraceCheckUtils]: 143: Hoare triple {193354#false} assume !(12 == ~blastFlag~0); {193354#false} is VALID [2022-04-28 15:40:31,865 INFO L290 TraceCheckUtils]: 144: Hoare triple {193354#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 72 + ~s.offset, 4);call #t~mem145 := read~int(~s.base, 128 + ~s.offset, 4); {193354#false} is VALID [2022-04-28 15:40:31,865 INFO L290 TraceCheckUtils]: 145: Hoare triple {193354#false} assume 0 != #t~mem145;havoc #t~mem145;call #t~mem146.base, #t~mem146.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8640, #t~mem146.base, 904 + #t~mem146.offset, 4);havoc #t~mem146.base, #t~mem146.offset; {193354#false} is VALID [2022-04-28 15:40:31,866 INFO L290 TraceCheckUtils]: 146: Hoare triple {193354#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {193354#false} is VALID [2022-04-28 15:40:31,866 INFO L290 TraceCheckUtils]: 147: Hoare triple {193354#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {193354#false} is VALID [2022-04-28 15:40:31,866 INFO L290 TraceCheckUtils]: 148: Hoare triple {193354#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {193354#false} is VALID [2022-04-28 15:40:31,866 INFO L290 TraceCheckUtils]: 149: Hoare triple {193354#false} ~skip~0 := 0; {193354#false} is VALID [2022-04-28 15:40:31,866 INFO L290 TraceCheckUtils]: 150: Hoare triple {193354#false} assume !false; {193354#false} is VALID [2022-04-28 15:40:31,866 INFO L290 TraceCheckUtils]: 151: Hoare triple {193354#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {193354#false} is VALID [2022-04-28 15:40:31,866 INFO L290 TraceCheckUtils]: 152: Hoare triple {193354#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {193354#false} is VALID [2022-04-28 15:40:31,866 INFO L290 TraceCheckUtils]: 153: Hoare triple {193354#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {193354#false} is VALID [2022-04-28 15:40:31,866 INFO L290 TraceCheckUtils]: 154: Hoare triple {193354#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {193354#false} is VALID [2022-04-28 15:40:31,866 INFO L290 TraceCheckUtils]: 155: Hoare triple {193354#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {193354#false} is VALID [2022-04-28 15:40:31,866 INFO L290 TraceCheckUtils]: 156: Hoare triple {193354#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {193354#false} is VALID [2022-04-28 15:40:31,866 INFO L290 TraceCheckUtils]: 157: Hoare triple {193354#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {193354#false} is VALID [2022-04-28 15:40:31,866 INFO L290 TraceCheckUtils]: 158: Hoare triple {193354#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {193354#false} is VALID [2022-04-28 15:40:31,866 INFO L290 TraceCheckUtils]: 159: Hoare triple {193354#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {193354#false} is VALID [2022-04-28 15:40:31,867 INFO L290 TraceCheckUtils]: 160: Hoare triple {193354#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {193354#false} is VALID [2022-04-28 15:40:31,867 INFO L290 TraceCheckUtils]: 161: Hoare triple {193354#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {193354#false} is VALID [2022-04-28 15:40:31,867 INFO L290 TraceCheckUtils]: 162: Hoare triple {193354#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {193354#false} is VALID [2022-04-28 15:40:31,867 INFO L290 TraceCheckUtils]: 163: Hoare triple {193354#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {193354#false} is VALID [2022-04-28 15:40:31,867 INFO L290 TraceCheckUtils]: 164: Hoare triple {193354#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {193354#false} is VALID [2022-04-28 15:40:31,867 INFO L290 TraceCheckUtils]: 165: Hoare triple {193354#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {193354#false} is VALID [2022-04-28 15:40:31,867 INFO L290 TraceCheckUtils]: 166: Hoare triple {193354#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {193354#false} is VALID [2022-04-28 15:40:31,867 INFO L290 TraceCheckUtils]: 167: Hoare triple {193354#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {193354#false} is VALID [2022-04-28 15:40:31,867 INFO L290 TraceCheckUtils]: 168: Hoare triple {193354#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {193354#false} is VALID [2022-04-28 15:40:31,867 INFO L290 TraceCheckUtils]: 169: Hoare triple {193354#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {193354#false} is VALID [2022-04-28 15:40:31,867 INFO L290 TraceCheckUtils]: 170: Hoare triple {193354#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {193354#false} is VALID [2022-04-28 15:40:31,867 INFO L290 TraceCheckUtils]: 171: Hoare triple {193354#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {193354#false} is VALID [2022-04-28 15:40:31,867 INFO L290 TraceCheckUtils]: 172: Hoare triple {193354#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {193354#false} is VALID [2022-04-28 15:40:31,867 INFO L290 TraceCheckUtils]: 173: Hoare triple {193354#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {193354#false} is VALID [2022-04-28 15:40:31,867 INFO L290 TraceCheckUtils]: 174: Hoare triple {193354#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {193354#false} is VALID [2022-04-28 15:40:31,868 INFO L290 TraceCheckUtils]: 175: Hoare triple {193354#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {193354#false} is VALID [2022-04-28 15:40:31,868 INFO L290 TraceCheckUtils]: 176: Hoare triple {193354#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {193354#false} is VALID [2022-04-28 15:40:31,868 INFO L290 TraceCheckUtils]: 177: Hoare triple {193354#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {193354#false} is VALID [2022-04-28 15:40:31,868 INFO L290 TraceCheckUtils]: 178: Hoare triple {193354#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {193354#false} is VALID [2022-04-28 15:40:31,868 INFO L290 TraceCheckUtils]: 179: Hoare triple {193354#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {193354#false} is VALID [2022-04-28 15:40:31,868 INFO L290 TraceCheckUtils]: 180: Hoare triple {193354#false} assume 8640 == #t~mem75;havoc #t~mem75; {193354#false} is VALID [2022-04-28 15:40:31,868 INFO L290 TraceCheckUtils]: 181: Hoare triple {193354#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {193354#false} is VALID [2022-04-28 15:40:31,868 INFO L290 TraceCheckUtils]: 182: Hoare triple {193354#false} assume !(4 == ~blastFlag~0); {193354#false} is VALID [2022-04-28 15:40:31,868 INFO L290 TraceCheckUtils]: 183: Hoare triple {193354#false} assume !(7 == ~blastFlag~0); {193354#false} is VALID [2022-04-28 15:40:31,868 INFO L290 TraceCheckUtils]: 184: Hoare triple {193354#false} assume !(10 == ~blastFlag~0); {193354#false} is VALID [2022-04-28 15:40:31,868 INFO L290 TraceCheckUtils]: 185: Hoare triple {193354#false} assume !false; {193354#false} is VALID [2022-04-28 15:40:31,869 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2022-04-28 15:40:31,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:40:31,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988892975] [2022-04-28 15:40:31,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988892975] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:40:31,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:40:31,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:40:31,869 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:40:31,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [675795870] [2022-04-28 15:40:31,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [675795870] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:40:31,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:40:31,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:40:31,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607837653] [2022-04-28 15:40:31,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:40:31,870 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 186 [2022-04-28 15:40:31,870 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:40:31,870 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:40:31,985 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:40:31,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:40:31,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:40:31,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:40:31,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:40:31,986 INFO L87 Difference]: Start difference. First operand 2391 states and 3447 transitions. Second operand has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:40:38,036 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-28 15:40:40,059 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-28 15:40:42,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:40:42,275 INFO L93 Difference]: Finished difference Result 4839 states and 6981 transitions. [2022-04-28 15:40:42,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:40:42,275 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 186 [2022-04-28 15:40:42,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:40:42,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:40:42,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 496 transitions. [2022-04-28 15:40:42,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:40:42,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 496 transitions. [2022-04-28 15:40:42,279 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 496 transitions. [2022-04-28 15:40:42,580 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 496 edges. 496 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:40:42,830 INFO L225 Difference]: With dead ends: 4839 [2022-04-28 15:40:42,830 INFO L226 Difference]: Without dead ends: 2476 [2022-04-28 15:40:42,832 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-28 15:40:42,833 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 38 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:40:42,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 614 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-04-28 15:40:42,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2476 states. [2022-04-28 15:40:43,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2476 to 2391. [2022-04-28 15:40:43,006 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:40:43,008 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2476 states. Second operand has 2391 states, 2386 states have (on average 1.4413243922883487) internal successors, (3439), 2386 states have internal predecessors, (3439), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:40:43,010 INFO L74 IsIncluded]: Start isIncluded. First operand 2476 states. Second operand has 2391 states, 2386 states have (on average 1.4413243922883487) internal successors, (3439), 2386 states have internal predecessors, (3439), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:40:43,012 INFO L87 Difference]: Start difference. First operand 2476 states. Second operand has 2391 states, 2386 states have (on average 1.4413243922883487) internal successors, (3439), 2386 states have internal predecessors, (3439), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:40:43,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:40:43,158 INFO L93 Difference]: Finished difference Result 2476 states and 3562 transitions. [2022-04-28 15:40:43,158 INFO L276 IsEmpty]: Start isEmpty. Operand 2476 states and 3562 transitions. [2022-04-28 15:40:43,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:40:43,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:40:43,178 INFO L74 IsIncluded]: Start isIncluded. First operand has 2391 states, 2386 states have (on average 1.4413243922883487) internal successors, (3439), 2386 states have internal predecessors, (3439), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2476 states. [2022-04-28 15:40:43,179 INFO L87 Difference]: Start difference. First operand has 2391 states, 2386 states have (on average 1.4413243922883487) internal successors, (3439), 2386 states have internal predecessors, (3439), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2476 states. [2022-04-28 15:40:43,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:40:43,333 INFO L93 Difference]: Finished difference Result 2476 states and 3562 transitions. [2022-04-28 15:40:43,333 INFO L276 IsEmpty]: Start isEmpty. Operand 2476 states and 3562 transitions. [2022-04-28 15:40:43,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:40:43,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:40:43,335 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:40:43,335 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:40:43,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2391 states, 2386 states have (on average 1.4413243922883487) internal successors, (3439), 2386 states have internal predecessors, (3439), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:40:43,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2391 states to 2391 states and 3443 transitions. [2022-04-28 15:40:43,588 INFO L78 Accepts]: Start accepts. Automaton has 2391 states and 3443 transitions. Word has length 186 [2022-04-28 15:40:43,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:40:43,588 INFO L495 AbstractCegarLoop]: Abstraction has 2391 states and 3443 transitions. [2022-04-28 15:40:43,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:40:43,588 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2391 states and 3443 transitions. [2022-04-28 15:40:46,497 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3443 edges. 3443 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:40:46,498 INFO L276 IsEmpty]: Start isEmpty. Operand 2391 states and 3443 transitions. [2022-04-28 15:40:46,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-04-28 15:40:46,500 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:40:46,500 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-04-28 15:40:46,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-04-28 15:40:46,500 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:40:46,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:40:46,500 INFO L85 PathProgramCache]: Analyzing trace with hash 31163674, now seen corresponding path program 1 times [2022-04-28 15:40:46,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:40:46,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [285388897] [2022-04-28 15:40:46,582 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:40:46,582 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:40:46,582 INFO L85 PathProgramCache]: Analyzing trace with hash 31163674, now seen corresponding path program 2 times [2022-04-28 15:40:46,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:40:46,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357175454] [2022-04-28 15:40:46,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:40:46,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:40:46,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:40:46,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:40:46,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:40:46,686 INFO L290 TraceCheckUtils]: 0: Hoare triple {212784#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {212777#true} is VALID [2022-04-28 15:40:46,686 INFO L290 TraceCheckUtils]: 1: Hoare triple {212777#true} assume true; {212777#true} is VALID [2022-04-28 15:40:46,686 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {212777#true} {212777#true} #703#return; {212777#true} is VALID [2022-04-28 15:40:46,686 INFO L272 TraceCheckUtils]: 0: Hoare triple {212777#true} call ULTIMATE.init(); {212784#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-28 15:40:46,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {212784#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {212777#true} is VALID [2022-04-28 15:40:46,687 INFO L290 TraceCheckUtils]: 2: Hoare triple {212777#true} assume true; {212777#true} is VALID [2022-04-28 15:40:46,687 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {212777#true} {212777#true} #703#return; {212777#true} is VALID [2022-04-28 15:40:46,687 INFO L272 TraceCheckUtils]: 4: Hoare triple {212777#true} call #t~ret161 := main(); {212777#true} is VALID [2022-04-28 15:40:46,687 INFO L290 TraceCheckUtils]: 5: Hoare triple {212777#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {212777#true} is VALID [2022-04-28 15:40:46,687 INFO L290 TraceCheckUtils]: 6: Hoare triple {212777#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {212777#true} is VALID [2022-04-28 15:40:46,687 INFO L272 TraceCheckUtils]: 7: Hoare triple {212777#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {212777#true} is VALID [2022-04-28 15:40:46,687 INFO L290 TraceCheckUtils]: 8: Hoare triple {212777#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {212777#true} is VALID [2022-04-28 15:40:46,687 INFO L290 TraceCheckUtils]: 9: Hoare triple {212777#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {212777#true} is VALID [2022-04-28 15:40:46,687 INFO L290 TraceCheckUtils]: 10: Hoare triple {212777#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {212777#true} is VALID [2022-04-28 15:40:46,687 INFO L290 TraceCheckUtils]: 11: Hoare triple {212777#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {212777#true} is VALID [2022-04-28 15:40:46,687 INFO L290 TraceCheckUtils]: 12: Hoare triple {212777#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {212777#true} is VALID [2022-04-28 15:40:46,687 INFO L290 TraceCheckUtils]: 13: Hoare triple {212777#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {212777#true} is VALID [2022-04-28 15:40:46,687 INFO L290 TraceCheckUtils]: 14: Hoare triple {212777#true} assume !false; {212777#true} is VALID [2022-04-28 15:40:46,687 INFO L290 TraceCheckUtils]: 15: Hoare triple {212777#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {212777#true} is VALID [2022-04-28 15:40:46,688 INFO L290 TraceCheckUtils]: 16: Hoare triple {212777#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {212777#true} is VALID [2022-04-28 15:40:46,688 INFO L290 TraceCheckUtils]: 17: Hoare triple {212777#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {212777#true} is VALID [2022-04-28 15:40:46,688 INFO L290 TraceCheckUtils]: 18: Hoare triple {212777#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {212777#true} is VALID [2022-04-28 15:40:46,688 INFO L290 TraceCheckUtils]: 19: Hoare triple {212777#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {212777#true} is VALID [2022-04-28 15:40:46,688 INFO L290 TraceCheckUtils]: 20: Hoare triple {212777#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {212777#true} is VALID [2022-04-28 15:40:46,688 INFO L290 TraceCheckUtils]: 21: Hoare triple {212777#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {212777#true} is VALID [2022-04-28 15:40:46,688 INFO L290 TraceCheckUtils]: 22: Hoare triple {212777#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {212777#true} is VALID [2022-04-28 15:40:46,688 INFO L290 TraceCheckUtils]: 23: Hoare triple {212777#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {212777#true} is VALID [2022-04-28 15:40:46,688 INFO L290 TraceCheckUtils]: 24: Hoare triple {212777#true} assume 8464 == #t~mem55;havoc #t~mem55; {212777#true} is VALID [2022-04-28 15:40:46,688 INFO L290 TraceCheckUtils]: 25: Hoare triple {212777#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {212777#true} is VALID [2022-04-28 15:40:46,688 INFO L290 TraceCheckUtils]: 26: Hoare triple {212777#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {212777#true} is VALID [2022-04-28 15:40:46,688 INFO L290 TraceCheckUtils]: 27: Hoare triple {212777#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {212777#true} is VALID [2022-04-28 15:40:46,688 INFO L290 TraceCheckUtils]: 28: Hoare triple {212777#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {212777#true} is VALID [2022-04-28 15:40:46,688 INFO L290 TraceCheckUtils]: 29: Hoare triple {212777#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {212777#true} is VALID [2022-04-28 15:40:46,688 INFO L290 TraceCheckUtils]: 30: Hoare triple {212777#true} ~skip~0 := 0; {212777#true} is VALID [2022-04-28 15:40:46,689 INFO L290 TraceCheckUtils]: 31: Hoare triple {212777#true} assume !false; {212777#true} is VALID [2022-04-28 15:40:46,689 INFO L290 TraceCheckUtils]: 32: Hoare triple {212777#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {212777#true} is VALID [2022-04-28 15:40:46,689 INFO L290 TraceCheckUtils]: 33: Hoare triple {212777#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {212777#true} is VALID [2022-04-28 15:40:46,689 INFO L290 TraceCheckUtils]: 34: Hoare triple {212777#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {212777#true} is VALID [2022-04-28 15:40:46,689 INFO L290 TraceCheckUtils]: 35: Hoare triple {212777#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {212777#true} is VALID [2022-04-28 15:40:46,689 INFO L290 TraceCheckUtils]: 36: Hoare triple {212777#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {212777#true} is VALID [2022-04-28 15:40:46,689 INFO L290 TraceCheckUtils]: 37: Hoare triple {212777#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {212777#true} is VALID [2022-04-28 15:40:46,689 INFO L290 TraceCheckUtils]: 38: Hoare triple {212777#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {212777#true} is VALID [2022-04-28 15:40:46,689 INFO L290 TraceCheckUtils]: 39: Hoare triple {212777#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {212777#true} is VALID [2022-04-28 15:40:46,689 INFO L290 TraceCheckUtils]: 40: Hoare triple {212777#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {212777#true} is VALID [2022-04-28 15:40:46,689 INFO L290 TraceCheckUtils]: 41: Hoare triple {212777#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {212777#true} is VALID [2022-04-28 15:40:46,689 INFO L290 TraceCheckUtils]: 42: Hoare triple {212777#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {212777#true} is VALID [2022-04-28 15:40:46,689 INFO L290 TraceCheckUtils]: 43: Hoare triple {212777#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {212777#true} is VALID [2022-04-28 15:40:46,689 INFO L290 TraceCheckUtils]: 44: Hoare triple {212777#true} assume 8496 == #t~mem58;havoc #t~mem58; {212777#true} is VALID [2022-04-28 15:40:46,689 INFO L290 TraceCheckUtils]: 45: Hoare triple {212777#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {212777#true} is VALID [2022-04-28 15:40:46,689 INFO L290 TraceCheckUtils]: 46: Hoare triple {212777#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {212777#true} is VALID [2022-04-28 15:40:46,690 INFO L290 TraceCheckUtils]: 47: Hoare triple {212777#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {212777#true} is VALID [2022-04-28 15:40:46,690 INFO L290 TraceCheckUtils]: 48: Hoare triple {212777#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {212777#true} is VALID [2022-04-28 15:40:46,690 INFO L290 TraceCheckUtils]: 49: Hoare triple {212777#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {212777#true} is VALID [2022-04-28 15:40:46,690 INFO L290 TraceCheckUtils]: 50: Hoare triple {212777#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {212777#true} is VALID [2022-04-28 15:40:46,690 INFO L290 TraceCheckUtils]: 51: Hoare triple {212777#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {212777#true} is VALID [2022-04-28 15:40:46,690 INFO L290 TraceCheckUtils]: 52: Hoare triple {212777#true} ~skip~0 := 0; {212777#true} is VALID [2022-04-28 15:40:46,690 INFO L290 TraceCheckUtils]: 53: Hoare triple {212777#true} assume !false; {212777#true} is VALID [2022-04-28 15:40:46,690 INFO L290 TraceCheckUtils]: 54: Hoare triple {212777#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {212777#true} is VALID [2022-04-28 15:40:46,690 INFO L290 TraceCheckUtils]: 55: Hoare triple {212777#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {212777#true} is VALID [2022-04-28 15:40:46,690 INFO L290 TraceCheckUtils]: 56: Hoare triple {212777#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {212777#true} is VALID [2022-04-28 15:40:46,690 INFO L290 TraceCheckUtils]: 57: Hoare triple {212777#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {212777#true} is VALID [2022-04-28 15:40:46,690 INFO L290 TraceCheckUtils]: 58: Hoare triple {212777#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {212777#true} is VALID [2022-04-28 15:40:46,690 INFO L290 TraceCheckUtils]: 59: Hoare triple {212777#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {212777#true} is VALID [2022-04-28 15:40:46,690 INFO L290 TraceCheckUtils]: 60: Hoare triple {212777#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {212777#true} is VALID [2022-04-28 15:40:46,690 INFO L290 TraceCheckUtils]: 61: Hoare triple {212777#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {212777#true} is VALID [2022-04-28 15:40:46,691 INFO L290 TraceCheckUtils]: 62: Hoare triple {212777#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {212777#true} is VALID [2022-04-28 15:40:46,691 INFO L290 TraceCheckUtils]: 63: Hoare triple {212777#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {212777#true} is VALID [2022-04-28 15:40:46,691 INFO L290 TraceCheckUtils]: 64: Hoare triple {212777#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {212777#true} is VALID [2022-04-28 15:40:46,691 INFO L290 TraceCheckUtils]: 65: Hoare triple {212777#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {212777#true} is VALID [2022-04-28 15:40:46,691 INFO L290 TraceCheckUtils]: 66: Hoare triple {212777#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {212777#true} is VALID [2022-04-28 15:40:46,691 INFO L290 TraceCheckUtils]: 67: Hoare triple {212777#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {212777#true} is VALID [2022-04-28 15:40:46,691 INFO L290 TraceCheckUtils]: 68: Hoare triple {212777#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {212777#true} is VALID [2022-04-28 15:40:46,691 INFO L290 TraceCheckUtils]: 69: Hoare triple {212777#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {212777#true} is VALID [2022-04-28 15:40:46,691 INFO L290 TraceCheckUtils]: 70: Hoare triple {212777#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {212777#true} is VALID [2022-04-28 15:40:46,691 INFO L290 TraceCheckUtils]: 71: Hoare triple {212777#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {212777#true} is VALID [2022-04-28 15:40:46,691 INFO L290 TraceCheckUtils]: 72: Hoare triple {212777#true} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {212777#true} is VALID [2022-04-28 15:40:46,691 INFO L290 TraceCheckUtils]: 73: Hoare triple {212777#true} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {212777#true} is VALID [2022-04-28 15:40:46,691 INFO L290 TraceCheckUtils]: 74: Hoare triple {212777#true} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {212777#true} is VALID [2022-04-28 15:40:46,691 INFO L290 TraceCheckUtils]: 75: Hoare triple {212777#true} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {212777#true} is VALID [2022-04-28 15:40:46,691 INFO L290 TraceCheckUtils]: 76: Hoare triple {212777#true} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {212777#true} is VALID [2022-04-28 15:40:46,691 INFO L290 TraceCheckUtils]: 77: Hoare triple {212777#true} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {212777#true} is VALID [2022-04-28 15:40:46,692 INFO L290 TraceCheckUtils]: 78: Hoare triple {212777#true} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {212777#true} is VALID [2022-04-28 15:40:46,692 INFO L290 TraceCheckUtils]: 79: Hoare triple {212777#true} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {212777#true} is VALID [2022-04-28 15:40:46,692 INFO L290 TraceCheckUtils]: 80: Hoare triple {212777#true} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {212777#true} is VALID [2022-04-28 15:40:46,692 INFO L290 TraceCheckUtils]: 81: Hoare triple {212777#true} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {212777#true} is VALID [2022-04-28 15:40:46,692 INFO L290 TraceCheckUtils]: 82: Hoare triple {212777#true} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {212777#true} is VALID [2022-04-28 15:40:46,692 INFO L290 TraceCheckUtils]: 83: Hoare triple {212777#true} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {212777#true} is VALID [2022-04-28 15:40:46,692 INFO L290 TraceCheckUtils]: 84: Hoare triple {212777#true} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {212777#true} is VALID [2022-04-28 15:40:46,692 INFO L290 TraceCheckUtils]: 85: Hoare triple {212777#true} assume 8656 == #t~mem77;havoc #t~mem77; {212777#true} is VALID [2022-04-28 15:40:46,692 INFO L290 TraceCheckUtils]: 86: Hoare triple {212777#true} call #t~mem140.base, #t~mem140.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem141.base, #t~mem141.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem142.base, #t~mem142.offset := read~$Pointer$(#t~mem141.base, 888 + #t~mem141.offset, 8);call write~$Pointer$(#t~mem142.base, #t~mem142.offset, #t~mem140.base, 192 + #t~mem140.offset, 8);havoc #t~mem140.base, #t~mem140.offset;havoc #t~mem141.base, #t~mem141.offset;havoc #t~mem142.base, #t~mem142.offset; {212777#true} is VALID [2022-04-28 15:40:46,692 INFO L290 TraceCheckUtils]: 87: Hoare triple {212777#true} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {212777#true} is VALID [2022-04-28 15:40:46,692 INFO L290 TraceCheckUtils]: 88: Hoare triple {212777#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {212777#true} is VALID [2022-04-28 15:40:46,693 INFO L290 TraceCheckUtils]: 89: Hoare triple {212777#true} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {212782#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-28 15:40:46,693 INFO L290 TraceCheckUtils]: 90: Hoare triple {212782#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(0 == ~tmp___10~0); {212782#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-28 15:40:46,694 INFO L290 TraceCheckUtils]: 91: Hoare triple {212782#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {212782#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-28 15:40:46,694 INFO L290 TraceCheckUtils]: 92: Hoare triple {212782#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {212782#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-28 15:40:46,694 INFO L290 TraceCheckUtils]: 93: Hoare triple {212782#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} ~skip~0 := 0; {212782#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-28 15:40:46,695 INFO L290 TraceCheckUtils]: 94: Hoare triple {212782#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !false; {212782#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-28 15:40:46,695 INFO L290 TraceCheckUtils]: 95: Hoare triple {212782#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {212782#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-28 15:40:46,695 INFO L290 TraceCheckUtils]: 96: Hoare triple {212782#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {212782#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-28 15:40:46,696 INFO L290 TraceCheckUtils]: 97: Hoare triple {212782#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {212782#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-28 15:40:46,696 INFO L290 TraceCheckUtils]: 98: Hoare triple {212782#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {212782#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-28 15:40:46,696 INFO L290 TraceCheckUtils]: 99: Hoare triple {212782#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {212782#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-28 15:40:46,697 INFO L290 TraceCheckUtils]: 100: Hoare triple {212782#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {212782#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-28 15:40:46,697 INFO L290 TraceCheckUtils]: 101: Hoare triple {212782#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {212782#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-28 15:40:46,697 INFO L290 TraceCheckUtils]: 102: Hoare triple {212782#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {212782#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-28 15:40:46,698 INFO L290 TraceCheckUtils]: 103: Hoare triple {212782#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {212782#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-28 15:40:46,698 INFO L290 TraceCheckUtils]: 104: Hoare triple {212782#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {212782#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-28 15:40:46,698 INFO L290 TraceCheckUtils]: 105: Hoare triple {212782#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {212782#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-28 15:40:46,699 INFO L290 TraceCheckUtils]: 106: Hoare triple {212782#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {212782#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-28 15:40:46,699 INFO L290 TraceCheckUtils]: 107: Hoare triple {212782#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {212782#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-28 15:40:46,699 INFO L290 TraceCheckUtils]: 108: Hoare triple {212782#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {212782#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-28 15:40:46,700 INFO L290 TraceCheckUtils]: 109: Hoare triple {212782#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {212782#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-28 15:40:46,700 INFO L290 TraceCheckUtils]: 110: Hoare triple {212782#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {212782#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-28 15:40:46,700 INFO L290 TraceCheckUtils]: 111: Hoare triple {212782#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {212782#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-28 15:40:46,701 INFO L290 TraceCheckUtils]: 112: Hoare triple {212782#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {212782#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-28 15:40:46,701 INFO L290 TraceCheckUtils]: 113: Hoare triple {212782#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {212782#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-28 15:40:46,701 INFO L290 TraceCheckUtils]: 114: Hoare triple {212782#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {212782#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-28 15:40:46,702 INFO L290 TraceCheckUtils]: 115: Hoare triple {212782#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {212783#(= |ssl3_accept_#t~mem67| 8672)} is VALID [2022-04-28 15:40:46,702 INFO L290 TraceCheckUtils]: 116: Hoare triple {212783#(= |ssl3_accept_#t~mem67| 8672)} assume 8561 == #t~mem67;havoc #t~mem67; {212778#false} is VALID [2022-04-28 15:40:46,702 INFO L290 TraceCheckUtils]: 117: Hoare triple {212778#false} assume -2147483648 <= #t~nondet130 && #t~nondet130 <= 2147483647;~ret~0 := #t~nondet130;havoc #t~nondet130; {212778#false} is VALID [2022-04-28 15:40:46,702 INFO L290 TraceCheckUtils]: 118: Hoare triple {212778#false} assume !(~ret~0 <= 0);call #t~mem131.base, #t~mem131.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8576, #t~mem131.base, 904 + #t~mem131.offset, 4);havoc #t~mem131.base, #t~mem131.offset;call write~int(8448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {212778#false} is VALID [2022-04-28 15:40:46,702 INFO L290 TraceCheckUtils]: 119: Hoare triple {212778#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {212778#false} is VALID [2022-04-28 15:40:46,702 INFO L290 TraceCheckUtils]: 120: Hoare triple {212778#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {212778#false} is VALID [2022-04-28 15:40:46,702 INFO L290 TraceCheckUtils]: 121: Hoare triple {212778#false} ~skip~0 := 0; {212778#false} is VALID [2022-04-28 15:40:46,702 INFO L290 TraceCheckUtils]: 122: Hoare triple {212778#false} assume !false; {212778#false} is VALID [2022-04-28 15:40:46,702 INFO L290 TraceCheckUtils]: 123: Hoare triple {212778#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {212778#false} is VALID [2022-04-28 15:40:46,702 INFO L290 TraceCheckUtils]: 124: Hoare triple {212778#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {212778#false} is VALID [2022-04-28 15:40:46,702 INFO L290 TraceCheckUtils]: 125: Hoare triple {212778#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {212778#false} is VALID [2022-04-28 15:40:46,702 INFO L290 TraceCheckUtils]: 126: Hoare triple {212778#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {212778#false} is VALID [2022-04-28 15:40:46,703 INFO L290 TraceCheckUtils]: 127: Hoare triple {212778#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {212778#false} is VALID [2022-04-28 15:40:46,703 INFO L290 TraceCheckUtils]: 128: Hoare triple {212778#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {212778#false} is VALID [2022-04-28 15:40:46,703 INFO L290 TraceCheckUtils]: 129: Hoare triple {212778#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {212778#false} is VALID [2022-04-28 15:40:46,703 INFO L290 TraceCheckUtils]: 130: Hoare triple {212778#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {212778#false} is VALID [2022-04-28 15:40:46,703 INFO L290 TraceCheckUtils]: 131: Hoare triple {212778#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {212778#false} is VALID [2022-04-28 15:40:46,703 INFO L290 TraceCheckUtils]: 132: Hoare triple {212778#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {212778#false} is VALID [2022-04-28 15:40:46,703 INFO L290 TraceCheckUtils]: 133: Hoare triple {212778#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {212778#false} is VALID [2022-04-28 15:40:46,703 INFO L290 TraceCheckUtils]: 134: Hoare triple {212778#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {212778#false} is VALID [2022-04-28 15:40:46,703 INFO L290 TraceCheckUtils]: 135: Hoare triple {212778#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {212778#false} is VALID [2022-04-28 15:40:46,703 INFO L290 TraceCheckUtils]: 136: Hoare triple {212778#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {212778#false} is VALID [2022-04-28 15:40:46,703 INFO L290 TraceCheckUtils]: 137: Hoare triple {212778#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {212778#false} is VALID [2022-04-28 15:40:46,703 INFO L290 TraceCheckUtils]: 138: Hoare triple {212778#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {212778#false} is VALID [2022-04-28 15:40:46,703 INFO L290 TraceCheckUtils]: 139: Hoare triple {212778#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {212778#false} is VALID [2022-04-28 15:40:46,703 INFO L290 TraceCheckUtils]: 140: Hoare triple {212778#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {212778#false} is VALID [2022-04-28 15:40:46,703 INFO L290 TraceCheckUtils]: 141: Hoare triple {212778#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {212778#false} is VALID [2022-04-28 15:40:46,704 INFO L290 TraceCheckUtils]: 142: Hoare triple {212778#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {212778#false} is VALID [2022-04-28 15:40:46,704 INFO L290 TraceCheckUtils]: 143: Hoare triple {212778#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {212778#false} is VALID [2022-04-28 15:40:46,704 INFO L290 TraceCheckUtils]: 144: Hoare triple {212778#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {212778#false} is VALID [2022-04-28 15:40:46,704 INFO L290 TraceCheckUtils]: 145: Hoare triple {212778#false} assume 8448 == #t~mem68;havoc #t~mem68; {212778#false} is VALID [2022-04-28 15:40:46,704 INFO L290 TraceCheckUtils]: 146: Hoare triple {212778#false} assume !(~num1~0 > 0); {212778#false} is VALID [2022-04-28 15:40:46,704 INFO L290 TraceCheckUtils]: 147: Hoare triple {212778#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem133 := read~int(#t~mem132.base, 904 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 72 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {212778#false} is VALID [2022-04-28 15:40:46,704 INFO L290 TraceCheckUtils]: 148: Hoare triple {212778#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {212778#false} is VALID [2022-04-28 15:40:46,704 INFO L290 TraceCheckUtils]: 149: Hoare triple {212778#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {212778#false} is VALID [2022-04-28 15:40:46,704 INFO L290 TraceCheckUtils]: 150: Hoare triple {212778#false} ~skip~0 := 0; {212778#false} is VALID [2022-04-28 15:40:46,704 INFO L290 TraceCheckUtils]: 151: Hoare triple {212778#false} assume !false; {212778#false} is VALID [2022-04-28 15:40:46,704 INFO L290 TraceCheckUtils]: 152: Hoare triple {212778#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {212778#false} is VALID [2022-04-28 15:40:46,704 INFO L290 TraceCheckUtils]: 153: Hoare triple {212778#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {212778#false} is VALID [2022-04-28 15:40:46,704 INFO L290 TraceCheckUtils]: 154: Hoare triple {212778#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {212778#false} is VALID [2022-04-28 15:40:46,704 INFO L290 TraceCheckUtils]: 155: Hoare triple {212778#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {212778#false} is VALID [2022-04-28 15:40:46,704 INFO L290 TraceCheckUtils]: 156: Hoare triple {212778#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {212778#false} is VALID [2022-04-28 15:40:46,705 INFO L290 TraceCheckUtils]: 157: Hoare triple {212778#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {212778#false} is VALID [2022-04-28 15:40:46,705 INFO L290 TraceCheckUtils]: 158: Hoare triple {212778#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {212778#false} is VALID [2022-04-28 15:40:46,705 INFO L290 TraceCheckUtils]: 159: Hoare triple {212778#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {212778#false} is VALID [2022-04-28 15:40:46,705 INFO L290 TraceCheckUtils]: 160: Hoare triple {212778#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {212778#false} is VALID [2022-04-28 15:40:46,705 INFO L290 TraceCheckUtils]: 161: Hoare triple {212778#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {212778#false} is VALID [2022-04-28 15:40:46,705 INFO L290 TraceCheckUtils]: 162: Hoare triple {212778#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {212778#false} is VALID [2022-04-28 15:40:46,705 INFO L290 TraceCheckUtils]: 163: Hoare triple {212778#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {212778#false} is VALID [2022-04-28 15:40:46,705 INFO L290 TraceCheckUtils]: 164: Hoare triple {212778#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {212778#false} is VALID [2022-04-28 15:40:46,705 INFO L290 TraceCheckUtils]: 165: Hoare triple {212778#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {212778#false} is VALID [2022-04-28 15:40:46,705 INFO L290 TraceCheckUtils]: 166: Hoare triple {212778#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {212778#false} is VALID [2022-04-28 15:40:46,705 INFO L290 TraceCheckUtils]: 167: Hoare triple {212778#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {212778#false} is VALID [2022-04-28 15:40:46,705 INFO L290 TraceCheckUtils]: 168: Hoare triple {212778#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {212778#false} is VALID [2022-04-28 15:40:46,705 INFO L290 TraceCheckUtils]: 169: Hoare triple {212778#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {212778#false} is VALID [2022-04-28 15:40:46,705 INFO L290 TraceCheckUtils]: 170: Hoare triple {212778#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {212778#false} is VALID [2022-04-28 15:40:46,705 INFO L290 TraceCheckUtils]: 171: Hoare triple {212778#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {212778#false} is VALID [2022-04-28 15:40:46,705 INFO L290 TraceCheckUtils]: 172: Hoare triple {212778#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {212778#false} is VALID [2022-04-28 15:40:46,706 INFO L290 TraceCheckUtils]: 173: Hoare triple {212778#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {212778#false} is VALID [2022-04-28 15:40:46,706 INFO L290 TraceCheckUtils]: 174: Hoare triple {212778#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {212778#false} is VALID [2022-04-28 15:40:46,706 INFO L290 TraceCheckUtils]: 175: Hoare triple {212778#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {212778#false} is VALID [2022-04-28 15:40:46,706 INFO L290 TraceCheckUtils]: 176: Hoare triple {212778#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {212778#false} is VALID [2022-04-28 15:40:46,706 INFO L290 TraceCheckUtils]: 177: Hoare triple {212778#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {212778#false} is VALID [2022-04-28 15:40:46,706 INFO L290 TraceCheckUtils]: 178: Hoare triple {212778#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {212778#false} is VALID [2022-04-28 15:40:46,706 INFO L290 TraceCheckUtils]: 179: Hoare triple {212778#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {212778#false} is VALID [2022-04-28 15:40:46,706 INFO L290 TraceCheckUtils]: 180: Hoare triple {212778#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {212778#false} is VALID [2022-04-28 15:40:46,706 INFO L290 TraceCheckUtils]: 181: Hoare triple {212778#false} assume 8640 == #t~mem75;havoc #t~mem75; {212778#false} is VALID [2022-04-28 15:40:46,706 INFO L290 TraceCheckUtils]: 182: Hoare triple {212778#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {212778#false} is VALID [2022-04-28 15:40:46,706 INFO L290 TraceCheckUtils]: 183: Hoare triple {212778#false} assume !(4 == ~blastFlag~0); {212778#false} is VALID [2022-04-28 15:40:46,706 INFO L290 TraceCheckUtils]: 184: Hoare triple {212778#false} assume !(7 == ~blastFlag~0); {212778#false} is VALID [2022-04-28 15:40:46,706 INFO L290 TraceCheckUtils]: 185: Hoare triple {212778#false} assume !(10 == ~blastFlag~0); {212778#false} is VALID [2022-04-28 15:40:46,706 INFO L290 TraceCheckUtils]: 186: Hoare triple {212778#false} assume !false; {212778#false} is VALID [2022-04-28 15:40:46,707 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-28 15:40:46,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:40:46,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357175454] [2022-04-28 15:40:46,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357175454] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:40:46,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:40:46,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:40:46,707 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:40:46,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [285388897] [2022-04-28 15:40:46,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [285388897] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:40:46,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:40:46,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:40:46,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846398196] [2022-04-28 15:40:46,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:40:46,708 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 187 [2022-04-28 15:40:46,708 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:40:46,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:40:46,794 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:40:46,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:40:46,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:40:46,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:40:46,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:40:46,794 INFO L87 Difference]: Start difference. First operand 2391 states and 3443 transitions. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:40:49,003 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:40:51,007 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:40:52,820 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-28 15:40:54,824 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:40:57,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:40:57,091 INFO L93 Difference]: Finished difference Result 4855 states and 6995 transitions. [2022-04-28 15:40:57,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:40:57,091 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 187 [2022-04-28 15:40:57,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:40:57,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:40:57,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 530 transitions. [2022-04-28 15:40:57,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:40:57,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 530 transitions. [2022-04-28 15:40:57,095 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 530 transitions. [2022-04-28 15:40:57,425 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 530 edges. 530 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:40:57,679 INFO L225 Difference]: With dead ends: 4855 [2022-04-28 15:40:57,679 INFO L226 Difference]: Without dead ends: 2492 [2022-04-28 15:40:57,681 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-28 15:40:57,681 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 66 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:40:57,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 592 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 528 Invalid, 2 Unknown, 0 Unchecked, 7.0s Time] [2022-04-28 15:40:57,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2492 states. [2022-04-28 15:40:57,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2492 to 2391. [2022-04-28 15:40:57,848 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:40:57,851 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2492 states. Second operand has 2391 states, 2386 states have (on average 1.4400670578373846) internal successors, (3436), 2386 states have internal predecessors, (3436), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:40:57,853 INFO L74 IsIncluded]: Start isIncluded. First operand 2492 states. Second operand has 2391 states, 2386 states have (on average 1.4400670578373846) internal successors, (3436), 2386 states have internal predecessors, (3436), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:40:57,854 INFO L87 Difference]: Start difference. First operand 2492 states. Second operand has 2391 states, 2386 states have (on average 1.4400670578373846) internal successors, (3436), 2386 states have internal predecessors, (3436), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:40:58,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:40:58,000 INFO L93 Difference]: Finished difference Result 2492 states and 3581 transitions. [2022-04-28 15:40:58,000 INFO L276 IsEmpty]: Start isEmpty. Operand 2492 states and 3581 transitions. [2022-04-28 15:40:58,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:40:58,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:40:58,004 INFO L74 IsIncluded]: Start isIncluded. First operand has 2391 states, 2386 states have (on average 1.4400670578373846) internal successors, (3436), 2386 states have internal predecessors, (3436), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2492 states. [2022-04-28 15:40:58,006 INFO L87 Difference]: Start difference. First operand has 2391 states, 2386 states have (on average 1.4400670578373846) internal successors, (3436), 2386 states have internal predecessors, (3436), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2492 states. [2022-04-28 15:40:58,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:40:58,152 INFO L93 Difference]: Finished difference Result 2492 states and 3581 transitions. [2022-04-28 15:40:58,152 INFO L276 IsEmpty]: Start isEmpty. Operand 2492 states and 3581 transitions. [2022-04-28 15:40:58,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:40:58,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:40:58,154 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:40:58,154 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:40:58,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2391 states, 2386 states have (on average 1.4400670578373846) internal successors, (3436), 2386 states have internal predecessors, (3436), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:40:58,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2391 states to 2391 states and 3440 transitions. [2022-04-28 15:40:58,405 INFO L78 Accepts]: Start accepts. Automaton has 2391 states and 3440 transitions. Word has length 187 [2022-04-28 15:40:58,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:40:58,406 INFO L495 AbstractCegarLoop]: Abstraction has 2391 states and 3440 transitions. [2022-04-28 15:40:58,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:40:58,406 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2391 states and 3440 transitions. [2022-04-28 15:41:01,543 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3440 edges. 3440 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:41:01,543 INFO L276 IsEmpty]: Start isEmpty. Operand 2391 states and 3440 transitions. [2022-04-28 15:41:01,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-04-28 15:41:01,546 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:41:01,546 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:41:01,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-04-28 15:41:01,546 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:41:01,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:41:01,546 INFO L85 PathProgramCache]: Analyzing trace with hash 335353283, now seen corresponding path program 1 times [2022-04-28 15:41:01,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:41:01,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1994810571] [2022-04-28 15:41:01,638 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:41:01,638 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:41:01,638 INFO L85 PathProgramCache]: Analyzing trace with hash 335353283, now seen corresponding path program 2 times [2022-04-28 15:41:01,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:41:01,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410329462] [2022-04-28 15:41:01,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:41:01,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:41:01,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:41:01,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:41:01,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:41:01,746 INFO L290 TraceCheckUtils]: 0: Hoare triple {232272#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {232265#true} is VALID [2022-04-28 15:41:01,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {232265#true} assume true; {232265#true} is VALID [2022-04-28 15:41:01,746 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {232265#true} {232265#true} #703#return; {232265#true} is VALID [2022-04-28 15:41:01,747 INFO L272 TraceCheckUtils]: 0: Hoare triple {232265#true} call ULTIMATE.init(); {232272#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-28 15:41:01,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {232272#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {232265#true} is VALID [2022-04-28 15:41:01,747 INFO L290 TraceCheckUtils]: 2: Hoare triple {232265#true} assume true; {232265#true} is VALID [2022-04-28 15:41:01,747 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {232265#true} {232265#true} #703#return; {232265#true} is VALID [2022-04-28 15:41:01,747 INFO L272 TraceCheckUtils]: 4: Hoare triple {232265#true} call #t~ret161 := main(); {232265#true} is VALID [2022-04-28 15:41:01,747 INFO L290 TraceCheckUtils]: 5: Hoare triple {232265#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {232265#true} is VALID [2022-04-28 15:41:01,747 INFO L290 TraceCheckUtils]: 6: Hoare triple {232265#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {232265#true} is VALID [2022-04-28 15:41:01,747 INFO L272 TraceCheckUtils]: 7: Hoare triple {232265#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {232265#true} is VALID [2022-04-28 15:41:01,748 INFO L290 TraceCheckUtils]: 8: Hoare triple {232265#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {232265#true} is VALID [2022-04-28 15:41:01,748 INFO L290 TraceCheckUtils]: 9: Hoare triple {232265#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {232265#true} is VALID [2022-04-28 15:41:01,748 INFO L290 TraceCheckUtils]: 10: Hoare triple {232265#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {232265#true} is VALID [2022-04-28 15:41:01,748 INFO L290 TraceCheckUtils]: 11: Hoare triple {232265#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {232265#true} is VALID [2022-04-28 15:41:01,748 INFO L290 TraceCheckUtils]: 12: Hoare triple {232265#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {232265#true} is VALID [2022-04-28 15:41:01,748 INFO L290 TraceCheckUtils]: 13: Hoare triple {232265#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {232265#true} is VALID [2022-04-28 15:41:01,748 INFO L290 TraceCheckUtils]: 14: Hoare triple {232265#true} assume !false; {232265#true} is VALID [2022-04-28 15:41:01,748 INFO L290 TraceCheckUtils]: 15: Hoare triple {232265#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {232265#true} is VALID [2022-04-28 15:41:01,748 INFO L290 TraceCheckUtils]: 16: Hoare triple {232265#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {232265#true} is VALID [2022-04-28 15:41:01,748 INFO L290 TraceCheckUtils]: 17: Hoare triple {232265#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {232265#true} is VALID [2022-04-28 15:41:01,748 INFO L290 TraceCheckUtils]: 18: Hoare triple {232265#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {232265#true} is VALID [2022-04-28 15:41:01,748 INFO L290 TraceCheckUtils]: 19: Hoare triple {232265#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {232265#true} is VALID [2022-04-28 15:41:01,748 INFO L290 TraceCheckUtils]: 20: Hoare triple {232265#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {232265#true} is VALID [2022-04-28 15:41:01,748 INFO L290 TraceCheckUtils]: 21: Hoare triple {232265#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {232265#true} is VALID [2022-04-28 15:41:01,748 INFO L290 TraceCheckUtils]: 22: Hoare triple {232265#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {232265#true} is VALID [2022-04-28 15:41:01,749 INFO L290 TraceCheckUtils]: 23: Hoare triple {232265#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {232265#true} is VALID [2022-04-28 15:41:01,749 INFO L290 TraceCheckUtils]: 24: Hoare triple {232265#true} assume 8464 == #t~mem55;havoc #t~mem55; {232265#true} is VALID [2022-04-28 15:41:01,749 INFO L290 TraceCheckUtils]: 25: Hoare triple {232265#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {232265#true} is VALID [2022-04-28 15:41:01,749 INFO L290 TraceCheckUtils]: 26: Hoare triple {232265#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {232265#true} is VALID [2022-04-28 15:41:01,749 INFO L290 TraceCheckUtils]: 27: Hoare triple {232265#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {232265#true} is VALID [2022-04-28 15:41:01,749 INFO L290 TraceCheckUtils]: 28: Hoare triple {232265#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {232265#true} is VALID [2022-04-28 15:41:01,749 INFO L290 TraceCheckUtils]: 29: Hoare triple {232265#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {232265#true} is VALID [2022-04-28 15:41:01,749 INFO L290 TraceCheckUtils]: 30: Hoare triple {232265#true} ~skip~0 := 0; {232265#true} is VALID [2022-04-28 15:41:01,749 INFO L290 TraceCheckUtils]: 31: Hoare triple {232265#true} assume !false; {232265#true} is VALID [2022-04-28 15:41:01,749 INFO L290 TraceCheckUtils]: 32: Hoare triple {232265#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {232265#true} is VALID [2022-04-28 15:41:01,749 INFO L290 TraceCheckUtils]: 33: Hoare triple {232265#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {232265#true} is VALID [2022-04-28 15:41:01,749 INFO L290 TraceCheckUtils]: 34: Hoare triple {232265#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {232265#true} is VALID [2022-04-28 15:41:01,749 INFO L290 TraceCheckUtils]: 35: Hoare triple {232265#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {232265#true} is VALID [2022-04-28 15:41:01,749 INFO L290 TraceCheckUtils]: 36: Hoare triple {232265#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {232265#true} is VALID [2022-04-28 15:41:01,749 INFO L290 TraceCheckUtils]: 37: Hoare triple {232265#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {232265#true} is VALID [2022-04-28 15:41:01,750 INFO L290 TraceCheckUtils]: 38: Hoare triple {232265#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {232265#true} is VALID [2022-04-28 15:41:01,750 INFO L290 TraceCheckUtils]: 39: Hoare triple {232265#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {232265#true} is VALID [2022-04-28 15:41:01,750 INFO L290 TraceCheckUtils]: 40: Hoare triple {232265#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {232265#true} is VALID [2022-04-28 15:41:01,750 INFO L290 TraceCheckUtils]: 41: Hoare triple {232265#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {232265#true} is VALID [2022-04-28 15:41:01,750 INFO L290 TraceCheckUtils]: 42: Hoare triple {232265#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {232265#true} is VALID [2022-04-28 15:41:01,750 INFO L290 TraceCheckUtils]: 43: Hoare triple {232265#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {232265#true} is VALID [2022-04-28 15:41:01,750 INFO L290 TraceCheckUtils]: 44: Hoare triple {232265#true} assume 8496 == #t~mem58;havoc #t~mem58; {232265#true} is VALID [2022-04-28 15:41:01,750 INFO L290 TraceCheckUtils]: 45: Hoare triple {232265#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {232265#true} is VALID [2022-04-28 15:41:01,750 INFO L290 TraceCheckUtils]: 46: Hoare triple {232265#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {232265#true} is VALID [2022-04-28 15:41:01,750 INFO L290 TraceCheckUtils]: 47: Hoare triple {232265#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {232265#true} is VALID [2022-04-28 15:41:01,750 INFO L290 TraceCheckUtils]: 48: Hoare triple {232265#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {232265#true} is VALID [2022-04-28 15:41:01,750 INFO L290 TraceCheckUtils]: 49: Hoare triple {232265#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {232265#true} is VALID [2022-04-28 15:41:01,750 INFO L290 TraceCheckUtils]: 50: Hoare triple {232265#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {232265#true} is VALID [2022-04-28 15:41:01,750 INFO L290 TraceCheckUtils]: 51: Hoare triple {232265#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {232265#true} is VALID [2022-04-28 15:41:01,750 INFO L290 TraceCheckUtils]: 52: Hoare triple {232265#true} ~skip~0 := 0; {232265#true} is VALID [2022-04-28 15:41:01,751 INFO L290 TraceCheckUtils]: 53: Hoare triple {232265#true} assume !false; {232265#true} is VALID [2022-04-28 15:41:01,751 INFO L290 TraceCheckUtils]: 54: Hoare triple {232265#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {232265#true} is VALID [2022-04-28 15:41:01,751 INFO L290 TraceCheckUtils]: 55: Hoare triple {232265#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {232265#true} is VALID [2022-04-28 15:41:01,751 INFO L290 TraceCheckUtils]: 56: Hoare triple {232265#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {232265#true} is VALID [2022-04-28 15:41:01,751 INFO L290 TraceCheckUtils]: 57: Hoare triple {232265#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {232265#true} is VALID [2022-04-28 15:41:01,751 INFO L290 TraceCheckUtils]: 58: Hoare triple {232265#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {232265#true} is VALID [2022-04-28 15:41:01,751 INFO L290 TraceCheckUtils]: 59: Hoare triple {232265#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {232265#true} is VALID [2022-04-28 15:41:01,751 INFO L290 TraceCheckUtils]: 60: Hoare triple {232265#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {232265#true} is VALID [2022-04-28 15:41:01,751 INFO L290 TraceCheckUtils]: 61: Hoare triple {232265#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {232265#true} is VALID [2022-04-28 15:41:01,751 INFO L290 TraceCheckUtils]: 62: Hoare triple {232265#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {232265#true} is VALID [2022-04-28 15:41:01,751 INFO L290 TraceCheckUtils]: 63: Hoare triple {232265#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {232265#true} is VALID [2022-04-28 15:41:01,751 INFO L290 TraceCheckUtils]: 64: Hoare triple {232265#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {232265#true} is VALID [2022-04-28 15:41:01,751 INFO L290 TraceCheckUtils]: 65: Hoare triple {232265#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {232265#true} is VALID [2022-04-28 15:41:01,751 INFO L290 TraceCheckUtils]: 66: Hoare triple {232265#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {232265#true} is VALID [2022-04-28 15:41:01,751 INFO L290 TraceCheckUtils]: 67: Hoare triple {232265#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {232265#true} is VALID [2022-04-28 15:41:01,752 INFO L290 TraceCheckUtils]: 68: Hoare triple {232265#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {232265#true} is VALID [2022-04-28 15:41:01,752 INFO L290 TraceCheckUtils]: 69: Hoare triple {232265#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {232265#true} is VALID [2022-04-28 15:41:01,752 INFO L290 TraceCheckUtils]: 70: Hoare triple {232265#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {232265#true} is VALID [2022-04-28 15:41:01,752 INFO L290 TraceCheckUtils]: 71: Hoare triple {232265#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {232265#true} is VALID [2022-04-28 15:41:01,752 INFO L290 TraceCheckUtils]: 72: Hoare triple {232265#true} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {232265#true} is VALID [2022-04-28 15:41:01,752 INFO L290 TraceCheckUtils]: 73: Hoare triple {232265#true} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {232265#true} is VALID [2022-04-28 15:41:01,752 INFO L290 TraceCheckUtils]: 74: Hoare triple {232265#true} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {232265#true} is VALID [2022-04-28 15:41:01,752 INFO L290 TraceCheckUtils]: 75: Hoare triple {232265#true} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {232265#true} is VALID [2022-04-28 15:41:01,752 INFO L290 TraceCheckUtils]: 76: Hoare triple {232265#true} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {232265#true} is VALID [2022-04-28 15:41:01,752 INFO L290 TraceCheckUtils]: 77: Hoare triple {232265#true} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {232265#true} is VALID [2022-04-28 15:41:01,752 INFO L290 TraceCheckUtils]: 78: Hoare triple {232265#true} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {232265#true} is VALID [2022-04-28 15:41:01,752 INFO L290 TraceCheckUtils]: 79: Hoare triple {232265#true} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {232265#true} is VALID [2022-04-28 15:41:01,752 INFO L290 TraceCheckUtils]: 80: Hoare triple {232265#true} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {232265#true} is VALID [2022-04-28 15:41:01,752 INFO L290 TraceCheckUtils]: 81: Hoare triple {232265#true} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {232265#true} is VALID [2022-04-28 15:41:01,752 INFO L290 TraceCheckUtils]: 82: Hoare triple {232265#true} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {232265#true} is VALID [2022-04-28 15:41:01,752 INFO L290 TraceCheckUtils]: 83: Hoare triple {232265#true} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {232265#true} is VALID [2022-04-28 15:41:01,753 INFO L290 TraceCheckUtils]: 84: Hoare triple {232265#true} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {232265#true} is VALID [2022-04-28 15:41:01,753 INFO L290 TraceCheckUtils]: 85: Hoare triple {232265#true} assume 8656 == #t~mem77;havoc #t~mem77; {232265#true} is VALID [2022-04-28 15:41:01,753 INFO L290 TraceCheckUtils]: 86: Hoare triple {232265#true} call #t~mem140.base, #t~mem140.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem141.base, #t~mem141.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem142.base, #t~mem142.offset := read~$Pointer$(#t~mem141.base, 888 + #t~mem141.offset, 8);call write~$Pointer$(#t~mem142.base, #t~mem142.offset, #t~mem140.base, 192 + #t~mem140.offset, 8);havoc #t~mem140.base, #t~mem140.offset;havoc #t~mem141.base, #t~mem141.offset;havoc #t~mem142.base, #t~mem142.offset; {232265#true} is VALID [2022-04-28 15:41:01,753 INFO L290 TraceCheckUtils]: 87: Hoare triple {232265#true} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {232265#true} is VALID [2022-04-28 15:41:01,753 INFO L290 TraceCheckUtils]: 88: Hoare triple {232265#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {232265#true} is VALID [2022-04-28 15:41:01,754 INFO L290 TraceCheckUtils]: 89: Hoare triple {232265#true} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {232270#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:41:01,754 INFO L290 TraceCheckUtils]: 90: Hoare triple {232270#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == ~tmp___10~0); {232270#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:41:01,754 INFO L290 TraceCheckUtils]: 91: Hoare triple {232270#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {232270#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:41:01,755 INFO L290 TraceCheckUtils]: 92: Hoare triple {232270#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {232270#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:41:01,755 INFO L290 TraceCheckUtils]: 93: Hoare triple {232270#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} ~skip~0 := 0; {232270#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:41:01,755 INFO L290 TraceCheckUtils]: 94: Hoare triple {232270#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {232270#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:41:01,756 INFO L290 TraceCheckUtils]: 95: Hoare triple {232270#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {232270#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:41:01,756 INFO L290 TraceCheckUtils]: 96: Hoare triple {232270#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {232270#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:41:01,756 INFO L290 TraceCheckUtils]: 97: Hoare triple {232270#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {232270#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:41:01,757 INFO L290 TraceCheckUtils]: 98: Hoare triple {232270#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {232270#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:41:01,757 INFO L290 TraceCheckUtils]: 99: Hoare triple {232270#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {232270#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:41:01,757 INFO L290 TraceCheckUtils]: 100: Hoare triple {232270#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {232270#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:41:01,757 INFO L290 TraceCheckUtils]: 101: Hoare triple {232270#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {232270#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:41:01,758 INFO L290 TraceCheckUtils]: 102: Hoare triple {232270#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {232270#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:41:01,758 INFO L290 TraceCheckUtils]: 103: Hoare triple {232270#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {232270#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:41:01,758 INFO L290 TraceCheckUtils]: 104: Hoare triple {232270#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {232270#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:41:01,759 INFO L290 TraceCheckUtils]: 105: Hoare triple {232270#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {232270#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:41:01,759 INFO L290 TraceCheckUtils]: 106: Hoare triple {232270#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {232270#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:41:01,759 INFO L290 TraceCheckUtils]: 107: Hoare triple {232270#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {232270#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:41:01,760 INFO L290 TraceCheckUtils]: 108: Hoare triple {232270#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {232270#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:41:01,760 INFO L290 TraceCheckUtils]: 109: Hoare triple {232270#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {232270#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:41:01,760 INFO L290 TraceCheckUtils]: 110: Hoare triple {232270#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {232270#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:41:01,761 INFO L290 TraceCheckUtils]: 111: Hoare triple {232270#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {232270#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:41:01,761 INFO L290 TraceCheckUtils]: 112: Hoare triple {232270#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {232270#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:41:01,761 INFO L290 TraceCheckUtils]: 113: Hoare triple {232270#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {232271#(not (= |ssl3_accept_#t~mem65| 8545))} is VALID [2022-04-28 15:41:01,762 INFO L290 TraceCheckUtils]: 114: Hoare triple {232271#(not (= |ssl3_accept_#t~mem65| 8545))} assume 8545 == #t~mem65;havoc #t~mem65; {232266#false} is VALID [2022-04-28 15:41:01,762 INFO L290 TraceCheckUtils]: 115: Hoare triple {232266#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {232266#false} is VALID [2022-04-28 15:41:01,762 INFO L290 TraceCheckUtils]: 116: Hoare triple {232266#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {232266#false} is VALID [2022-04-28 15:41:01,762 INFO L290 TraceCheckUtils]: 117: Hoare triple {232266#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {232266#false} is VALID [2022-04-28 15:41:01,762 INFO L290 TraceCheckUtils]: 118: Hoare triple {232266#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {232266#false} is VALID [2022-04-28 15:41:01,762 INFO L290 TraceCheckUtils]: 119: Hoare triple {232266#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {232266#false} is VALID [2022-04-28 15:41:01,762 INFO L290 TraceCheckUtils]: 120: Hoare triple {232266#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #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; {232266#false} is VALID [2022-04-28 15:41:01,762 INFO L290 TraceCheckUtils]: 121: Hoare triple {232266#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 72 + ~s.offset, 4);call #t~mem128.base, #t~mem128.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8576, #t~mem128.base, 904 + #t~mem128.offset, 4);havoc #t~mem128.base, #t~mem128.offset;call write~int(0, ~s.base, 88 + ~s.offset, 4); {232266#false} is VALID [2022-04-28 15:41:01,762 INFO L290 TraceCheckUtils]: 122: Hoare triple {232266#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {232266#false} is VALID [2022-04-28 15:41:01,762 INFO L290 TraceCheckUtils]: 123: Hoare triple {232266#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {232266#false} is VALID [2022-04-28 15:41:01,762 INFO L290 TraceCheckUtils]: 124: Hoare triple {232266#false} ~skip~0 := 0; {232266#false} is VALID [2022-04-28 15:41:01,763 INFO L290 TraceCheckUtils]: 125: Hoare triple {232266#false} assume !false; {232266#false} is VALID [2022-04-28 15:41:01,763 INFO L290 TraceCheckUtils]: 126: Hoare triple {232266#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {232266#false} is VALID [2022-04-28 15:41:01,763 INFO L290 TraceCheckUtils]: 127: Hoare triple {232266#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {232266#false} is VALID [2022-04-28 15:41:01,763 INFO L290 TraceCheckUtils]: 128: Hoare triple {232266#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {232266#false} is VALID [2022-04-28 15:41:01,763 INFO L290 TraceCheckUtils]: 129: Hoare triple {232266#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {232266#false} is VALID [2022-04-28 15:41:01,763 INFO L290 TraceCheckUtils]: 130: Hoare triple {232266#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {232266#false} is VALID [2022-04-28 15:41:01,763 INFO L290 TraceCheckUtils]: 131: Hoare triple {232266#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {232266#false} is VALID [2022-04-28 15:41:01,763 INFO L290 TraceCheckUtils]: 132: Hoare triple {232266#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {232266#false} is VALID [2022-04-28 15:41:01,763 INFO L290 TraceCheckUtils]: 133: Hoare triple {232266#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {232266#false} is VALID [2022-04-28 15:41:01,763 INFO L290 TraceCheckUtils]: 134: Hoare triple {232266#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {232266#false} is VALID [2022-04-28 15:41:01,763 INFO L290 TraceCheckUtils]: 135: Hoare triple {232266#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {232266#false} is VALID [2022-04-28 15:41:01,763 INFO L290 TraceCheckUtils]: 136: Hoare triple {232266#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {232266#false} is VALID [2022-04-28 15:41:01,763 INFO L290 TraceCheckUtils]: 137: Hoare triple {232266#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {232266#false} is VALID [2022-04-28 15:41:01,763 INFO L290 TraceCheckUtils]: 138: Hoare triple {232266#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {232266#false} is VALID [2022-04-28 15:41:01,763 INFO L290 TraceCheckUtils]: 139: Hoare triple {232266#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {232266#false} is VALID [2022-04-28 15:41:01,764 INFO L290 TraceCheckUtils]: 140: Hoare triple {232266#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {232266#false} is VALID [2022-04-28 15:41:01,764 INFO L290 TraceCheckUtils]: 141: Hoare triple {232266#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {232266#false} is VALID [2022-04-28 15:41:01,764 INFO L290 TraceCheckUtils]: 142: Hoare triple {232266#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {232266#false} is VALID [2022-04-28 15:41:01,764 INFO L290 TraceCheckUtils]: 143: Hoare triple {232266#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {232266#false} is VALID [2022-04-28 15:41:01,764 INFO L290 TraceCheckUtils]: 144: Hoare triple {232266#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {232266#false} is VALID [2022-04-28 15:41:01,764 INFO L290 TraceCheckUtils]: 145: Hoare triple {232266#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {232266#false} is VALID [2022-04-28 15:41:01,764 INFO L290 TraceCheckUtils]: 146: Hoare triple {232266#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {232266#false} is VALID [2022-04-28 15:41:01,764 INFO L290 TraceCheckUtils]: 147: Hoare triple {232266#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {232266#false} is VALID [2022-04-28 15:41:01,764 INFO L290 TraceCheckUtils]: 148: Hoare triple {232266#false} assume 8448 == #t~mem68;havoc #t~mem68; {232266#false} is VALID [2022-04-28 15:41:01,764 INFO L290 TraceCheckUtils]: 149: Hoare triple {232266#false} assume !(~num1~0 > 0); {232266#false} is VALID [2022-04-28 15:41:01,764 INFO L290 TraceCheckUtils]: 150: Hoare triple {232266#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem133 := read~int(#t~mem132.base, 904 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 72 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {232266#false} is VALID [2022-04-28 15:41:01,764 INFO L290 TraceCheckUtils]: 151: Hoare triple {232266#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {232266#false} is VALID [2022-04-28 15:41:01,764 INFO L290 TraceCheckUtils]: 152: Hoare triple {232266#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {232266#false} is VALID [2022-04-28 15:41:01,764 INFO L290 TraceCheckUtils]: 153: Hoare triple {232266#false} ~skip~0 := 0; {232266#false} is VALID [2022-04-28 15:41:01,764 INFO L290 TraceCheckUtils]: 154: Hoare triple {232266#false} assume !false; {232266#false} is VALID [2022-04-28 15:41:01,764 INFO L290 TraceCheckUtils]: 155: Hoare triple {232266#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {232266#false} is VALID [2022-04-28 15:41:01,765 INFO L290 TraceCheckUtils]: 156: Hoare triple {232266#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {232266#false} is VALID [2022-04-28 15:41:01,765 INFO L290 TraceCheckUtils]: 157: Hoare triple {232266#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {232266#false} is VALID [2022-04-28 15:41:01,765 INFO L290 TraceCheckUtils]: 158: Hoare triple {232266#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {232266#false} is VALID [2022-04-28 15:41:01,765 INFO L290 TraceCheckUtils]: 159: Hoare triple {232266#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {232266#false} is VALID [2022-04-28 15:41:01,765 INFO L290 TraceCheckUtils]: 160: Hoare triple {232266#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {232266#false} is VALID [2022-04-28 15:41:01,765 INFO L290 TraceCheckUtils]: 161: Hoare triple {232266#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {232266#false} is VALID [2022-04-28 15:41:01,765 INFO L290 TraceCheckUtils]: 162: Hoare triple {232266#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {232266#false} is VALID [2022-04-28 15:41:01,765 INFO L290 TraceCheckUtils]: 163: Hoare triple {232266#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {232266#false} is VALID [2022-04-28 15:41:01,765 INFO L290 TraceCheckUtils]: 164: Hoare triple {232266#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {232266#false} is VALID [2022-04-28 15:41:01,765 INFO L290 TraceCheckUtils]: 165: Hoare triple {232266#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {232266#false} is VALID [2022-04-28 15:41:01,765 INFO L290 TraceCheckUtils]: 166: Hoare triple {232266#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {232266#false} is VALID [2022-04-28 15:41:01,765 INFO L290 TraceCheckUtils]: 167: Hoare triple {232266#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {232266#false} is VALID [2022-04-28 15:41:01,765 INFO L290 TraceCheckUtils]: 168: Hoare triple {232266#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {232266#false} is VALID [2022-04-28 15:41:01,765 INFO L290 TraceCheckUtils]: 169: Hoare triple {232266#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {232266#false} is VALID [2022-04-28 15:41:01,765 INFO L290 TraceCheckUtils]: 170: Hoare triple {232266#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {232266#false} is VALID [2022-04-28 15:41:01,766 INFO L290 TraceCheckUtils]: 171: Hoare triple {232266#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {232266#false} is VALID [2022-04-28 15:41:01,766 INFO L290 TraceCheckUtils]: 172: Hoare triple {232266#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {232266#false} is VALID [2022-04-28 15:41:01,766 INFO L290 TraceCheckUtils]: 173: Hoare triple {232266#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {232266#false} is VALID [2022-04-28 15:41:01,766 INFO L290 TraceCheckUtils]: 174: Hoare triple {232266#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {232266#false} is VALID [2022-04-28 15:41:01,766 INFO L290 TraceCheckUtils]: 175: Hoare triple {232266#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {232266#false} is VALID [2022-04-28 15:41:01,766 INFO L290 TraceCheckUtils]: 176: Hoare triple {232266#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {232266#false} is VALID [2022-04-28 15:41:01,766 INFO L290 TraceCheckUtils]: 177: Hoare triple {232266#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {232266#false} is VALID [2022-04-28 15:41:01,766 INFO L290 TraceCheckUtils]: 178: Hoare triple {232266#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {232266#false} is VALID [2022-04-28 15:41:01,766 INFO L290 TraceCheckUtils]: 179: Hoare triple {232266#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {232266#false} is VALID [2022-04-28 15:41:01,766 INFO L290 TraceCheckUtils]: 180: Hoare triple {232266#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {232266#false} is VALID [2022-04-28 15:41:01,766 INFO L290 TraceCheckUtils]: 181: Hoare triple {232266#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {232266#false} is VALID [2022-04-28 15:41:01,766 INFO L290 TraceCheckUtils]: 182: Hoare triple {232266#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {232266#false} is VALID [2022-04-28 15:41:01,766 INFO L290 TraceCheckUtils]: 183: Hoare triple {232266#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {232266#false} is VALID [2022-04-28 15:41:01,766 INFO L290 TraceCheckUtils]: 184: Hoare triple {232266#false} assume 8640 == #t~mem75;havoc #t~mem75; {232266#false} is VALID [2022-04-28 15:41:01,766 INFO L290 TraceCheckUtils]: 185: Hoare triple {232266#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {232266#false} is VALID [2022-04-28 15:41:01,767 INFO L290 TraceCheckUtils]: 186: Hoare triple {232266#false} assume !(4 == ~blastFlag~0); {232266#false} is VALID [2022-04-28 15:41:01,767 INFO L290 TraceCheckUtils]: 187: Hoare triple {232266#false} assume !(7 == ~blastFlag~0); {232266#false} is VALID [2022-04-28 15:41:01,767 INFO L290 TraceCheckUtils]: 188: Hoare triple {232266#false} assume !(10 == ~blastFlag~0); {232266#false} is VALID [2022-04-28 15:41:01,767 INFO L290 TraceCheckUtils]: 189: Hoare triple {232266#false} assume !false; {232266#false} is VALID [2022-04-28 15:41:01,767 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-28 15:41:01,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:41:01,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410329462] [2022-04-28 15:41:01,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410329462] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:41:01,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:41:01,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:41:01,768 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:41:01,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1994810571] [2022-04-28 15:41:01,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1994810571] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:41:01,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:41:01,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:41:01,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646863323] [2022-04-28 15:41:01,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:41:01,768 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 190 [2022-04-28 15:41:01,768 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:41:01,768 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 26.8) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:41:01,856 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:41:01,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:41:01,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:41:01,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:41:01,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:41:01,857 INFO L87 Difference]: Start difference. First operand 2391 states and 3440 transitions. Second operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:41:03,473 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:41:08,056 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:41:10,061 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:41:12,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:41:12,410 INFO L93 Difference]: Finished difference Result 4998 states and 7178 transitions. [2022-04-28 15:41:12,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:41:12,410 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 190 [2022-04-28 15:41:12,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:41:12,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:41:12,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 584 transitions. [2022-04-28 15:41:12,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:41:12,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 584 transitions. [2022-04-28 15:41:12,414 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 584 transitions. [2022-04-28 15:41:12,794 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-28 15:41:13,069 INFO L225 Difference]: With dead ends: 4998 [2022-04-28 15:41:13,069 INFO L226 Difference]: Without dead ends: 2635 [2022-04-28 15:41:13,072 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-28 15:41:13,072 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 117 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 56 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-04-28 15:41:13,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 386 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 468 Invalid, 1 Unknown, 0 Unchecked, 5.5s Time] [2022-04-28 15:41:13,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2635 states. [2022-04-28 15:41:13,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2635 to 2391. [2022-04-28 15:41:13,224 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:41:13,227 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2635 states. Second operand has 2391 states, 2386 states have (on average 1.4258172673931266) internal successors, (3402), 2386 states have internal predecessors, (3402), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:41:13,228 INFO L74 IsIncluded]: Start isIncluded. First operand 2635 states. Second operand has 2391 states, 2386 states have (on average 1.4258172673931266) internal successors, (3402), 2386 states have internal predecessors, (3402), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:41:13,230 INFO L87 Difference]: Start difference. First operand 2635 states. Second operand has 2391 states, 2386 states have (on average 1.4258172673931266) internal successors, (3402), 2386 states have internal predecessors, (3402), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:41:13,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:41:13,390 INFO L93 Difference]: Finished difference Result 2635 states and 3736 transitions. [2022-04-28 15:41:13,390 INFO L276 IsEmpty]: Start isEmpty. Operand 2635 states and 3736 transitions. [2022-04-28 15:41:13,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:41:13,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:41:13,394 INFO L74 IsIncluded]: Start isIncluded. First operand has 2391 states, 2386 states have (on average 1.4258172673931266) internal successors, (3402), 2386 states have internal predecessors, (3402), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2635 states. [2022-04-28 15:41:13,396 INFO L87 Difference]: Start difference. First operand has 2391 states, 2386 states have (on average 1.4258172673931266) internal successors, (3402), 2386 states have internal predecessors, (3402), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2635 states. [2022-04-28 15:41:13,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:41:13,558 INFO L93 Difference]: Finished difference Result 2635 states and 3736 transitions. [2022-04-28 15:41:13,558 INFO L276 IsEmpty]: Start isEmpty. Operand 2635 states and 3736 transitions. [2022-04-28 15:41:13,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:41:13,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:41:13,560 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:41:13,560 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:41:13,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2391 states, 2386 states have (on average 1.4258172673931266) internal successors, (3402), 2386 states have internal predecessors, (3402), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:41:13,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2391 states to 2391 states and 3406 transitions. [2022-04-28 15:41:13,819 INFO L78 Accepts]: Start accepts. Automaton has 2391 states and 3406 transitions. Word has length 190 [2022-04-28 15:41:13,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:41:13,819 INFO L495 AbstractCegarLoop]: Abstraction has 2391 states and 3406 transitions. [2022-04-28 15:41:13,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:41:13,820 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2391 states and 3406 transitions. [2022-04-28 15:41:17,129 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3406 edges. 3406 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:41:17,130 INFO L276 IsEmpty]: Start isEmpty. Operand 2391 states and 3406 transitions. [2022-04-28 15:41:17,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2022-04-28 15:41:17,132 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:41:17,132 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-04-28 15:41:17,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-04-28 15:41:17,132 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:41:17,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:41:17,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1210412290, now seen corresponding path program 1 times [2022-04-28 15:41:17,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:41:17,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [425620973] [2022-04-28 15:41:17,262 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:41:17,262 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:41:17,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1210412290, now seen corresponding path program 2 times [2022-04-28 15:41:17,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:41:17,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088726889] [2022-04-28 15:41:17,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:41:17,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:41:17,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:41:17,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:41:17,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:41:17,369 INFO L290 TraceCheckUtils]: 0: Hoare triple {252332#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {252325#true} is VALID [2022-04-28 15:41:17,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {252325#true} assume true; {252325#true} is VALID [2022-04-28 15:41:17,369 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {252325#true} {252325#true} #703#return; {252325#true} is VALID [2022-04-28 15:41:17,370 INFO L272 TraceCheckUtils]: 0: Hoare triple {252325#true} call ULTIMATE.init(); {252332#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-28 15:41:17,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {252332#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {252325#true} is VALID [2022-04-28 15:41:17,370 INFO L290 TraceCheckUtils]: 2: Hoare triple {252325#true} assume true; {252325#true} is VALID [2022-04-28 15:41:17,370 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {252325#true} {252325#true} #703#return; {252325#true} is VALID [2022-04-28 15:41:17,370 INFO L272 TraceCheckUtils]: 4: Hoare triple {252325#true} call #t~ret161 := main(); {252325#true} is VALID [2022-04-28 15:41:17,370 INFO L290 TraceCheckUtils]: 5: Hoare triple {252325#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {252325#true} is VALID [2022-04-28 15:41:17,371 INFO L290 TraceCheckUtils]: 6: Hoare triple {252325#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {252325#true} is VALID [2022-04-28 15:41:17,371 INFO L272 TraceCheckUtils]: 7: Hoare triple {252325#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {252325#true} is VALID [2022-04-28 15:41:17,371 INFO L290 TraceCheckUtils]: 8: Hoare triple {252325#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {252325#true} is VALID [2022-04-28 15:41:17,371 INFO L290 TraceCheckUtils]: 9: Hoare triple {252325#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {252325#true} is VALID [2022-04-28 15:41:17,371 INFO L290 TraceCheckUtils]: 10: Hoare triple {252325#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {252325#true} is VALID [2022-04-28 15:41:17,371 INFO L290 TraceCheckUtils]: 11: Hoare triple {252325#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {252325#true} is VALID [2022-04-28 15:41:17,371 INFO L290 TraceCheckUtils]: 12: Hoare triple {252325#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {252325#true} is VALID [2022-04-28 15:41:17,371 INFO L290 TraceCheckUtils]: 13: Hoare triple {252325#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {252325#true} is VALID [2022-04-28 15:41:17,371 INFO L290 TraceCheckUtils]: 14: Hoare triple {252325#true} assume !false; {252325#true} is VALID [2022-04-28 15:41:17,371 INFO L290 TraceCheckUtils]: 15: Hoare triple {252325#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {252325#true} is VALID [2022-04-28 15:41:17,371 INFO L290 TraceCheckUtils]: 16: Hoare triple {252325#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {252325#true} is VALID [2022-04-28 15:41:17,371 INFO L290 TraceCheckUtils]: 17: Hoare triple {252325#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {252325#true} is VALID [2022-04-28 15:41:17,371 INFO L290 TraceCheckUtils]: 18: Hoare triple {252325#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {252325#true} is VALID [2022-04-28 15:41:17,371 INFO L290 TraceCheckUtils]: 19: Hoare triple {252325#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {252325#true} is VALID [2022-04-28 15:41:17,371 INFO L290 TraceCheckUtils]: 20: Hoare triple {252325#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {252325#true} is VALID [2022-04-28 15:41:17,372 INFO L290 TraceCheckUtils]: 21: Hoare triple {252325#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {252325#true} is VALID [2022-04-28 15:41:17,372 INFO L290 TraceCheckUtils]: 22: Hoare triple {252325#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {252325#true} is VALID [2022-04-28 15:41:17,372 INFO L290 TraceCheckUtils]: 23: Hoare triple {252325#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {252325#true} is VALID [2022-04-28 15:41:17,372 INFO L290 TraceCheckUtils]: 24: Hoare triple {252325#true} assume 8464 == #t~mem55;havoc #t~mem55; {252325#true} is VALID [2022-04-28 15:41:17,372 INFO L290 TraceCheckUtils]: 25: Hoare triple {252325#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {252325#true} is VALID [2022-04-28 15:41:17,372 INFO L290 TraceCheckUtils]: 26: Hoare triple {252325#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {252325#true} is VALID [2022-04-28 15:41:17,372 INFO L290 TraceCheckUtils]: 27: Hoare triple {252325#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {252325#true} is VALID [2022-04-28 15:41:17,372 INFO L290 TraceCheckUtils]: 28: Hoare triple {252325#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {252325#true} is VALID [2022-04-28 15:41:17,372 INFO L290 TraceCheckUtils]: 29: Hoare triple {252325#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {252325#true} is VALID [2022-04-28 15:41:17,372 INFO L290 TraceCheckUtils]: 30: Hoare triple {252325#true} ~skip~0 := 0; {252325#true} is VALID [2022-04-28 15:41:17,372 INFO L290 TraceCheckUtils]: 31: Hoare triple {252325#true} assume !false; {252325#true} is VALID [2022-04-28 15:41:17,372 INFO L290 TraceCheckUtils]: 32: Hoare triple {252325#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {252325#true} is VALID [2022-04-28 15:41:17,372 INFO L290 TraceCheckUtils]: 33: Hoare triple {252325#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {252325#true} is VALID [2022-04-28 15:41:17,372 INFO L290 TraceCheckUtils]: 34: Hoare triple {252325#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {252325#true} is VALID [2022-04-28 15:41:17,372 INFO L290 TraceCheckUtils]: 35: Hoare triple {252325#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {252325#true} is VALID [2022-04-28 15:41:17,373 INFO L290 TraceCheckUtils]: 36: Hoare triple {252325#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {252325#true} is VALID [2022-04-28 15:41:17,373 INFO L290 TraceCheckUtils]: 37: Hoare triple {252325#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {252325#true} is VALID [2022-04-28 15:41:17,373 INFO L290 TraceCheckUtils]: 38: Hoare triple {252325#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {252325#true} is VALID [2022-04-28 15:41:17,373 INFO L290 TraceCheckUtils]: 39: Hoare triple {252325#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {252325#true} is VALID [2022-04-28 15:41:17,373 INFO L290 TraceCheckUtils]: 40: Hoare triple {252325#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {252325#true} is VALID [2022-04-28 15:41:17,373 INFO L290 TraceCheckUtils]: 41: Hoare triple {252325#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {252325#true} is VALID [2022-04-28 15:41:17,373 INFO L290 TraceCheckUtils]: 42: Hoare triple {252325#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {252325#true} is VALID [2022-04-28 15:41:17,373 INFO L290 TraceCheckUtils]: 43: Hoare triple {252325#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {252325#true} is VALID [2022-04-28 15:41:17,373 INFO L290 TraceCheckUtils]: 44: Hoare triple {252325#true} assume 8496 == #t~mem58;havoc #t~mem58; {252325#true} is VALID [2022-04-28 15:41:17,373 INFO L290 TraceCheckUtils]: 45: Hoare triple {252325#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {252325#true} is VALID [2022-04-28 15:41:17,373 INFO L290 TraceCheckUtils]: 46: Hoare triple {252325#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {252325#true} is VALID [2022-04-28 15:41:17,373 INFO L290 TraceCheckUtils]: 47: Hoare triple {252325#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {252325#true} is VALID [2022-04-28 15:41:17,373 INFO L290 TraceCheckUtils]: 48: Hoare triple {252325#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {252325#true} is VALID [2022-04-28 15:41:17,373 INFO L290 TraceCheckUtils]: 49: Hoare triple {252325#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {252325#true} is VALID [2022-04-28 15:41:17,373 INFO L290 TraceCheckUtils]: 50: Hoare triple {252325#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {252325#true} is VALID [2022-04-28 15:41:17,374 INFO L290 TraceCheckUtils]: 51: Hoare triple {252325#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {252325#true} is VALID [2022-04-28 15:41:17,374 INFO L290 TraceCheckUtils]: 52: Hoare triple {252325#true} ~skip~0 := 0; {252325#true} is VALID [2022-04-28 15:41:17,374 INFO L290 TraceCheckUtils]: 53: Hoare triple {252325#true} assume !false; {252325#true} is VALID [2022-04-28 15:41:17,374 INFO L290 TraceCheckUtils]: 54: Hoare triple {252325#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {252325#true} is VALID [2022-04-28 15:41:17,374 INFO L290 TraceCheckUtils]: 55: Hoare triple {252325#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {252325#true} is VALID [2022-04-28 15:41:17,374 INFO L290 TraceCheckUtils]: 56: Hoare triple {252325#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {252325#true} is VALID [2022-04-28 15:41:17,374 INFO L290 TraceCheckUtils]: 57: Hoare triple {252325#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {252325#true} is VALID [2022-04-28 15:41:17,374 INFO L290 TraceCheckUtils]: 58: Hoare triple {252325#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {252325#true} is VALID [2022-04-28 15:41:17,374 INFO L290 TraceCheckUtils]: 59: Hoare triple {252325#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {252325#true} is VALID [2022-04-28 15:41:17,374 INFO L290 TraceCheckUtils]: 60: Hoare triple {252325#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {252325#true} is VALID [2022-04-28 15:41:17,374 INFO L290 TraceCheckUtils]: 61: Hoare triple {252325#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {252325#true} is VALID [2022-04-28 15:41:17,374 INFO L290 TraceCheckUtils]: 62: Hoare triple {252325#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {252325#true} is VALID [2022-04-28 15:41:17,374 INFO L290 TraceCheckUtils]: 63: Hoare triple {252325#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {252325#true} is VALID [2022-04-28 15:41:17,374 INFO L290 TraceCheckUtils]: 64: Hoare triple {252325#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {252325#true} is VALID [2022-04-28 15:41:17,374 INFO L290 TraceCheckUtils]: 65: Hoare triple {252325#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {252325#true} is VALID [2022-04-28 15:41:17,375 INFO L290 TraceCheckUtils]: 66: Hoare triple {252325#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {252325#true} is VALID [2022-04-28 15:41:17,375 INFO L290 TraceCheckUtils]: 67: Hoare triple {252325#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {252325#true} is VALID [2022-04-28 15:41:17,375 INFO L290 TraceCheckUtils]: 68: Hoare triple {252325#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {252325#true} is VALID [2022-04-28 15:41:17,375 INFO L290 TraceCheckUtils]: 69: Hoare triple {252325#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {252325#true} is VALID [2022-04-28 15:41:17,375 INFO L290 TraceCheckUtils]: 70: Hoare triple {252325#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {252325#true} is VALID [2022-04-28 15:41:17,375 INFO L290 TraceCheckUtils]: 71: Hoare triple {252325#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {252325#true} is VALID [2022-04-28 15:41:17,375 INFO L290 TraceCheckUtils]: 72: Hoare triple {252325#true} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {252325#true} is VALID [2022-04-28 15:41:17,375 INFO L290 TraceCheckUtils]: 73: Hoare triple {252325#true} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {252325#true} is VALID [2022-04-28 15:41:17,375 INFO L290 TraceCheckUtils]: 74: Hoare triple {252325#true} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {252325#true} is VALID [2022-04-28 15:41:17,375 INFO L290 TraceCheckUtils]: 75: Hoare triple {252325#true} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {252325#true} is VALID [2022-04-28 15:41:17,375 INFO L290 TraceCheckUtils]: 76: Hoare triple {252325#true} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {252325#true} is VALID [2022-04-28 15:41:17,375 INFO L290 TraceCheckUtils]: 77: Hoare triple {252325#true} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {252325#true} is VALID [2022-04-28 15:41:17,375 INFO L290 TraceCheckUtils]: 78: Hoare triple {252325#true} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {252325#true} is VALID [2022-04-28 15:41:17,375 INFO L290 TraceCheckUtils]: 79: Hoare triple {252325#true} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {252325#true} is VALID [2022-04-28 15:41:17,375 INFO L290 TraceCheckUtils]: 80: Hoare triple {252325#true} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {252325#true} is VALID [2022-04-28 15:41:17,376 INFO L290 TraceCheckUtils]: 81: Hoare triple {252325#true} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {252325#true} is VALID [2022-04-28 15:41:17,376 INFO L290 TraceCheckUtils]: 82: Hoare triple {252325#true} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {252325#true} is VALID [2022-04-28 15:41:17,376 INFO L290 TraceCheckUtils]: 83: Hoare triple {252325#true} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {252325#true} is VALID [2022-04-28 15:41:17,376 INFO L290 TraceCheckUtils]: 84: Hoare triple {252325#true} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {252325#true} is VALID [2022-04-28 15:41:17,376 INFO L290 TraceCheckUtils]: 85: Hoare triple {252325#true} assume 8656 == #t~mem77;havoc #t~mem77; {252325#true} is VALID [2022-04-28 15:41:17,376 INFO L290 TraceCheckUtils]: 86: Hoare triple {252325#true} call #t~mem140.base, #t~mem140.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem141.base, #t~mem141.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem142.base, #t~mem142.offset := read~$Pointer$(#t~mem141.base, 888 + #t~mem141.offset, 8);call write~$Pointer$(#t~mem142.base, #t~mem142.offset, #t~mem140.base, 192 + #t~mem140.offset, 8);havoc #t~mem140.base, #t~mem140.offset;havoc #t~mem141.base, #t~mem141.offset;havoc #t~mem142.base, #t~mem142.offset; {252325#true} is VALID [2022-04-28 15:41:17,376 INFO L290 TraceCheckUtils]: 87: Hoare triple {252325#true} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {252325#true} is VALID [2022-04-28 15:41:17,376 INFO L290 TraceCheckUtils]: 88: Hoare triple {252325#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {252325#true} is VALID [2022-04-28 15:41:17,377 INFO L290 TraceCheckUtils]: 89: Hoare triple {252325#true} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {252330#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:41:17,377 INFO L290 TraceCheckUtils]: 90: Hoare triple {252330#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == ~tmp___10~0); {252330#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:41:17,377 INFO L290 TraceCheckUtils]: 91: Hoare triple {252330#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {252330#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:41:17,378 INFO L290 TraceCheckUtils]: 92: Hoare triple {252330#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {252330#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:41:17,378 INFO L290 TraceCheckUtils]: 93: Hoare triple {252330#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} ~skip~0 := 0; {252330#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:41:17,378 INFO L290 TraceCheckUtils]: 94: Hoare triple {252330#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {252330#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:41:17,379 INFO L290 TraceCheckUtils]: 95: Hoare triple {252330#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {252330#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:41:17,379 INFO L290 TraceCheckUtils]: 96: Hoare triple {252330#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {252330#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:41:17,379 INFO L290 TraceCheckUtils]: 97: Hoare triple {252330#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {252330#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:41:17,380 INFO L290 TraceCheckUtils]: 98: Hoare triple {252330#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {252330#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:41:17,380 INFO L290 TraceCheckUtils]: 99: Hoare triple {252330#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {252330#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:41:17,380 INFO L290 TraceCheckUtils]: 100: Hoare triple {252330#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {252330#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:41:17,381 INFO L290 TraceCheckUtils]: 101: Hoare triple {252330#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {252330#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:41:17,381 INFO L290 TraceCheckUtils]: 102: Hoare triple {252330#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {252330#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:41:17,381 INFO L290 TraceCheckUtils]: 103: Hoare triple {252330#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {252330#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:41:17,382 INFO L290 TraceCheckUtils]: 104: Hoare triple {252330#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {252330#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:41:17,382 INFO L290 TraceCheckUtils]: 105: Hoare triple {252330#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {252330#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:41:17,382 INFO L290 TraceCheckUtils]: 106: Hoare triple {252330#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {252330#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:41:17,383 INFO L290 TraceCheckUtils]: 107: Hoare triple {252330#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {252330#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:41:17,383 INFO L290 TraceCheckUtils]: 108: Hoare triple {252330#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {252330#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:41:17,383 INFO L290 TraceCheckUtils]: 109: Hoare triple {252330#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {252330#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:41:17,384 INFO L290 TraceCheckUtils]: 110: Hoare triple {252330#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {252330#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:41:17,384 INFO L290 TraceCheckUtils]: 111: Hoare triple {252330#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {252330#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:41:17,384 INFO L290 TraceCheckUtils]: 112: Hoare triple {252330#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {252330#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:41:17,385 INFO L290 TraceCheckUtils]: 113: Hoare triple {252330#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {252330#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:41:17,385 INFO L290 TraceCheckUtils]: 114: Hoare triple {252330#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {252330#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:41:17,385 INFO L290 TraceCheckUtils]: 115: Hoare triple {252330#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {252330#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:41:17,386 INFO L290 TraceCheckUtils]: 116: Hoare triple {252330#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {252330#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:41:17,386 INFO L290 TraceCheckUtils]: 117: Hoare triple {252330#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {252330#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:41:17,386 INFO L290 TraceCheckUtils]: 118: Hoare triple {252330#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {252330#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:41:17,387 INFO L290 TraceCheckUtils]: 119: Hoare triple {252330#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {252330#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:41:17,387 INFO L290 TraceCheckUtils]: 120: Hoare triple {252330#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {252331#(not (= 8593 |ssl3_accept_#t~mem72|))} is VALID [2022-04-28 15:41:17,387 INFO L290 TraceCheckUtils]: 121: Hoare triple {252331#(not (= 8593 |ssl3_accept_#t~mem72|))} assume 8593 == #t~mem72;havoc #t~mem72; {252326#false} is VALID [2022-04-28 15:41:17,387 INFO L290 TraceCheckUtils]: 122: Hoare triple {252326#false} assume -2147483648 <= #t~nondet136 && #t~nondet136 <= 2147483647;~ret~0 := #t~nondet136;havoc #t~nondet136; {252326#false} is VALID [2022-04-28 15:41:17,387 INFO L290 TraceCheckUtils]: 123: Hoare triple {252326#false} assume !(~ret~0 <= 0);call write~int(8608, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {252326#false} is VALID [2022-04-28 15:41:17,387 INFO L290 TraceCheckUtils]: 124: Hoare triple {252326#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {252326#false} is VALID [2022-04-28 15:41:17,387 INFO L290 TraceCheckUtils]: 125: Hoare triple {252326#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {252326#false} is VALID [2022-04-28 15:41:17,387 INFO L290 TraceCheckUtils]: 126: Hoare triple {252326#false} ~skip~0 := 0; {252326#false} is VALID [2022-04-28 15:41:17,388 INFO L290 TraceCheckUtils]: 127: Hoare triple {252326#false} assume !false; {252326#false} is VALID [2022-04-28 15:41:17,388 INFO L290 TraceCheckUtils]: 128: Hoare triple {252326#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {252326#false} is VALID [2022-04-28 15:41:17,388 INFO L290 TraceCheckUtils]: 129: Hoare triple {252326#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {252326#false} is VALID [2022-04-28 15:41:17,388 INFO L290 TraceCheckUtils]: 130: Hoare triple {252326#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {252326#false} is VALID [2022-04-28 15:41:17,388 INFO L290 TraceCheckUtils]: 131: Hoare triple {252326#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {252326#false} is VALID [2022-04-28 15:41:17,388 INFO L290 TraceCheckUtils]: 132: Hoare triple {252326#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {252326#false} is VALID [2022-04-28 15:41:17,388 INFO L290 TraceCheckUtils]: 133: Hoare triple {252326#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {252326#false} is VALID [2022-04-28 15:41:17,388 INFO L290 TraceCheckUtils]: 134: Hoare triple {252326#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {252326#false} is VALID [2022-04-28 15:41:17,388 INFO L290 TraceCheckUtils]: 135: Hoare triple {252326#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {252326#false} is VALID [2022-04-28 15:41:17,388 INFO L290 TraceCheckUtils]: 136: Hoare triple {252326#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {252326#false} is VALID [2022-04-28 15:41:17,388 INFO L290 TraceCheckUtils]: 137: Hoare triple {252326#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {252326#false} is VALID [2022-04-28 15:41:17,388 INFO L290 TraceCheckUtils]: 138: Hoare triple {252326#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {252326#false} is VALID [2022-04-28 15:41:17,388 INFO L290 TraceCheckUtils]: 139: Hoare triple {252326#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {252326#false} is VALID [2022-04-28 15:41:17,388 INFO L290 TraceCheckUtils]: 140: Hoare triple {252326#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {252326#false} is VALID [2022-04-28 15:41:17,388 INFO L290 TraceCheckUtils]: 141: Hoare triple {252326#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {252326#false} is VALID [2022-04-28 15:41:17,389 INFO L290 TraceCheckUtils]: 142: Hoare triple {252326#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {252326#false} is VALID [2022-04-28 15:41:17,389 INFO L290 TraceCheckUtils]: 143: Hoare triple {252326#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {252326#false} is VALID [2022-04-28 15:41:17,389 INFO L290 TraceCheckUtils]: 144: Hoare triple {252326#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {252326#false} is VALID [2022-04-28 15:41:17,389 INFO L290 TraceCheckUtils]: 145: Hoare triple {252326#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {252326#false} is VALID [2022-04-28 15:41:17,389 INFO L290 TraceCheckUtils]: 146: Hoare triple {252326#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {252326#false} is VALID [2022-04-28 15:41:17,389 INFO L290 TraceCheckUtils]: 147: Hoare triple {252326#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {252326#false} is VALID [2022-04-28 15:41:17,389 INFO L290 TraceCheckUtils]: 148: Hoare triple {252326#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {252326#false} is VALID [2022-04-28 15:41:17,389 INFO L290 TraceCheckUtils]: 149: Hoare triple {252326#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {252326#false} is VALID [2022-04-28 15:41:17,389 INFO L290 TraceCheckUtils]: 150: Hoare triple {252326#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {252326#false} is VALID [2022-04-28 15:41:17,389 INFO L290 TraceCheckUtils]: 151: Hoare triple {252326#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {252326#false} is VALID [2022-04-28 15:41:17,389 INFO L290 TraceCheckUtils]: 152: Hoare triple {252326#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {252326#false} is VALID [2022-04-28 15:41:17,389 INFO L290 TraceCheckUtils]: 153: Hoare triple {252326#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {252326#false} is VALID [2022-04-28 15:41:17,389 INFO L290 TraceCheckUtils]: 154: Hoare triple {252326#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {252326#false} is VALID [2022-04-28 15:41:17,389 INFO L290 TraceCheckUtils]: 155: Hoare triple {252326#false} assume 8608 == #t~mem73;havoc #t~mem73; {252326#false} is VALID [2022-04-28 15:41:17,389 INFO L290 TraceCheckUtils]: 156: Hoare triple {252326#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {252326#false} is VALID [2022-04-28 15:41:17,390 INFO L290 TraceCheckUtils]: 157: Hoare triple {252326#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {252326#false} is VALID [2022-04-28 15:41:17,390 INFO L290 TraceCheckUtils]: 158: Hoare triple {252326#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {252326#false} is VALID [2022-04-28 15:41:17,390 INFO L290 TraceCheckUtils]: 159: Hoare triple {252326#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {252326#false} is VALID [2022-04-28 15:41:17,390 INFO L290 TraceCheckUtils]: 160: Hoare triple {252326#false} ~skip~0 := 0; {252326#false} is VALID [2022-04-28 15:41:17,390 INFO L290 TraceCheckUtils]: 161: Hoare triple {252326#false} assume !false; {252326#false} is VALID [2022-04-28 15:41:17,390 INFO L290 TraceCheckUtils]: 162: Hoare triple {252326#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {252326#false} is VALID [2022-04-28 15:41:17,390 INFO L290 TraceCheckUtils]: 163: Hoare triple {252326#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {252326#false} is VALID [2022-04-28 15:41:17,390 INFO L290 TraceCheckUtils]: 164: Hoare triple {252326#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {252326#false} is VALID [2022-04-28 15:41:17,390 INFO L290 TraceCheckUtils]: 165: Hoare triple {252326#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {252326#false} is VALID [2022-04-28 15:41:17,390 INFO L290 TraceCheckUtils]: 166: Hoare triple {252326#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {252326#false} is VALID [2022-04-28 15:41:17,390 INFO L290 TraceCheckUtils]: 167: Hoare triple {252326#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {252326#false} is VALID [2022-04-28 15:41:17,390 INFO L290 TraceCheckUtils]: 168: Hoare triple {252326#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {252326#false} is VALID [2022-04-28 15:41:17,390 INFO L290 TraceCheckUtils]: 169: Hoare triple {252326#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {252326#false} is VALID [2022-04-28 15:41:17,390 INFO L290 TraceCheckUtils]: 170: Hoare triple {252326#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {252326#false} is VALID [2022-04-28 15:41:17,390 INFO L290 TraceCheckUtils]: 171: Hoare triple {252326#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {252326#false} is VALID [2022-04-28 15:41:17,390 INFO L290 TraceCheckUtils]: 172: Hoare triple {252326#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {252326#false} is VALID [2022-04-28 15:41:17,391 INFO L290 TraceCheckUtils]: 173: Hoare triple {252326#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {252326#false} is VALID [2022-04-28 15:41:17,391 INFO L290 TraceCheckUtils]: 174: Hoare triple {252326#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {252326#false} is VALID [2022-04-28 15:41:17,391 INFO L290 TraceCheckUtils]: 175: Hoare triple {252326#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {252326#false} is VALID [2022-04-28 15:41:17,391 INFO L290 TraceCheckUtils]: 176: Hoare triple {252326#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {252326#false} is VALID [2022-04-28 15:41:17,391 INFO L290 TraceCheckUtils]: 177: Hoare triple {252326#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {252326#false} is VALID [2022-04-28 15:41:17,391 INFO L290 TraceCheckUtils]: 178: Hoare triple {252326#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {252326#false} is VALID [2022-04-28 15:41:17,391 INFO L290 TraceCheckUtils]: 179: Hoare triple {252326#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {252326#false} is VALID [2022-04-28 15:41:17,391 INFO L290 TraceCheckUtils]: 180: Hoare triple {252326#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {252326#false} is VALID [2022-04-28 15:41:17,391 INFO L290 TraceCheckUtils]: 181: Hoare triple {252326#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {252326#false} is VALID [2022-04-28 15:41:17,391 INFO L290 TraceCheckUtils]: 182: Hoare triple {252326#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {252326#false} is VALID [2022-04-28 15:41:17,391 INFO L290 TraceCheckUtils]: 183: Hoare triple {252326#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {252326#false} is VALID [2022-04-28 15:41:17,391 INFO L290 TraceCheckUtils]: 184: Hoare triple {252326#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {252326#false} is VALID [2022-04-28 15:41:17,391 INFO L290 TraceCheckUtils]: 185: Hoare triple {252326#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {252326#false} is VALID [2022-04-28 15:41:17,391 INFO L290 TraceCheckUtils]: 186: Hoare triple {252326#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {252326#false} is VALID [2022-04-28 15:41:17,391 INFO L290 TraceCheckUtils]: 187: Hoare triple {252326#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {252326#false} is VALID [2022-04-28 15:41:17,392 INFO L290 TraceCheckUtils]: 188: Hoare triple {252326#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {252326#false} is VALID [2022-04-28 15:41:17,392 INFO L290 TraceCheckUtils]: 189: Hoare triple {252326#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {252326#false} is VALID [2022-04-28 15:41:17,392 INFO L290 TraceCheckUtils]: 190: Hoare triple {252326#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {252326#false} is VALID [2022-04-28 15:41:17,392 INFO L290 TraceCheckUtils]: 191: Hoare triple {252326#false} assume 8640 == #t~mem75;havoc #t~mem75; {252326#false} is VALID [2022-04-28 15:41:17,392 INFO L290 TraceCheckUtils]: 192: Hoare triple {252326#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {252326#false} is VALID [2022-04-28 15:41:17,392 INFO L290 TraceCheckUtils]: 193: Hoare triple {252326#false} assume !(4 == ~blastFlag~0); {252326#false} is VALID [2022-04-28 15:41:17,392 INFO L290 TraceCheckUtils]: 194: Hoare triple {252326#false} assume !(7 == ~blastFlag~0); {252326#false} is VALID [2022-04-28 15:41:17,392 INFO L290 TraceCheckUtils]: 195: Hoare triple {252326#false} assume !(10 == ~blastFlag~0); {252326#false} is VALID [2022-04-28 15:41:17,392 INFO L290 TraceCheckUtils]: 196: Hoare triple {252326#false} assume !false; {252326#false} is VALID [2022-04-28 15:41:17,392 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-04-28 15:41:17,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:41:17,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088726889] [2022-04-28 15:41:17,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088726889] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:41:17,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:41:17,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:41:17,393 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:41:17,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [425620973] [2022-04-28 15:41:17,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [425620973] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:41:17,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:41:17,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:41:17,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519684106] [2022-04-28 15:41:17,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:41:17,394 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 197 [2022-04-28 15:41:17,394 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:41:17,394 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 27.2) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:41:17,485 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:41:17,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:41:17,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:41:17,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:41:17,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:41:17,485 INFO L87 Difference]: Start difference. First operand 2391 states and 3406 transitions. Second operand has 5 states, 5 states have (on average 27.2) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:41:24,505 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:41:27,959 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:41:30,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:41:30,207 INFO L93 Difference]: Finished difference Result 4998 states and 7110 transitions. [2022-04-28 15:41:30,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:41:30,208 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 197 [2022-04-28 15:41:30,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:41:30,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 27.2) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:41:30,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 583 transitions. [2022-04-28 15:41:30,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 27.2) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:41:30,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 583 transitions. [2022-04-28 15:41:30,212 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 583 transitions. [2022-04-28 15:41:30,559 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-28 15:41:30,828 INFO L225 Difference]: With dead ends: 4998 [2022-04-28 15:41:30,828 INFO L226 Difference]: Without dead ends: 2635 [2022-04-28 15:41:30,830 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-28 15:41:30,830 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 109 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-04-28 15:41:30,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 404 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-04-28 15:41:30,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2635 states. [2022-04-28 15:41:30,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2635 to 2391. [2022-04-28 15:41:30,984 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:41:30,987 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2635 states. Second operand has 2391 states, 2386 states have (on average 1.4195305951383068) internal successors, (3387), 2386 states have internal predecessors, (3387), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:41:30,989 INFO L74 IsIncluded]: Start isIncluded. First operand 2635 states. Second operand has 2391 states, 2386 states have (on average 1.4195305951383068) internal successors, (3387), 2386 states have internal predecessors, (3387), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:41:30,990 INFO L87 Difference]: Start difference. First operand 2635 states. Second operand has 2391 states, 2386 states have (on average 1.4195305951383068) internal successors, (3387), 2386 states have internal predecessors, (3387), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:41:31,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:41:31,152 INFO L93 Difference]: Finished difference Result 2635 states and 3721 transitions. [2022-04-28 15:41:31,153 INFO L276 IsEmpty]: Start isEmpty. Operand 2635 states and 3721 transitions. [2022-04-28 15:41:31,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:41:31,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:41:31,157 INFO L74 IsIncluded]: Start isIncluded. First operand has 2391 states, 2386 states have (on average 1.4195305951383068) internal successors, (3387), 2386 states have internal predecessors, (3387), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2635 states. [2022-04-28 15:41:31,158 INFO L87 Difference]: Start difference. First operand has 2391 states, 2386 states have (on average 1.4195305951383068) internal successors, (3387), 2386 states have internal predecessors, (3387), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2635 states. [2022-04-28 15:41:31,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:41:31,323 INFO L93 Difference]: Finished difference Result 2635 states and 3721 transitions. [2022-04-28 15:41:31,323 INFO L276 IsEmpty]: Start isEmpty. Operand 2635 states and 3721 transitions. [2022-04-28 15:41:31,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:41:31,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:41:31,324 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:41:31,324 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:41:31,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2391 states, 2386 states have (on average 1.4195305951383068) internal successors, (3387), 2386 states have internal predecessors, (3387), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:41:31,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2391 states to 2391 states and 3391 transitions. [2022-04-28 15:41:31,564 INFO L78 Accepts]: Start accepts. Automaton has 2391 states and 3391 transitions. Word has length 197 [2022-04-28 15:41:31,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:41:31,565 INFO L495 AbstractCegarLoop]: Abstraction has 2391 states and 3391 transitions. [2022-04-28 15:41:31,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:41:31,565 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2391 states and 3391 transitions. [2022-04-28 15:41:34,882 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3391 edges. 3391 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:41:34,882 INFO L276 IsEmpty]: Start isEmpty. Operand 2391 states and 3391 transitions. [2022-04-28 15:41:34,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-04-28 15:41:34,884 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:41:34,885 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:41:34,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-04-28 15:41:34,885 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:41:34,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:41:34,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1038778275, now seen corresponding path program 1 times [2022-04-28 15:41:34,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:41:34,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1085965484] [2022-04-28 15:41:35,029 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:41:35,029 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:41:35,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1038778275, now seen corresponding path program 2 times [2022-04-28 15:41:35,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:41:35,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653533852] [2022-04-28 15:41:35,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:41:35,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:41:35,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:41:35,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:41:35,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:41:35,593 INFO L290 TraceCheckUtils]: 0: Hoare triple {272394#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {272385#true} is VALID [2022-04-28 15:41:35,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {272385#true} assume true; {272385#true} is VALID [2022-04-28 15:41:35,593 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {272385#true} {272385#true} #703#return; {272385#true} is VALID [2022-04-28 15:41:35,594 INFO L272 TraceCheckUtils]: 0: Hoare triple {272385#true} call ULTIMATE.init(); {272394#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-28 15:41:35,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {272394#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {272385#true} is VALID [2022-04-28 15:41:35,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {272385#true} assume true; {272385#true} is VALID [2022-04-28 15:41:35,594 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {272385#true} {272385#true} #703#return; {272385#true} is VALID [2022-04-28 15:41:35,594 INFO L272 TraceCheckUtils]: 4: Hoare triple {272385#true} call #t~ret161 := main(); {272385#true} is VALID [2022-04-28 15:41:35,594 INFO L290 TraceCheckUtils]: 5: Hoare triple {272385#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {272385#true} is VALID [2022-04-28 15:41:35,595 INFO L290 TraceCheckUtils]: 6: Hoare triple {272385#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {272390#(and (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 204)) 0) (= 0 (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 204))))} is VALID [2022-04-28 15:41:35,596 INFO L272 TraceCheckUtils]: 7: Hoare triple {272390#(and (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 204)) 0) (= 0 (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 204))))} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {272391#(and (= (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ 204 |ssl3_accept_#in~s.offset|)) 0) (= (select (select |#memory_$Pointer$.offset| |ssl3_accept_#in~s.base|) (+ 204 |ssl3_accept_#in~s.offset|)) 0))} is VALID [2022-04-28 15:41:35,598 INFO L290 TraceCheckUtils]: 8: Hoare triple {272391#(and (= (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ 204 |ssl3_accept_#in~s.offset|)) 0) (= (select (select |#memory_$Pointer$.offset| |ssl3_accept_#in~s.base|) (+ 204 |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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {272392#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} is VALID [2022-04-28 15:41:35,598 INFO L290 TraceCheckUtils]: 9: Hoare triple {272392#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {272392#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} is VALID [2022-04-28 15:41:35,599 INFO L290 TraceCheckUtils]: 10: Hoare triple {272392#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {272392#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} is VALID [2022-04-28 15:41:35,599 INFO L290 TraceCheckUtils]: 11: Hoare triple {272392#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {272392#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} is VALID [2022-04-28 15:41:35,600 INFO L290 TraceCheckUtils]: 12: Hoare triple {272392#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {272393#(and (= |ssl3_accept_#t~mem45.base| 0) (= |ssl3_accept_#t~mem45.offset| 0))} is VALID [2022-04-28 15:41:35,600 INFO L290 TraceCheckUtils]: 13: Hoare triple {272393#(and (= |ssl3_accept_#t~mem45.base| 0) (= |ssl3_accept_#t~mem45.offset| 0))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {272386#false} is VALID [2022-04-28 15:41:35,600 INFO L290 TraceCheckUtils]: 14: Hoare triple {272386#false} assume !false; {272386#false} is VALID [2022-04-28 15:41:35,600 INFO L290 TraceCheckUtils]: 15: Hoare triple {272386#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,600 INFO L290 TraceCheckUtils]: 16: Hoare triple {272386#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,600 INFO L290 TraceCheckUtils]: 17: Hoare triple {272386#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,601 INFO L290 TraceCheckUtils]: 18: Hoare triple {272386#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,601 INFO L290 TraceCheckUtils]: 19: Hoare triple {272386#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,601 INFO L290 TraceCheckUtils]: 20: Hoare triple {272386#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,601 INFO L290 TraceCheckUtils]: 21: Hoare triple {272386#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,601 INFO L290 TraceCheckUtils]: 22: Hoare triple {272386#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,601 INFO L290 TraceCheckUtils]: 23: Hoare triple {272386#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,601 INFO L290 TraceCheckUtils]: 24: Hoare triple {272386#false} assume 8464 == #t~mem55;havoc #t~mem55; {272386#false} is VALID [2022-04-28 15:41:35,601 INFO L290 TraceCheckUtils]: 25: Hoare triple {272386#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {272386#false} is VALID [2022-04-28 15:41:35,601 INFO L290 TraceCheckUtils]: 26: Hoare triple {272386#false} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {272386#false} is VALID [2022-04-28 15:41:35,601 INFO L290 TraceCheckUtils]: 27: Hoare triple {272386#false} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,601 INFO L290 TraceCheckUtils]: 28: Hoare triple {272386#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,601 INFO L290 TraceCheckUtils]: 29: Hoare triple {272386#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {272386#false} is VALID [2022-04-28 15:41:35,601 INFO L290 TraceCheckUtils]: 30: Hoare triple {272386#false} ~skip~0 := 0; {272386#false} is VALID [2022-04-28 15:41:35,601 INFO L290 TraceCheckUtils]: 31: Hoare triple {272386#false} assume !false; {272386#false} is VALID [2022-04-28 15:41:35,601 INFO L290 TraceCheckUtils]: 32: Hoare triple {272386#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,602 INFO L290 TraceCheckUtils]: 33: Hoare triple {272386#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,602 INFO L290 TraceCheckUtils]: 34: Hoare triple {272386#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,602 INFO L290 TraceCheckUtils]: 35: Hoare triple {272386#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,602 INFO L290 TraceCheckUtils]: 36: Hoare triple {272386#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,602 INFO L290 TraceCheckUtils]: 37: Hoare triple {272386#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,602 INFO L290 TraceCheckUtils]: 38: Hoare triple {272386#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,602 INFO L290 TraceCheckUtils]: 39: Hoare triple {272386#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,602 INFO L290 TraceCheckUtils]: 40: Hoare triple {272386#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,602 INFO L290 TraceCheckUtils]: 41: Hoare triple {272386#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,602 INFO L290 TraceCheckUtils]: 42: Hoare triple {272386#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,602 INFO L290 TraceCheckUtils]: 43: Hoare triple {272386#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,602 INFO L290 TraceCheckUtils]: 44: Hoare triple {272386#false} assume 8496 == #t~mem58;havoc #t~mem58; {272386#false} is VALID [2022-04-28 15:41:35,602 INFO L290 TraceCheckUtils]: 45: Hoare triple {272386#false} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {272386#false} is VALID [2022-04-28 15:41:35,602 INFO L290 TraceCheckUtils]: 46: Hoare triple {272386#false} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {272386#false} is VALID [2022-04-28 15:41:35,602 INFO L290 TraceCheckUtils]: 47: Hoare triple {272386#false} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,603 INFO L290 TraceCheckUtils]: 48: Hoare triple {272386#false} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,603 INFO L290 TraceCheckUtils]: 49: Hoare triple {272386#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,603 INFO L290 TraceCheckUtils]: 50: Hoare triple {272386#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,603 INFO L290 TraceCheckUtils]: 51: Hoare triple {272386#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {272386#false} is VALID [2022-04-28 15:41:35,603 INFO L290 TraceCheckUtils]: 52: Hoare triple {272386#false} ~skip~0 := 0; {272386#false} is VALID [2022-04-28 15:41:35,603 INFO L290 TraceCheckUtils]: 53: Hoare triple {272386#false} assume !false; {272386#false} is VALID [2022-04-28 15:41:35,603 INFO L290 TraceCheckUtils]: 54: Hoare triple {272386#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,603 INFO L290 TraceCheckUtils]: 55: Hoare triple {272386#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,603 INFO L290 TraceCheckUtils]: 56: Hoare triple {272386#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,603 INFO L290 TraceCheckUtils]: 57: Hoare triple {272386#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,603 INFO L290 TraceCheckUtils]: 58: Hoare triple {272386#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,603 INFO L290 TraceCheckUtils]: 59: Hoare triple {272386#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,603 INFO L290 TraceCheckUtils]: 60: Hoare triple {272386#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,603 INFO L290 TraceCheckUtils]: 61: Hoare triple {272386#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,603 INFO L290 TraceCheckUtils]: 62: Hoare triple {272386#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,604 INFO L290 TraceCheckUtils]: 63: Hoare triple {272386#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,604 INFO L290 TraceCheckUtils]: 64: Hoare triple {272386#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,604 INFO L290 TraceCheckUtils]: 65: Hoare triple {272386#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,604 INFO L290 TraceCheckUtils]: 66: Hoare triple {272386#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,604 INFO L290 TraceCheckUtils]: 67: Hoare triple {272386#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,604 INFO L290 TraceCheckUtils]: 68: Hoare triple {272386#false} assume 8512 == #t~mem60;havoc #t~mem60; {272386#false} is VALID [2022-04-28 15:41:35,604 INFO L290 TraceCheckUtils]: 69: Hoare triple {272386#false} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 888 + #t~mem95.offset, 8);call #t~mem97 := read~int(#t~mem96.base, 20 + #t~mem96.offset, 8); {272386#false} is VALID [2022-04-28 15:41:35,604 INFO L290 TraceCheckUtils]: 70: Hoare triple {272386#false} assume 0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 18446744073709551616;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;~skip~0 := 1; {272386#false} is VALID [2022-04-28 15:41:35,604 INFO L290 TraceCheckUtils]: 71: Hoare triple {272386#false} call write~int(8528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,604 INFO L290 TraceCheckUtils]: 72: Hoare triple {272386#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,604 INFO L290 TraceCheckUtils]: 73: Hoare triple {272386#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {272386#false} is VALID [2022-04-28 15:41:35,604 INFO L290 TraceCheckUtils]: 74: Hoare triple {272386#false} ~skip~0 := 0; {272386#false} is VALID [2022-04-28 15:41:35,604 INFO L290 TraceCheckUtils]: 75: Hoare triple {272386#false} assume !false; {272386#false} is VALID [2022-04-28 15:41:35,604 INFO L290 TraceCheckUtils]: 76: Hoare triple {272386#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,605 INFO L290 TraceCheckUtils]: 77: Hoare triple {272386#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,605 INFO L290 TraceCheckUtils]: 78: Hoare triple {272386#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,605 INFO L290 TraceCheckUtils]: 79: Hoare triple {272386#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,605 INFO L290 TraceCheckUtils]: 80: Hoare triple {272386#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,605 INFO L290 TraceCheckUtils]: 81: Hoare triple {272386#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,605 INFO L290 TraceCheckUtils]: 82: Hoare triple {272386#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,605 INFO L290 TraceCheckUtils]: 83: Hoare triple {272386#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,605 INFO L290 TraceCheckUtils]: 84: Hoare triple {272386#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,605 INFO L290 TraceCheckUtils]: 85: Hoare triple {272386#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,605 INFO L290 TraceCheckUtils]: 86: Hoare triple {272386#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,605 INFO L290 TraceCheckUtils]: 87: Hoare triple {272386#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,605 INFO L290 TraceCheckUtils]: 88: Hoare triple {272386#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,605 INFO L290 TraceCheckUtils]: 89: Hoare triple {272386#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,605 INFO L290 TraceCheckUtils]: 90: Hoare triple {272386#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,605 INFO L290 TraceCheckUtils]: 91: Hoare triple {272386#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,606 INFO L290 TraceCheckUtils]: 92: Hoare triple {272386#false} assume 8528 == #t~mem62;havoc #t~mem62; {272386#false} is VALID [2022-04-28 15:41:35,606 INFO L290 TraceCheckUtils]: 93: Hoare triple {272386#false} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 888 + #t~mem99.offset, 8);call #t~mem101 := read~int(#t~mem100.base, 20 + #t~mem100.offset, 8);~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, 332 + ~s.offset, 8); {272386#false} is VALID [2022-04-28 15:41:35,606 INFO L290 TraceCheckUtils]: 94: Hoare triple {272386#false} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 18446744073709551616;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem103.base, 935 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {272386#false} is VALID [2022-04-28 15:41:35,606 INFO L290 TraceCheckUtils]: 95: Hoare triple {272386#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem106 := read~int(#t~mem105.base, 935 + #t~mem105.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,606 INFO L290 TraceCheckUtils]: 96: Hoare triple {272386#false} assume 0 != #t~mem106;havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {272386#false} is VALID [2022-04-28 15:41:35,606 INFO L290 TraceCheckUtils]: 97: Hoare triple {272386#false} assume -2147483648 <= #t~nondet115 && #t~nondet115 <= 2147483647;~ret~0 := #t~nondet115;havoc #t~nondet115; {272386#false} is VALID [2022-04-28 15:41:35,606 INFO L290 TraceCheckUtils]: 98: Hoare triple {272386#false} assume !(~ret~0 <= 0); {272386#false} is VALID [2022-04-28 15:41:35,606 INFO L290 TraceCheckUtils]: 99: Hoare triple {272386#false} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,606 INFO L290 TraceCheckUtils]: 100: Hoare triple {272386#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,606 INFO L290 TraceCheckUtils]: 101: Hoare triple {272386#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {272386#false} is VALID [2022-04-28 15:41:35,606 INFO L290 TraceCheckUtils]: 102: Hoare triple {272386#false} ~skip~0 := 0; {272386#false} is VALID [2022-04-28 15:41:35,606 INFO L290 TraceCheckUtils]: 103: Hoare triple {272386#false} assume !false; {272386#false} is VALID [2022-04-28 15:41:35,606 INFO L290 TraceCheckUtils]: 104: Hoare triple {272386#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,606 INFO L290 TraceCheckUtils]: 105: Hoare triple {272386#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,606 INFO L290 TraceCheckUtils]: 106: Hoare triple {272386#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,607 INFO L290 TraceCheckUtils]: 107: Hoare triple {272386#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,607 INFO L290 TraceCheckUtils]: 108: Hoare triple {272386#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,607 INFO L290 TraceCheckUtils]: 109: Hoare triple {272386#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,607 INFO L290 TraceCheckUtils]: 110: Hoare triple {272386#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,607 INFO L290 TraceCheckUtils]: 111: Hoare triple {272386#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,607 INFO L290 TraceCheckUtils]: 112: Hoare triple {272386#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,607 INFO L290 TraceCheckUtils]: 113: Hoare triple {272386#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,607 INFO L290 TraceCheckUtils]: 114: Hoare triple {272386#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,607 INFO L290 TraceCheckUtils]: 115: Hoare triple {272386#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,607 INFO L290 TraceCheckUtils]: 116: Hoare triple {272386#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,607 INFO L290 TraceCheckUtils]: 117: Hoare triple {272386#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,607 INFO L290 TraceCheckUtils]: 118: Hoare triple {272386#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,607 INFO L290 TraceCheckUtils]: 119: Hoare triple {272386#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,607 INFO L290 TraceCheckUtils]: 120: Hoare triple {272386#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,607 INFO L290 TraceCheckUtils]: 121: Hoare triple {272386#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,608 INFO L290 TraceCheckUtils]: 122: Hoare triple {272386#false} assume 8544 == #t~mem64;havoc #t~mem64; {272386#false} is VALID [2022-04-28 15:41:35,608 INFO L290 TraceCheckUtils]: 123: Hoare triple {272386#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,608 INFO L290 TraceCheckUtils]: 124: Hoare triple {272386#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {272386#false} is VALID [2022-04-28 15:41:35,608 INFO L290 TraceCheckUtils]: 125: Hoare triple {272386#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {272386#false} is VALID [2022-04-28 15:41:35,608 INFO L290 TraceCheckUtils]: 126: Hoare triple {272386#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {272386#false} is VALID [2022-04-28 15:41:35,608 INFO L290 TraceCheckUtils]: 127: Hoare triple {272386#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {272386#false} is VALID [2022-04-28 15:41:35,608 INFO L290 TraceCheckUtils]: 128: Hoare triple {272386#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #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; {272386#false} is VALID [2022-04-28 15:41:35,608 INFO L290 TraceCheckUtils]: 129: Hoare triple {272386#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 72 + ~s.offset, 4);call #t~mem128.base, #t~mem128.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8576, #t~mem128.base, 904 + #t~mem128.offset, 4);havoc #t~mem128.base, #t~mem128.offset;call write~int(0, ~s.base, 88 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,608 INFO L290 TraceCheckUtils]: 130: Hoare triple {272386#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,608 INFO L290 TraceCheckUtils]: 131: Hoare triple {272386#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {272386#false} is VALID [2022-04-28 15:41:35,608 INFO L290 TraceCheckUtils]: 132: Hoare triple {272386#false} ~skip~0 := 0; {272386#false} is VALID [2022-04-28 15:41:35,608 INFO L290 TraceCheckUtils]: 133: Hoare triple {272386#false} assume !false; {272386#false} is VALID [2022-04-28 15:41:35,608 INFO L290 TraceCheckUtils]: 134: Hoare triple {272386#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,608 INFO L290 TraceCheckUtils]: 135: Hoare triple {272386#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,608 INFO L290 TraceCheckUtils]: 136: Hoare triple {272386#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,609 INFO L290 TraceCheckUtils]: 137: Hoare triple {272386#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,609 INFO L290 TraceCheckUtils]: 138: Hoare triple {272386#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,609 INFO L290 TraceCheckUtils]: 139: Hoare triple {272386#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,609 INFO L290 TraceCheckUtils]: 140: Hoare triple {272386#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,609 INFO L290 TraceCheckUtils]: 141: Hoare triple {272386#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,609 INFO L290 TraceCheckUtils]: 142: Hoare triple {272386#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,609 INFO L290 TraceCheckUtils]: 143: Hoare triple {272386#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,609 INFO L290 TraceCheckUtils]: 144: Hoare triple {272386#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,609 INFO L290 TraceCheckUtils]: 145: Hoare triple {272386#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,609 INFO L290 TraceCheckUtils]: 146: Hoare triple {272386#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,609 INFO L290 TraceCheckUtils]: 147: Hoare triple {272386#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,609 INFO L290 TraceCheckUtils]: 148: Hoare triple {272386#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,609 INFO L290 TraceCheckUtils]: 149: Hoare triple {272386#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,609 INFO L290 TraceCheckUtils]: 150: Hoare triple {272386#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,609 INFO L290 TraceCheckUtils]: 151: Hoare triple {272386#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,610 INFO L290 TraceCheckUtils]: 152: Hoare triple {272386#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,610 INFO L290 TraceCheckUtils]: 153: Hoare triple {272386#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,610 INFO L290 TraceCheckUtils]: 154: Hoare triple {272386#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,610 INFO L290 TraceCheckUtils]: 155: Hoare triple {272386#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,610 INFO L290 TraceCheckUtils]: 156: Hoare triple {272386#false} assume 8448 == #t~mem68;havoc #t~mem68; {272386#false} is VALID [2022-04-28 15:41:35,610 INFO L290 TraceCheckUtils]: 157: Hoare triple {272386#false} assume !(~num1~0 > 0); {272386#false} is VALID [2022-04-28 15:41:35,610 INFO L290 TraceCheckUtils]: 158: Hoare triple {272386#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem133 := read~int(#t~mem132.base, 904 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 72 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {272386#false} is VALID [2022-04-28 15:41:35,610 INFO L290 TraceCheckUtils]: 159: Hoare triple {272386#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,610 INFO L290 TraceCheckUtils]: 160: Hoare triple {272386#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {272386#false} is VALID [2022-04-28 15:41:35,610 INFO L290 TraceCheckUtils]: 161: Hoare triple {272386#false} ~skip~0 := 0; {272386#false} is VALID [2022-04-28 15:41:35,610 INFO L290 TraceCheckUtils]: 162: Hoare triple {272386#false} assume !false; {272386#false} is VALID [2022-04-28 15:41:35,610 INFO L290 TraceCheckUtils]: 163: Hoare triple {272386#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,610 INFO L290 TraceCheckUtils]: 164: Hoare triple {272386#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,610 INFO L290 TraceCheckUtils]: 165: Hoare triple {272386#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,610 INFO L290 TraceCheckUtils]: 166: Hoare triple {272386#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,611 INFO L290 TraceCheckUtils]: 167: Hoare triple {272386#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,611 INFO L290 TraceCheckUtils]: 168: Hoare triple {272386#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,611 INFO L290 TraceCheckUtils]: 169: Hoare triple {272386#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,611 INFO L290 TraceCheckUtils]: 170: Hoare triple {272386#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,611 INFO L290 TraceCheckUtils]: 171: Hoare triple {272386#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,611 INFO L290 TraceCheckUtils]: 172: Hoare triple {272386#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,611 INFO L290 TraceCheckUtils]: 173: Hoare triple {272386#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,611 INFO L290 TraceCheckUtils]: 174: Hoare triple {272386#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,611 INFO L290 TraceCheckUtils]: 175: Hoare triple {272386#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,611 INFO L290 TraceCheckUtils]: 176: Hoare triple {272386#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,611 INFO L290 TraceCheckUtils]: 177: Hoare triple {272386#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,611 INFO L290 TraceCheckUtils]: 178: Hoare triple {272386#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,611 INFO L290 TraceCheckUtils]: 179: Hoare triple {272386#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,611 INFO L290 TraceCheckUtils]: 180: Hoare triple {272386#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,611 INFO L290 TraceCheckUtils]: 181: Hoare triple {272386#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,612 INFO L290 TraceCheckUtils]: 182: Hoare triple {272386#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,612 INFO L290 TraceCheckUtils]: 183: Hoare triple {272386#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,612 INFO L290 TraceCheckUtils]: 184: Hoare triple {272386#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,612 INFO L290 TraceCheckUtils]: 185: Hoare triple {272386#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,612 INFO L290 TraceCheckUtils]: 186: Hoare triple {272386#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,612 INFO L290 TraceCheckUtils]: 187: Hoare triple {272386#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,612 INFO L290 TraceCheckUtils]: 188: Hoare triple {272386#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,612 INFO L290 TraceCheckUtils]: 189: Hoare triple {272386#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,612 INFO L290 TraceCheckUtils]: 190: Hoare triple {272386#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,612 INFO L290 TraceCheckUtils]: 191: Hoare triple {272386#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {272386#false} is VALID [2022-04-28 15:41:35,612 INFO L290 TraceCheckUtils]: 192: Hoare triple {272386#false} assume 8640 == #t~mem75;havoc #t~mem75; {272386#false} is VALID [2022-04-28 15:41:35,612 INFO L290 TraceCheckUtils]: 193: Hoare triple {272386#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {272386#false} is VALID [2022-04-28 15:41:35,612 INFO L290 TraceCheckUtils]: 194: Hoare triple {272386#false} assume !(4 == ~blastFlag~0); {272386#false} is VALID [2022-04-28 15:41:35,612 INFO L290 TraceCheckUtils]: 195: Hoare triple {272386#false} assume !(7 == ~blastFlag~0); {272386#false} is VALID [2022-04-28 15:41:35,612 INFO L290 TraceCheckUtils]: 196: Hoare triple {272386#false} assume !(10 == ~blastFlag~0); {272386#false} is VALID [2022-04-28 15:41:35,613 INFO L290 TraceCheckUtils]: 197: Hoare triple {272386#false} assume !false; {272386#false} is VALID [2022-04-28 15:41:35,613 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2022-04-28 15:41:35,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:41:35,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653533852] [2022-04-28 15:41:35,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653533852] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:41:35,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:41:35,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 15:41:35,613 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:41:35,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1085965484] [2022-04-28 15:41:35,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1085965484] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:41:35,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:41:35,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 15:41:35,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717385585] [2022-04-28 15:41:35,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:41:35,614 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 13.666666666666666) internal successors, (82), 5 states have internal predecessors, (82), 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 198 [2022-04-28 15:41:35,614 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:41:35,614 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 13.666666666666666) internal successors, (82), 5 states have internal predecessors, (82), 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-28 15:41:35,677 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:41:35,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 15:41:35,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:41:35,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 15:41:35,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-28 15:41:35,677 INFO L87 Difference]: Start difference. First operand 2391 states and 3391 transitions. Second operand has 7 states, 6 states have (on average 13.666666666666666) internal successors, (82), 5 states have internal predecessors, (82), 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-28 15:41:37,771 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-28 15:41:41,135 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:41:44,231 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:41:46,240 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:41:48,275 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:41:51,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:41:51,937 INFO L93 Difference]: Finished difference Result 4775 states and 6774 transitions. [2022-04-28 15:41:51,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 15:41:51,937 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 13.666666666666666) internal successors, (82), 5 states have internal predecessors, (82), 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 198 [2022-04-28 15:41:51,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:41:51,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 13.666666666666666) internal successors, (82), 5 states have internal predecessors, (82), 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-28 15:41:51,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 434 transitions. [2022-04-28 15:41:51,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 13.666666666666666) internal successors, (82), 5 states have internal predecessors, (82), 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-28 15:41:51,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 434 transitions. [2022-04-28 15:41:51,940 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 434 transitions. [2022-04-28 15:41:52,207 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 434 edges. 434 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:41:52,435 INFO L225 Difference]: With dead ends: 4775 [2022-04-28 15:41:52,435 INFO L226 Difference]: Without dead ends: 2391 [2022-04-28 15:41:52,437 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-28 15:41:52,437 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 7 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 4 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2022-04-28 15:41:52,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 871 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 449 Invalid, 2 Unknown, 0 Unchecked, 10.2s Time] [2022-04-28 15:41:52,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2391 states. [2022-04-28 15:41:52,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2391 to 2391. [2022-04-28 15:41:52,604 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:41:52,606 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2391 states. Second operand has 2391 states, 2386 states have (on average 1.4191114836546521) internal successors, (3386), 2386 states have internal predecessors, (3386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:41:52,608 INFO L74 IsIncluded]: Start isIncluded. First operand 2391 states. Second operand has 2391 states, 2386 states have (on average 1.4191114836546521) internal successors, (3386), 2386 states have internal predecessors, (3386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:41:52,609 INFO L87 Difference]: Start difference. First operand 2391 states. Second operand has 2391 states, 2386 states have (on average 1.4191114836546521) internal successors, (3386), 2386 states have internal predecessors, (3386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:41:52,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:41:52,746 INFO L93 Difference]: Finished difference Result 2391 states and 3390 transitions. [2022-04-28 15:41:52,746 INFO L276 IsEmpty]: Start isEmpty. Operand 2391 states and 3390 transitions. [2022-04-28 15:41:52,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:41:52,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:41:52,749 INFO L74 IsIncluded]: Start isIncluded. First operand has 2391 states, 2386 states have (on average 1.4191114836546521) internal successors, (3386), 2386 states have internal predecessors, (3386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2391 states. [2022-04-28 15:41:52,751 INFO L87 Difference]: Start difference. First operand has 2391 states, 2386 states have (on average 1.4191114836546521) internal successors, (3386), 2386 states have internal predecessors, (3386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2391 states. [2022-04-28 15:41:52,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:41:52,886 INFO L93 Difference]: Finished difference Result 2391 states and 3390 transitions. [2022-04-28 15:41:52,886 INFO L276 IsEmpty]: Start isEmpty. Operand 2391 states and 3390 transitions. [2022-04-28 15:41:52,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:41:52,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:41:52,887 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:41:52,887 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:41:52,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2391 states, 2386 states have (on average 1.4191114836546521) internal successors, (3386), 2386 states have internal predecessors, (3386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:41:53,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2391 states to 2391 states and 3390 transitions. [2022-04-28 15:41:53,122 INFO L78 Accepts]: Start accepts. Automaton has 2391 states and 3390 transitions. Word has length 198 [2022-04-28 15:41:53,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:41:53,122 INFO L495 AbstractCegarLoop]: Abstraction has 2391 states and 3390 transitions. [2022-04-28 15:41:53,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 13.666666666666666) internal successors, (82), 5 states have internal predecessors, (82), 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-28 15:41:53,122 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2391 states and 3390 transitions. [2022-04-28 15:41:56,366 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3390 edges. 3390 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:41:56,367 INFO L276 IsEmpty]: Start isEmpty. Operand 2391 states and 3390 transitions. [2022-04-28 15:41:56,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-04-28 15:41:56,369 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:41:56,369 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:41:56,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-04-28 15:41:56,371 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:41:56,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:41:56,371 INFO L85 PathProgramCache]: Analyzing trace with hash -551704549, now seen corresponding path program 1 times [2022-04-28 15:41:56,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:41:56,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1809593414] [2022-04-28 15:41:56,523 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:41:56,524 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:41:56,524 INFO L85 PathProgramCache]: Analyzing trace with hash -551704549, now seen corresponding path program 2 times [2022-04-28 15:41:56,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:41:56,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274501938] [2022-04-28 15:41:56,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:41:56,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:41:57,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:41:57,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:41:57,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:41:57,605 INFO L290 TraceCheckUtils]: 0: Hoare triple {291529#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {291517#true} is VALID [2022-04-28 15:41:57,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {291517#true} assume true; {291517#true} is VALID [2022-04-28 15:41:57,605 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {291517#true} {291517#true} #703#return; {291517#true} is VALID [2022-04-28 15:41:57,606 INFO L272 TraceCheckUtils]: 0: Hoare triple {291517#true} call ULTIMATE.init(); {291529#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-28 15:41:57,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {291529#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 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); {291517#true} is VALID [2022-04-28 15:41:57,606 INFO L290 TraceCheckUtils]: 2: Hoare triple {291517#true} assume true; {291517#true} is VALID [2022-04-28 15:41:57,606 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {291517#true} {291517#true} #703#return; {291517#true} is VALID [2022-04-28 15:41:57,606 INFO L272 TraceCheckUtils]: 4: Hoare triple {291517#true} call #t~ret161 := main(); {291517#true} is VALID [2022-04-28 15:41:57,632 INFO L290 TraceCheckUtils]: 5: Hoare triple {291517#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {291522#(and (not (= (select |#valid| main_~s~0.base) 0)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 116 main_~s~0.offset)) main_~s~0.base)))} is VALID [2022-04-28 15:41:57,633 INFO L290 TraceCheckUtils]: 6: Hoare triple {291522#(and (not (= (select |#valid| main_~s~0.base) 0)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 116 main_~s~0.offset)) main_~s~0.base)))} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(144);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 204 + ~s~0.offset, 8);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet29 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet29 % 18446744073709551616 % 18446744073709551616 else #t~nondet29 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem28.base, 68 + #t~mem28.offset, 8);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {291523#(not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 116 main_~s~0.offset)) main_~s~0.base))} is VALID [2022-04-28 15:41:57,634 INFO L272 TraceCheckUtils]: 7: Hoare triple {291523#(not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 116 main_~s~0.offset)) main_~s~0.base))} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {291524#(not (= |ssl3_accept_#in~s.base| (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ 116 |ssl3_accept_#in~s.offset|))))} is VALID [2022-04-28 15:41:57,635 INFO L290 TraceCheckUtils]: 8: Hoare triple {291524#(not (= |ssl3_accept_#in~s.base| (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ 116 |ssl3_accept_#in~s.offset|))))} ~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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,636 INFO L290 TraceCheckUtils]: 9: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,636 INFO L290 TraceCheckUtils]: 10: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,637 INFO L290 TraceCheckUtils]: 11: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,637 INFO L290 TraceCheckUtils]: 12: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,637 INFO L290 TraceCheckUtils]: 13: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,638 INFO L290 TraceCheckUtils]: 14: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !false; {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,638 INFO L290 TraceCheckUtils]: 15: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,638 INFO L290 TraceCheckUtils]: 16: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,639 INFO L290 TraceCheckUtils]: 17: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,639 INFO L290 TraceCheckUtils]: 18: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,639 INFO L290 TraceCheckUtils]: 19: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,640 INFO L290 TraceCheckUtils]: 20: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,640 INFO L290 TraceCheckUtils]: 21: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,641 INFO L290 TraceCheckUtils]: 22: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,641 INFO L290 TraceCheckUtils]: 23: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,641 INFO L290 TraceCheckUtils]: 24: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume 8464 == #t~mem55;havoc #t~mem55; {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,642 INFO L290 TraceCheckUtils]: 25: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,642 INFO L290 TraceCheckUtils]: 26: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,643 INFO L290 TraceCheckUtils]: 27: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,643 INFO L290 TraceCheckUtils]: 28: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,644 INFO L290 TraceCheckUtils]: 29: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,644 INFO L290 TraceCheckUtils]: 30: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} ~skip~0 := 0; {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,644 INFO L290 TraceCheckUtils]: 31: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !false; {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,645 INFO L290 TraceCheckUtils]: 32: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,645 INFO L290 TraceCheckUtils]: 33: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,645 INFO L290 TraceCheckUtils]: 34: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,646 INFO L290 TraceCheckUtils]: 35: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,646 INFO L290 TraceCheckUtils]: 36: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,646 INFO L290 TraceCheckUtils]: 37: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,647 INFO L290 TraceCheckUtils]: 38: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,647 INFO L290 TraceCheckUtils]: 39: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,648 INFO L290 TraceCheckUtils]: 40: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,648 INFO L290 TraceCheckUtils]: 41: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,648 INFO L290 TraceCheckUtils]: 42: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,649 INFO L290 TraceCheckUtils]: 43: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,649 INFO L290 TraceCheckUtils]: 44: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume 8496 == #t~mem58;havoc #t~mem58; {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,649 INFO L290 TraceCheckUtils]: 45: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,650 INFO L290 TraceCheckUtils]: 46: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,650 INFO L290 TraceCheckUtils]: 47: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,651 INFO L290 TraceCheckUtils]: 48: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,651 INFO L290 TraceCheckUtils]: 49: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,651 INFO L290 TraceCheckUtils]: 50: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,652 INFO L290 TraceCheckUtils]: 51: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,652 INFO L290 TraceCheckUtils]: 52: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} ~skip~0 := 0; {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,652 INFO L290 TraceCheckUtils]: 53: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !false; {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,653 INFO L290 TraceCheckUtils]: 54: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,653 INFO L290 TraceCheckUtils]: 55: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,654 INFO L290 TraceCheckUtils]: 56: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,654 INFO L290 TraceCheckUtils]: 57: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,654 INFO L290 TraceCheckUtils]: 58: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,655 INFO L290 TraceCheckUtils]: 59: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,655 INFO L290 TraceCheckUtils]: 60: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,655 INFO L290 TraceCheckUtils]: 61: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,656 INFO L290 TraceCheckUtils]: 62: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,656 INFO L290 TraceCheckUtils]: 63: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,656 INFO L290 TraceCheckUtils]: 64: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,657 INFO L290 TraceCheckUtils]: 65: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,657 INFO L290 TraceCheckUtils]: 66: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,657 INFO L290 TraceCheckUtils]: 67: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,658 INFO L290 TraceCheckUtils]: 68: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume 8512 == #t~mem60;havoc #t~mem60; {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,658 INFO L290 TraceCheckUtils]: 69: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 888 + #t~mem95.offset, 8);call #t~mem97 := read~int(#t~mem96.base, 20 + #t~mem96.offset, 8); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,659 INFO L290 TraceCheckUtils]: 70: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume 0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 18446744073709551616;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;~skip~0 := 1; {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,659 INFO L290 TraceCheckUtils]: 71: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} call write~int(8528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,660 INFO L290 TraceCheckUtils]: 72: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,660 INFO L290 TraceCheckUtils]: 73: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,660 INFO L290 TraceCheckUtils]: 74: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} ~skip~0 := 0; {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,661 INFO L290 TraceCheckUtils]: 75: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !false; {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,661 INFO L290 TraceCheckUtils]: 76: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,661 INFO L290 TraceCheckUtils]: 77: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,662 INFO L290 TraceCheckUtils]: 78: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,662 INFO L290 TraceCheckUtils]: 79: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,662 INFO L290 TraceCheckUtils]: 80: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,663 INFO L290 TraceCheckUtils]: 81: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,663 INFO L290 TraceCheckUtils]: 82: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,663 INFO L290 TraceCheckUtils]: 83: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,664 INFO L290 TraceCheckUtils]: 84: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,664 INFO L290 TraceCheckUtils]: 85: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,664 INFO L290 TraceCheckUtils]: 86: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,665 INFO L290 TraceCheckUtils]: 87: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,665 INFO L290 TraceCheckUtils]: 88: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,666 INFO L290 TraceCheckUtils]: 89: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,666 INFO L290 TraceCheckUtils]: 90: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,666 INFO L290 TraceCheckUtils]: 91: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,667 INFO L290 TraceCheckUtils]: 92: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume 8528 == #t~mem62;havoc #t~mem62; {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,667 INFO L290 TraceCheckUtils]: 93: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 888 + #t~mem99.offset, 8);call #t~mem101 := read~int(#t~mem100.base, 20 + #t~mem100.offset, 8);~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, 332 + ~s.offset, 8); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,668 INFO L290 TraceCheckUtils]: 94: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 18446744073709551616;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem103.base, 935 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,668 INFO L290 TraceCheckUtils]: 95: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem106 := read~int(#t~mem105.base, 935 + #t~mem105.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,668 INFO L290 TraceCheckUtils]: 96: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume 0 != #t~mem106;havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,669 INFO L290 TraceCheckUtils]: 97: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume -2147483648 <= #t~nondet115 && #t~nondet115 <= 2147483647;~ret~0 := #t~nondet115;havoc #t~nondet115; {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,669 INFO L290 TraceCheckUtils]: 98: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(~ret~0 <= 0); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,670 INFO L290 TraceCheckUtils]: 99: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,670 INFO L290 TraceCheckUtils]: 100: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,671 INFO L290 TraceCheckUtils]: 101: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,671 INFO L290 TraceCheckUtils]: 102: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} ~skip~0 := 0; {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,671 INFO L290 TraceCheckUtils]: 103: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !false; {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,672 INFO L290 TraceCheckUtils]: 104: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,672 INFO L290 TraceCheckUtils]: 105: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,672 INFO L290 TraceCheckUtils]: 106: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,673 INFO L290 TraceCheckUtils]: 107: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,673 INFO L290 TraceCheckUtils]: 108: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,673 INFO L290 TraceCheckUtils]: 109: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,674 INFO L290 TraceCheckUtils]: 110: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,674 INFO L290 TraceCheckUtils]: 111: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,674 INFO L290 TraceCheckUtils]: 112: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,675 INFO L290 TraceCheckUtils]: 113: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,675 INFO L290 TraceCheckUtils]: 114: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,675 INFO L290 TraceCheckUtils]: 115: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,676 INFO L290 TraceCheckUtils]: 116: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,676 INFO L290 TraceCheckUtils]: 117: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,676 INFO L290 TraceCheckUtils]: 118: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,677 INFO L290 TraceCheckUtils]: 119: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,677 INFO L290 TraceCheckUtils]: 120: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,678 INFO L290 TraceCheckUtils]: 121: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,678 INFO L290 TraceCheckUtils]: 122: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume 8544 == #t~mem64;havoc #t~mem64; {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,678 INFO L290 TraceCheckUtils]: 123: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,679 INFO L290 TraceCheckUtils]: 124: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,679 INFO L290 TraceCheckUtils]: 125: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,679 INFO L290 TraceCheckUtils]: 126: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,680 INFO L290 TraceCheckUtils]: 127: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,680 INFO L290 TraceCheckUtils]: 128: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #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; {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:41:57,682 INFO L290 TraceCheckUtils]: 129: Hoare triple {291525#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 72 + ~s.offset, 4);call #t~mem128.base, #t~mem128.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8576, #t~mem128.base, 904 + #t~mem128.offset, 4);havoc #t~mem128.base, #t~mem128.offset;call write~int(0, ~s.base, 88 + ~s.offset, 4); {291526#(= 8576 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 904 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))))} is VALID [2022-04-28 15:41:57,682 INFO L290 TraceCheckUtils]: 130: Hoare triple {291526#(= 8576 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 904 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {291526#(= 8576 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 904 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))))} is VALID [2022-04-28 15:41:57,682 INFO L290 TraceCheckUtils]: 131: Hoare triple {291526#(= 8576 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 904 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {291526#(= 8576 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 904 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))))} is VALID [2022-04-28 15:41:57,682 INFO L290 TraceCheckUtils]: 132: Hoare triple {291526#(= 8576 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 904 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))))} ~skip~0 := 0; {291526#(= 8576 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 904 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))))} is VALID [2022-04-28 15:41:57,683 INFO L290 TraceCheckUtils]: 133: Hoare triple {291526#(= 8576 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 904 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))))} assume !false; {291526#(= 8576 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 904 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))))} is VALID [2022-04-28 15:41:57,683 INFO L290 TraceCheckUtils]: 134: Hoare triple {291526#(= 8576 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 904 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {291526#(= 8576 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 904 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))))} is VALID [2022-04-28 15:41:57,683 INFO L290 TraceCheckUtils]: 135: Hoare triple {291526#(= 8576 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 904 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {291526#(= 8576 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 904 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))))} is VALID [2022-04-28 15:41:57,683 INFO L290 TraceCheckUtils]: 136: Hoare triple {291526#(= 8576 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 904 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {291526#(= 8576 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 904 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))))} is VALID [2022-04-28 15:41:57,684 INFO L290 TraceCheckUtils]: 137: Hoare triple {291526#(= 8576 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 904 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {291526#(= 8576 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 904 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))))} is VALID [2022-04-28 15:41:57,684 INFO L290 TraceCheckUtils]: 138: Hoare triple {291526#(= 8576 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 904 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {291526#(= 8576 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 904 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))))} is VALID [2022-04-28 15:41:57,684 INFO L290 TraceCheckUtils]: 139: Hoare triple {291526#(= 8576 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 904 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {291526#(= 8576 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 904 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))))} is VALID [2022-04-28 15:41:57,685 INFO L290 TraceCheckUtils]: 140: Hoare triple {291526#(= 8576 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 904 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {291526#(= 8576 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 904 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))))} is VALID [2022-04-28 15:41:57,685 INFO L290 TraceCheckUtils]: 141: Hoare triple {291526#(= 8576 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 904 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {291526#(= 8576 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 904 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))))} is VALID [2022-04-28 15:41:57,685 INFO L290 TraceCheckUtils]: 142: Hoare triple {291526#(= 8576 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 904 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {291526#(= 8576 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 904 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))))} is VALID [2022-04-28 15:41:57,685 INFO L290 TraceCheckUtils]: 143: Hoare triple {291526#(= 8576 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 904 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {291526#(= 8576 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 904 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))))} is VALID [2022-04-28 15:41:57,686 INFO L290 TraceCheckUtils]: 144: Hoare triple {291526#(= 8576 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 904 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {291526#(= 8576 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 904 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))))} is VALID [2022-04-28 15:41:57,686 INFO L290 TraceCheckUtils]: 145: Hoare triple {291526#(= 8576 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 904 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {291526#(= 8576 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 904 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))))} is VALID [2022-04-28 15:41:57,686 INFO L290 TraceCheckUtils]: 146: Hoare triple {291526#(= 8576 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 904 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {291526#(= 8576 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 904 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))))} is VALID [2022-04-28 15:41:57,686 INFO L290 TraceCheckUtils]: 147: Hoare triple {291526#(= 8576 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 904 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {291526#(= 8576 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 904 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))))} is VALID [2022-04-28 15:41:57,687 INFO L290 TraceCheckUtils]: 148: Hoare triple {291526#(= 8576 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 904 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {291526#(= 8576 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 904 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))))} is VALID [2022-04-28 15:41:57,687 INFO L290 TraceCheckUtils]: 149: Hoare triple {291526#(= 8576 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 904 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {291526#(= 8576 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 904 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))))} is VALID [2022-04-28 15:41:57,687 INFO L290 TraceCheckUtils]: 150: Hoare triple {291526#(= 8576 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 904 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {291526#(= 8576 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 904 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))))} is VALID [2022-04-28 15:41:57,688 INFO L290 TraceCheckUtils]: 151: Hoare triple {291526#(= 8576 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 904 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {291526#(= 8576 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 904 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))))} is VALID [2022-04-28 15:41:57,688 INFO L290 TraceCheckUtils]: 152: Hoare triple {291526#(= 8576 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 904 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {291526#(= 8576 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 904 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))))} is VALID [2022-04-28 15:41:57,688 INFO L290 TraceCheckUtils]: 153: Hoare triple {291526#(= 8576 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 904 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {291526#(= 8576 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 904 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))))} is VALID [2022-04-28 15:41:57,688 INFO L290 TraceCheckUtils]: 154: Hoare triple {291526#(= 8576 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 904 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {291526#(= 8576 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 904 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))))} is VALID [2022-04-28 15:41:57,689 INFO L290 TraceCheckUtils]: 155: Hoare triple {291526#(= 8576 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 904 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {291526#(= 8576 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 904 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))))} is VALID [2022-04-28 15:41:57,689 INFO L290 TraceCheckUtils]: 156: Hoare triple {291526#(= 8576 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 904 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))))} assume 8448 == #t~mem68;havoc #t~mem68; {291526#(= 8576 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 904 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))))} is VALID [2022-04-28 15:41:57,689 INFO L290 TraceCheckUtils]: 157: Hoare triple {291526#(= 8576 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 904 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))))} assume !(~num1~0 > 0); {291526#(= 8576 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 904 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))))} is VALID [2022-04-28 15:41:57,690 INFO L290 TraceCheckUtils]: 158: Hoare triple {291526#(= 8576 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 904 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))))} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem133 := read~int(#t~mem132.base, 904 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 72 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {291527#(= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:41:57,690 INFO L290 TraceCheckUtils]: 159: Hoare triple {291527#(= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {291527#(= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:41:57,691 INFO L290 TraceCheckUtils]: 160: Hoare triple {291527#(= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {291527#(= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:41:57,691 INFO L290 TraceCheckUtils]: 161: Hoare triple {291527#(= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {291527#(= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:41:57,691 INFO L290 TraceCheckUtils]: 162: Hoare triple {291527#(= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {291527#(= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:41:57,692 INFO L290 TraceCheckUtils]: 163: Hoare triple {291527#(= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {291527#(= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:41:57,692 INFO L290 TraceCheckUtils]: 164: Hoare triple {291527#(= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {291527#(= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:41:57,692 INFO L290 TraceCheckUtils]: 165: Hoare triple {291527#(= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {291527#(= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:41:57,693 INFO L290 TraceCheckUtils]: 166: Hoare triple {291527#(= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {291527#(= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:41:57,693 INFO L290 TraceCheckUtils]: 167: Hoare triple {291527#(= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {291527#(= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:41:57,693 INFO L290 TraceCheckUtils]: 168: Hoare triple {291527#(= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {291527#(= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:41:57,694 INFO L290 TraceCheckUtils]: 169: Hoare triple {291527#(= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {291527#(= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:41:57,694 INFO L290 TraceCheckUtils]: 170: Hoare triple {291527#(= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {291527#(= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:41:57,694 INFO L290 TraceCheckUtils]: 171: Hoare triple {291527#(= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {291527#(= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:41:57,695 INFO L290 TraceCheckUtils]: 172: Hoare triple {291527#(= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {291527#(= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:41:57,695 INFO L290 TraceCheckUtils]: 173: Hoare triple {291527#(= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {291527#(= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:41:57,695 INFO L290 TraceCheckUtils]: 174: Hoare triple {291527#(= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {291527#(= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:41:57,696 INFO L290 TraceCheckUtils]: 175: Hoare triple {291527#(= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {291527#(= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:41:57,696 INFO L290 TraceCheckUtils]: 176: Hoare triple {291527#(= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {291527#(= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:41:57,696 INFO L290 TraceCheckUtils]: 177: Hoare triple {291527#(= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {291527#(= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:41:57,697 INFO L290 TraceCheckUtils]: 178: Hoare triple {291527#(= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {291527#(= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:41:57,697 INFO L290 TraceCheckUtils]: 179: Hoare triple {291527#(= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {291527#(= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:41:57,697 INFO L290 TraceCheckUtils]: 180: Hoare triple {291527#(= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {291527#(= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:41:57,698 INFO L290 TraceCheckUtils]: 181: Hoare triple {291527#(= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {291527#(= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:41:57,698 INFO L290 TraceCheckUtils]: 182: Hoare triple {291527#(= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {291527#(= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:41:57,698 INFO L290 TraceCheckUtils]: 183: Hoare triple {291527#(= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {291527#(= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:41:57,699 INFO L290 TraceCheckUtils]: 184: Hoare triple {291527#(= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {291527#(= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:41:57,699 INFO L290 TraceCheckUtils]: 185: Hoare triple {291527#(= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {291528#(= 8576 |ssl3_accept_#t~mem69|)} is VALID [2022-04-28 15:41:57,699 INFO L290 TraceCheckUtils]: 186: Hoare triple {291528#(= 8576 |ssl3_accept_#t~mem69|)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {291518#false} is VALID [2022-04-28 15:41:57,699 INFO L290 TraceCheckUtils]: 187: Hoare triple {291518#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {291518#false} is VALID [2022-04-28 15:41:57,699 INFO L290 TraceCheckUtils]: 188: Hoare triple {291518#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {291518#false} is VALID [2022-04-28 15:41:57,700 INFO L290 TraceCheckUtils]: 189: Hoare triple {291518#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {291518#false} is VALID [2022-04-28 15:41:57,700 INFO L290 TraceCheckUtils]: 190: Hoare triple {291518#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {291518#false} is VALID [2022-04-28 15:41:57,700 INFO L290 TraceCheckUtils]: 191: Hoare triple {291518#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {291518#false} is VALID [2022-04-28 15:41:57,700 INFO L290 TraceCheckUtils]: 192: Hoare triple {291518#false} assume 8640 == #t~mem75;havoc #t~mem75; {291518#false} is VALID [2022-04-28 15:41:57,700 INFO L290 TraceCheckUtils]: 193: Hoare triple {291518#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {291518#false} is VALID [2022-04-28 15:41:57,700 INFO L290 TraceCheckUtils]: 194: Hoare triple {291518#false} assume !(4 == ~blastFlag~0); {291518#false} is VALID [2022-04-28 15:41:57,700 INFO L290 TraceCheckUtils]: 195: Hoare triple {291518#false} assume !(7 == ~blastFlag~0); {291518#false} is VALID [2022-04-28 15:41:57,700 INFO L290 TraceCheckUtils]: 196: Hoare triple {291518#false} assume !(10 == ~blastFlag~0); {291518#false} is VALID [2022-04-28 15:41:57,700 INFO L290 TraceCheckUtils]: 197: Hoare triple {291518#false} assume !false; {291518#false} is VALID [2022-04-28 15:41:57,701 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 209 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-04-28 15:41:57,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:41:57,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274501938] [2022-04-28 15:41:57,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274501938] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 15:41:57,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246682763] [2022-04-28 15:41:57,701 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 15:41:57,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 15:41:57,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 15:41:57,724 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-28 15:41:57,727 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-28 15:42:33,463 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 15:42:33,463 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 15:42:33,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 1293 conjuncts, 212 conjunts are in the unsatisfiable core [2022-04-28 15:42:33,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:42:33,581 INFO L286 TraceCheckSpWp]: Computing forward predicates...